code: ///////////////////////////////////////////////////////////////////////////
  //                   __                _      _   ________               //
  //                  / /   ____  ____ _(_)____/ | / / ____/               //
  //                 / /   / __ \/ __ `/ / ___/  |/ / / __                 //
  //                / /___/ /_/ / /_/ / / /__/ /|  / /_/ /                 //
  //               /_____/\____/\__, /_/\___/_/ |_/\____/                  //
  //                           /____/                                      //
  //                                                                       //
  //               The Next Generation Logic Library                       //
  //                                                                       //
  ///////////////////////////////////////////////////////////////////////////
  //                                                                       //
  //  Copyright 2015-20xx Christoph Zengler                                //
  //                                                                       //
  //  Licensed under the Apache License, Version 2.0 (the "License");      //
  //  you may not use this file except in compliance with the License.     //
  //  You may obtain a copy of the License at                              //
  //                                                                       //
  //  http://www.apache.org/licenses/LICENSE-2.0                           //
  //                                                                       //
  //  Unless required by applicable law or agreed to in writing, software  //
  //  distributed under the License is distributed on an "AS IS" BASIS,    //
  //  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or      //
  //  implied.  See the License for the specific language governing        //
  //  permissions and limitations under the License.                       //
  //                                                                       //
  ///////////////////////////////////////////////////////////////////////////
  
  package org.logicng.cardinalityconstraints;
  
  import static org.assertj.core.api.Assertions.assertThat;
  
  import org.junit.jupiter.api.Test;
  import org.logicng.LogicNGTest;
  import org.logicng.LongRunningTag;
  import org.logicng.datastructures.Assignment;
  import org.logicng.formulas.CType;
  import org.logicng.formulas.CardinalityConstraint;
  import org.logicng.formulas.FormulaFactory;
  import org.logicng.formulas.Variable;
  import org.logicng.solvers.MiniSat;
  import org.logicng.solvers.SATSolver;
  
  /**
   * Performance tests for cardinality constraints.
   * @version 2.0.0
   * @since 1.1
   */
  public class CCPerformanceTest implements LogicNGTest {
  
      private final CCConfig[] configs;
  
      public CCPerformanceTest() {
          this.configs = new CCConfig[3];
          this.configs[0] = CCConfig.builder().amkEncoding(CCConfig.AMK_ENCODER.TOTALIZER).build();
          this.configs[1] = CCConfig.builder().amkEncoding(CCConfig.AMK_ENCODER.MODULAR_TOTALIZER).build();
          this.configs[2] = CCConfig.builder().amkEncoding(CCConfig.AMK_ENCODER.CARDINALITY_NETWORK).build();
      }
  
      @Test
      @LongRunningTag
      public void testAMKPerformance() {
          for (final CCConfig config : this.configs) {
              final FormulaFactory f = new FormulaFactory();
              f.putConfiguration(config);
              buildAMK(10_000, f, false);
              assertThat(f.newCCVariable().name()).endsWith("_0");
          }
      }
  
      @Test
      public void testAMKPerformanceMiniCard() {
          final FormulaFactory f = new FormulaFactory();
          buildAMK(10_000, f, true);
          assertThat(f.newCCVariable().name()).endsWith("_0");
      }
  
      private void buildAMK(final int numLits, final FormulaFactory f, final boolean miniCard) {
          final Variable[] problemLits = new Variable[numLits];
          for (int i = 0; i < numLits; i++) {
              problemLits[i] = f.variable("v" + i);
          }
          final SATSolver solver = miniCard ? MiniSat.miniCard(f) : MiniSat.miniSat(f);
          for (int i = 10; i < 100; i = i + 10) {
              final CardinalityConstraint cc = (CardinalityConstraint) f.cc(CType.LE, i, problemLits);
              solver.reset();
              solver.add(cc);
              assertSolverSat(solver);
              final Assignment model = solver.model();
              assertThat(cc.evaluate(model)).isTrue();
          }
      }
  }
  