/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/array-eq-symm.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:41:39,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:41:39,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:41:39,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:41:39,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:41:39,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:41:39,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:41:39,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:41:39,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:41:39,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:41:39,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:41:39,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:41:39,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:41:39,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:41:39,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:41:39,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:41:39,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:41:39,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:41:39,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:41:39,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:41:39,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:41:39,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:41:39,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:41:39,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:41:39,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:41:39,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:41:39,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:41:39,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:41:39,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:41:39,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:41:39,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:41:39,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:41:39,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:41:39,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:41:39,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:41:39,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:41:39,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:41:39,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:41:39,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:41:39,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:41:39,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:41:39,876 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:41:39,890 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:41:39,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:41:39,890 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:41:39,891 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:41:39,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:41:39,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:41:39,891 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:41:39,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:41:39,891 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:41:39,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:41:39,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:41:39,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:41:39,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:41:39,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:41:39,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:41:39,892 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:41:39,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:41:39,892 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:41:39,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:41:39,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:41:39,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:41:39,892 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:41:39,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:41:39,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:41:39,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:41:39,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:41:39,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:41:39,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:41:39,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:41:39,893 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:41:39,893 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:41:39,893 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:41:39,893 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 20:41:40,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:41:40,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:41:40,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:41:40,095 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 20:41:40,097 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 20:41:40,098 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/array-eq-symm.wvr.bpl [2022-03-15 20:41:40,099 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/array-eq-symm.wvr.bpl' [2022-03-15 20:41:40,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:41:40,117 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 20:41:40,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:41:40,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:41:40,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:41:40,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:41:40" (1/1) ... [2022-03-15 20:41:40,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:41:40" (1/1) ... [2022-03-15 20:41:40,137 INFO L137 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 20:41:40,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:41:40,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:41:40,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:41:40,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:41:40,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:41:40" (1/1) ... [2022-03-15 20:41:40,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:41:40" (1/1) ... [2022-03-15 20:41:40,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:41:40" (1/1) ... [2022-03-15 20:41:40,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:41:40" (1/1) ... [2022-03-15 20:41:40,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:41:40" (1/1) ... [2022-03-15 20:41:40,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:41:40" (1/1) ... [2022-03-15 20:41:40,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:41:40" (1/1) ... [2022-03-15 20:41:40,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:41:40,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:41:40,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:41:40,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:41:40,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:41:40" (1/1) ... [2022-03-15 20:41:40,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:41:40,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:41:40,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 20:41:40,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 20:41:40,205 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 20:41:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 20:41:40,205 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 20:41:40,205 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 20:41:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 20:41:40,206 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 20:41:40,206 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 20:41:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:41:40,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:41:40,206 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:41:40,252 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:41:40,253 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:41:40,327 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:41:40,331 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:41:40,332 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 20:41:40,335 INFO L202 PluginConnector]: Adding new model array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:41:40 BoogieIcfgContainer [2022-03-15 20:41:40,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:41:40,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:41:40,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:41:40,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:41:40,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:41:40" (1/2) ... [2022-03-15 20:41:40,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699de9c4 and model type array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:41:40, skipping insertion in model container [2022-03-15 20:41:40,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:41:40" (2/2) ... [2022-03-15 20:41:40,342 INFO L111 eAbstractionObserver]: Analyzing ICFG array-eq-symm.wvr.bpl [2022-03-15 20:41:40,346 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:41:40,346 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:41:40,346 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 20:41:40,346 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:41:40,387 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 20:41:40,439 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:41:40,445 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:41:40,446 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 20:41:40,456 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:41:40,464 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 25 transitions, 66 flow [2022-03-15 20:41:40,467 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 25 transitions, 66 flow [2022-03-15 20:41:40,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 66 flow [2022-03-15 20:41:40,491 INFO L129 PetriNetUnfolder]: 4/23 cut-off events. [2022-03-15 20:41:40,491 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 20:41:40,495 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 4/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 17. Up to 3 conditions per place. [2022-03-15 20:41:40,498 INFO L116 LiptonReduction]: Number of co-enabled transitions 126 [2022-03-15 20:41:40,907 INFO L131 LiptonReduction]: Checked pairs total: 98 [2022-03-15 20:41:40,907 INFO L133 LiptonReduction]: Total number of compositions: 15 [2022-03-15 20:41:40,912 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 13 transitions, 42 flow [2022-03-15 20:41:40,919 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-03-15 20:41:40,924 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:41:40,924 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:41:40,925 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:41:40,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:41:40,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1944872260, now seen corresponding path program 1 times [2022-03-15 20:41:40,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:41:40,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903076733] [2022-03-15 20:41:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:41:40,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:41:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:41:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:41,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:41:41,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903076733] [2022-03-15 20:41:41,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903076733] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:41:41,024 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:41:41,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 20:41:41,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1337456793] [2022-03-15 20:41:41,026 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:41:41,029 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:41:41,038 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 14 transitions. [2022-03-15 20:41:41,038 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:41:41,183 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:41:41,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:41:41,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:41:41,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:41:41,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:41:41,203 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:41:41,221 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2022-03-15 20:41:41,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:41:41,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-03-15 20:41:41,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:41:41,228 INFO L225 Difference]: With dead ends: 21 [2022-03-15 20:41:41,228 INFO L226 Difference]: Without dead ends: 18 [2022-03-15 20:41:41,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:41:41,239 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:41:41,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:41:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-03-15 20:41:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-03-15 20:41:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-03-15 20:41:41,263 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 32 transitions. Word has length 8 [2022-03-15 20:41:41,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:41:41,263 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 32 transitions. [2022-03-15 20:41:41,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 32 transitions. [2022-03-15 20:41:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:41:41,264 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:41:41,266 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:41:41,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:41:41,267 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:41:41,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:41:41,267 INFO L85 PathProgramCache]: Analyzing trace with hash 159205860, now seen corresponding path program 1 times [2022-03-15 20:41:41,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:41:41,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108477046] [2022-03-15 20:41:41,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:41:41,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:41:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:41:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:41,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:41:41,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108477046] [2022-03-15 20:41:41,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108477046] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:41:41,332 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:41:41,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:41:41,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1760391889] [2022-03-15 20:41:41,333 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:41:41,333 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:41:41,335 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2022-03-15 20:41:41,335 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:41:41,451 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [120#(and (or (= (+ i_AB (* (- 1) i_BA)) 0) (< i_AB An)) (or (< i_AB Bn) (= (+ i_AB (* (- 1) i_BA)) 0)) (or (not break_AB) (<= Bn i_AB) (<= An i_AB))), 119#(and (not break_AB) (< i_AB Bn) (< i_AB An))] [2022-03-15 20:41:41,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:41:41,452 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:41:41,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:41:41,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:41:41,453 INFO L87 Difference]: Start difference. First operand 18 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:41,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:41:41,500 INFO L93 Difference]: Finished difference Result 20 states and 34 transitions. [2022-03-15 20:41:41,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 20:41:41,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-03-15 20:41:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:41:41,502 INFO L225 Difference]: With dead ends: 20 [2022-03-15 20:41:41,502 INFO L226 Difference]: Without dead ends: 17 [2022-03-15 20:41:41,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:41:41,504 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:41:41,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:41:41,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-03-15 20:41:41,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-03-15 20:41:41,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 26 transitions. [2022-03-15 20:41:41,512 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 26 transitions. Word has length 9 [2022-03-15 20:41:41,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:41:41,512 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 26 transitions. [2022-03-15 20:41:41,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:41,513 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 26 transitions. [2022-03-15 20:41:41,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:41:41,513 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:41:41,513 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:41:41,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:41:41,515 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:41:41,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:41:41,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1103574409, now seen corresponding path program 1 times [2022-03-15 20:41:41,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:41:41,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841298381] [2022-03-15 20:41:41,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:41:41,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:41:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:41:41,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:41,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:41:41,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841298381] [2022-03-15 20:41:41,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841298381] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:41:41,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072387373] [2022-03-15 20:41:41,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:41:41,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:41:41,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:41:41,576 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:41:41,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 20:41:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:41:41,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:41:41,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:41:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:41,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:41:41,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2022-03-15 20:41:41,877 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2022-03-15 20:41:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:41,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072387373] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:41:41,974 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:41:41,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2022-03-15 20:41:41,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [213711671] [2022-03-15 20:41:41,975 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:41:41,975 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:41:41,976 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2022-03-15 20:41:41,977 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:41:42,099 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [231#(and (or (<= Bn i_AB) (<= An i_AB) (< i_BA Bn)) (or (<= Bn i_AB) (<= An i_AB) (< i_BA An)) (or (<= Bn i_AB) (<= An i_AB) (not break_BA))), 230#(or (<= Bn i_AB) (<= An i_AB))] [2022-03-15 20:41:42,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:41:42,100 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:41:42,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:41:42,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:41:42,101 INFO L87 Difference]: Start difference. First operand 15 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:42,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:41:42,136 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2022-03-15 20:41:42,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 20:41:42,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-03-15 20:41:42,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:41:42,137 INFO L225 Difference]: With dead ends: 20 [2022-03-15 20:41:42,137 INFO L226 Difference]: Without dead ends: 19 [2022-03-15 20:41:42,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:41:42,139 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:41:42,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 1 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:41:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-03-15 20:41:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-03-15 20:41:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2022-03-15 20:41:42,143 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 34 transitions. Word has length 9 [2022-03-15 20:41:42,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:41:42,144 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 34 transitions. [2022-03-15 20:41:42,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:42,146 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 34 transitions. [2022-03-15 20:41:42,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:41:42,147 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:41:42,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:41:42,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 20:41:42,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:41:42,356 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:41:42,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:41:42,356 INFO L85 PathProgramCache]: Analyzing trace with hash 146639633, now seen corresponding path program 1 times [2022-03-15 20:41:42,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:41:42,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933582243] [2022-03-15 20:41:42,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:41:42,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:41:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:41:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:42,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:41:42,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933582243] [2022-03-15 20:41:42,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933582243] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:41:42,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684326685] [2022-03-15 20:41:42,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:41:42,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:41:42,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:41:42,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:41:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:41:42,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:41:42,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 20:41:42,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:41:42,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 68 [2022-03-15 20:41:42,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2022-03-15 20:41:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:42,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:41:42,806 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 20:41:42,806 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 83 [2022-03-15 20:41:42,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72 [2022-03-15 20:41:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:42,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684326685] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:41:42,860 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:41:42,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 2] total 6 [2022-03-15 20:41:42,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [878989228] [2022-03-15 20:41:42,861 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:41:42,861 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:41:42,862 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 26 transitions. [2022-03-15 20:41:42,862 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:41:43,338 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [354#(and (or (= i_BA i_AB) (= (select A i_AB) (select B i_AB))) (or (= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))))), 355#(and (<= i_BA (+ i_AB 1)) (or (not (= (select B i_BA) (select A i_BA))) (= i_BA i_AB) (not (= (select A i_AB) (select B i_AB)))) (or (<= i_AB i_BA) (not (= (select A i_AB) (select B i_AB)))) (or (= i_BA i_AB) (= (select B i_BA) (select A i_BA)) (= (select A i_AB) (select B i_AB))) (or (not (= (select B i_BA) (select A i_BA))) (= (+ i_BA 1) i_AB) (= (select A i_AB) (select B i_AB))))] [2022-03-15 20:41:43,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:41:43,338 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:41:43,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:41:43,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:41:43,339 INFO L87 Difference]: Start difference. First operand 19 states and 34 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:41:43,390 INFO L93 Difference]: Finished difference Result 49 states and 89 transitions. [2022-03-15 20:41:43,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 20:41:43,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 20:41:43,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:41:43,392 INFO L225 Difference]: With dead ends: 49 [2022-03-15 20:41:43,392 INFO L226 Difference]: Without dead ends: 46 [2022-03-15 20:41:43,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:41:43,393 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 13 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:41:43,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 1 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:41:43,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-03-15 20:41:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2022-03-15 20:41:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 67 transitions. [2022-03-15 20:41:43,396 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 67 transitions. Word has length 10 [2022-03-15 20:41:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:41:43,396 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 67 transitions. [2022-03-15 20:41:43,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 67 transitions. [2022-03-15 20:41:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:41:43,397 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:41:43,397 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:41:43,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 20:41:43,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 20:41:43,612 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:41:43,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:41:43,613 INFO L85 PathProgramCache]: Analyzing trace with hash 251250461, now seen corresponding path program 2 times [2022-03-15 20:41:43,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:41:43,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933173635] [2022-03-15 20:41:43,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:41:43,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:41:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:41:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:43,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:41:43,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933173635] [2022-03-15 20:41:43,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933173635] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:41:43,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190771532] [2022-03-15 20:41:43,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:41:43,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:41:43,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:41:43,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:41:43,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 20:41:43,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:41:43,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:41:43,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:41:43,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:41:44,032 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 20:41:44,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 104 [2022-03-15 20:41:44,037 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 20:41:44,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 92 [2022-03-15 20:41:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:44,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:41:44,394 INFO L353 Elim1Store]: treesize reduction 20, result has 31.0 percent of original size [2022-03-15 20:41:44,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 122 [2022-03-15 20:41:44,399 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 96 [2022-03-15 20:41:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:44,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190771532] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:41:44,609 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:41:44,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-03-15 20:41:44,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1367562793] [2022-03-15 20:41:44,609 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:41:44,610 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:41:44,611 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 33 transitions. [2022-03-15 20:41:44,611 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:41:46,124 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [548#(and (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_BA (+ i_AB 1)) (< (+ i_AB 1) An) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_BA (+ i_AB 1)) (< (+ i_AB 1) Bn) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 545#(and (or break_BA (< i_AB An) (<= i_BA i_AB)) (or (not break_AB) (<= Bn i_BA) (<= An i_BA) break_BA) (or (<= i_AB i_BA) (< i_AB Bn) break_BA) (or (not break_AB) break_BA (<= i_BA i_AB)) (or (< i_AB Bn) break_BA (<= i_BA i_AB)) (or (<= i_AB i_BA) break_BA (< i_AB An))), 544#(and (or (<= i_AB i_BA) (< i_AB An)) (or (< i_BA (+ i_AB 1)) (< i_AB Bn)) (or (not break_AB) (< i_BA (+ i_AB 1))) (or (not break_AB) (<= i_AB i_BA)) (or (<= i_AB i_BA) (< i_AB Bn)) (or (< i_BA (+ i_AB 1)) (< i_AB An))), 546#(and (or (not (= (select B i_BA) (select A i_BA))) (< i_AB Bn) (<= (+ i_BA 1) i_AB)) (or (not break_AB) (not (= (select B i_BA) (select A i_BA))) (<= (+ i_BA 1) i_AB)) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ i_BA 1) i_AB) (< i_AB An)) (or (not break_AB) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (< i_AB Bn) (<= i_AB (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (< i_AB An) (<= i_AB (+ i_BA 1)))), 547#(and (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (< i_BA (+ 2 i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (< i_BA (+ 2 i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_AB i_BA) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (< i_BA (+ i_AB 1)) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 549#(and (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (<= i_AB i_BA) (< (+ i_AB 1) An) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (<= i_AB i_BA) (< (+ i_AB 1) Bn) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (< (+ i_AB 1) An) break_AB (<= i_BA i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (< (+ i_AB 1) Bn) break_AB (<= i_BA i_AB) (not (< i_AB An))))] [2022-03-15 20:41:46,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:41:46,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:41:46,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:41:46,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:41:46,125 INFO L87 Difference]: Start difference. First operand 32 states and 67 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:47,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:41:47,812 INFO L93 Difference]: Finished difference Result 64 states and 128 transitions. [2022-03-15 20:41:47,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 20:41:47,813 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:41:47,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:41:47,813 INFO L225 Difference]: With dead ends: 64 [2022-03-15 20:41:47,813 INFO L226 Difference]: Without dead ends: 52 [2022-03-15 20:41:47,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:41:47,814 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 60 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:41:47,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 1 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:41:47,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-15 20:41:47,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-03-15 20:41:47,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 35 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 80 transitions. [2022-03-15 20:41:47,818 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 80 transitions. Word has length 11 [2022-03-15 20:41:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:41:47,819 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 80 transitions. [2022-03-15 20:41:47,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 80 transitions. [2022-03-15 20:41:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:41:47,819 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:41:47,819 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:41:47,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 20:41:48,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:41:48,035 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:41:48,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:41:48,035 INFO L85 PathProgramCache]: Analyzing trace with hash -242913404, now seen corresponding path program 3 times [2022-03-15 20:41:48,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:41:48,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725781060] [2022-03-15 20:41:48,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:41:48,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:41:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:41:48,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:48,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:41:48,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725781060] [2022-03-15 20:41:48,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725781060] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:41:48,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445220660] [2022-03-15 20:41:48,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:41:48,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:41:48,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:41:48,136 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:41:48,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 20:41:48,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 20:41:48,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:41:48,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:41:48,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:41:48,449 INFO L353 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2022-03-15 20:41:48,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 92 [2022-03-15 20:41:48,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:41:48,460 INFO L353 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2022-03-15 20:41:48,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 78 [2022-03-15 20:41:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:48,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:41:49,002 INFO L353 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-03-15 20:41:49,002 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 195 [2022-03-15 20:41:49,011 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 20:41:49,011 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 173 [2022-03-15 20:41:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:49,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445220660] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:41:49,105 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:41:49,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-03-15 20:41:49,105 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1378814659] [2022-03-15 20:41:49,105 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:41:49,106 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:41:49,107 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 33 transitions. [2022-03-15 20:41:49,107 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:41:51,671 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [791#(and (or (not (< i_AB Bn)) (<= (+ 2 i_BA) Bn) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_AB i_BA) (< (+ i_AB 1) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 2 i_BA) An) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (<= i_BA i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (<= i_BA i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (not break_BA) (= (select A i_AB) (select B i_AB)) (<= i_AB (+ i_BA 1)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_AB i_BA) (< (+ i_AB 1) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select B i_BA) (select A i_BA)) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (= (select B i_BA) (select A i_BA)) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (not break_BA) (<= (+ i_BA 1) i_AB) (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 789#(and (or break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (not break_BA) (< i_BA (+ 2 i_AB)) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< i_BA (+ 3 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (< i_BA Bn) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (<= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1))) (or (<= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (< i_BA (+ 3 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (< i_BA An))), 784#(and (or (<= i_AB i_BA) (< i_AB An)) (or (< i_BA (+ i_AB 1)) (< i_AB Bn)) (or (not break_AB) (< i_BA (+ i_AB 1))) (or (not break_AB) (<= i_AB i_BA)) (or (<= i_AB i_BA) (< i_AB Bn)) (or (< i_BA (+ i_AB 1)) (< i_AB An))), 788#(and (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (< i_BA (+ 2 i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select A i_AB) (select B i_AB)) (< i_BA Bn) (not (< i_AB An))) (or (not (< i_AB Bn)) (< i_BA (+ i_AB 1)) break_AB (not break_BA) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (< i_BA (+ 2 i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_AB i_BA) break_AB (not break_BA) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select A i_AB) (select B i_AB)) (< i_BA An) (not (< i_AB An)))), 790#(and (or (not break_AB) (= (select B i_BA) (select A i_BA))) (or (not break_BA) (< i_AB An) (<= i_AB (+ i_BA 1))) (or (< i_AB Bn) (not break_BA) (<= i_AB (+ i_BA 1))) (or (< i_AB Bn) (= (select B i_BA) (select A i_BA))) (or (not break_AB) (not break_BA) (<= i_AB (+ i_BA 1))) (or (<= (+ i_BA 1) i_AB) (< i_AB An)) (or (not break_AB) (<= (+ 2 i_BA) Bn) (<= (+ i_BA 1) i_AB)) (or (= (select B i_BA) (select A i_BA)) (< i_AB An)) (or (<= (+ 2 i_BA) Bn) (<= i_AB (+ i_BA 1))) (or (not break_AB) (not break_BA) (<= (+ i_BA 1) i_AB)) (or (not break_AB) (<= (+ 2 i_BA) An) (<= (+ i_BA 1) i_AB)) (or (<= (+ 2 i_BA) An) (<= i_AB (+ i_BA 1))) (or (< i_AB Bn) (<= (+ i_BA 1) i_AB))), 786#(and (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (< i_BA (+ 2 i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (< i_BA (+ 2 i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_AB i_BA) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (< i_BA (+ i_AB 1)) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 792#(and (or break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (not break_BA) (<= Bn (+ i_AB 1)) (<= i_BA i_AB) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (<= i_BA (+ i_AB 1)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ 2 i_BA) An) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (<= i_BA (+ i_AB 1)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 787#(and (or (< i_BA (+ 3 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (< i_BA (+ 2 i_AB)) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (<= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1))) (or (<= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1))) (or break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (< i_BA (+ 3 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 785#(and (or (not break_AB) (< i_BA (+ i_AB 1)) (< i_BA Bn)) (or (<= i_AB i_BA) (< i_BA An)) (or (< i_BA (+ i_AB 1)) (< i_AB Bn)) (or (<= i_AB i_BA) (not break_BA) (< i_AB An)) (or (<= i_AB i_BA) (< i_AB Bn) (not break_BA)) (or (not break_AB) (< i_BA (+ i_AB 1)) (not break_BA)) (or (not break_AB) (<= i_AB i_BA) (not break_BA)) (or (not break_AB) (< i_BA (+ i_AB 1)) (< i_BA An)) (or (<= i_AB i_BA) (< i_BA Bn)) (or (< i_BA (+ i_AB 1)) (< i_AB An)))] [2022-03-15 20:41:51,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:41:51,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:41:51,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:41:51,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:41:51,672 INFO L87 Difference]: Start difference. First operand 36 states and 80 transitions. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:41:55,083 INFO L93 Difference]: Finished difference Result 71 states and 149 transitions. [2022-03-15 20:41:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 20:41:55,084 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:41:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:41:55,084 INFO L225 Difference]: With dead ends: 71 [2022-03-15 20:41:55,084 INFO L226 Difference]: Without dead ends: 63 [2022-03-15 20:41:55,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=376, Invalid=1430, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 20:41:55,086 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 109 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:41:55,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 1 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:41:55,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-03-15 20:41:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 42. [2022-03-15 20:41:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.4390243902439024) internal successors, (100), 41 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2022-03-15 20:41:55,091 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 100 transitions. Word has length 11 [2022-03-15 20:41:55,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:41:55,091 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 100 transitions. [2022-03-15 20:41:55,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:55,091 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 100 transitions. [2022-03-15 20:41:55,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:41:55,092 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:41:55,092 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:41:55,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 20:41:55,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:41:55,307 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:41:55,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:41:55,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1060008202, now seen corresponding path program 4 times [2022-03-15 20:41:55,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:41:55,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261109930] [2022-03-15 20:41:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:41:55,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:41:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:41:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:55,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:41:55,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261109930] [2022-03-15 20:41:55,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261109930] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:41:55,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632311214] [2022-03-15 20:41:55,404 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:41:55,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:41:55,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:41:55,405 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:41:55,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 20:41:55,422 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:41:55,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:41:55,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:41:55,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:41:55,772 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:41:55,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 111 [2022-03-15 20:41:55,781 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:41:55,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 97 [2022-03-15 20:41:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:55,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:41:56,445 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-03-15 20:41:56,445 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 200 [2022-03-15 20:41:56,458 INFO L353 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-03-15 20:41:56,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 168 [2022-03-15 20:41:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:56,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632311214] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:41:56,594 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:41:56,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 15 [2022-03-15 20:41:56,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1375091664] [2022-03-15 20:41:56,594 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:41:56,595 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:41:56,597 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 42 transitions. [2022-03-15 20:41:56,598 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:41:58,178 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1072#(and (or (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB)))) (or (not (= (select B i_BA) (select A i_BA))) break_AB (<= i_BA i_AB)) (or (<= i_BA (+ i_AB 1)) break_AB) (or (= i_BA i_AB) break_AB (= (select B i_BA) (select A i_BA)) (= (select A i_AB) (select B i_AB))) (or break_AB (<= i_AB (+ i_BA 1)))), 1076#(and (or (= (+ i_AB 1) i_BA) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_BA i_AB)) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB)))) (or (= i_BA i_AB) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (or (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_AB (+ i_BA 1)))), 1075#(and (or (= (+ i_AB 1) i_BA) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (or (not (= (select B i_BA) (select A i_BA))) (= i_BA i_AB) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (or (not (= (select B i_BA) (select A i_BA))) (= (+ i_AB 1) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (+ 2 i_AB) i_BA) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 1074#(and (or (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (+ i_AB 1) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))), 1073#(and (or break_AB (<= i_BA i_AB)) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (= (+ i_BA 1) i_AB) (= (select A i_AB) (select B i_AB))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_AB (+ i_BA 1))) (or break_AB (= (select B i_BA) (select A i_BA))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (<= (+ i_BA 1) i_AB)) (or (<= i_AB (+ 2 i_BA)) break_AB)), 1071#(and (or (= i_BA i_AB) break_AB (= (select A i_AB) (select B i_AB))) (or (= (+ i_AB 1) i_BA) break_AB (not (= (select A i_AB) (select B i_AB)))))] [2022-03-15 20:41:58,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:41:58,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:41:58,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:41:58,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:41:58,179 INFO L87 Difference]: Start difference. First operand 42 states and 100 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:41:58,366 INFO L93 Difference]: Finished difference Result 117 states and 232 transitions. [2022-03-15 20:41:58,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:41:58,366 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:41:58,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:41:58,367 INFO L225 Difference]: With dead ends: 117 [2022-03-15 20:41:58,367 INFO L226 Difference]: Without dead ends: 114 [2022-03-15 20:41:58,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:41:58,367 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 45 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:41:58,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 1 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:41:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-03-15 20:41:58,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 58. [2022-03-15 20:41:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.526315789473684) internal successors, (144), 57 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 144 transitions. [2022-03-15 20:41:58,371 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 144 transitions. Word has length 12 [2022-03-15 20:41:58,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:41:58,372 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 144 transitions. [2022-03-15 20:41:58,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:41:58,372 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 144 transitions. [2022-03-15 20:41:58,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:41:58,372 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:41:58,372 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:41:58,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 20:41:58,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:41:58,592 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:41:58,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:41:58,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1587863653, now seen corresponding path program 5 times [2022-03-15 20:41:58,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:41:58,593 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745558126] [2022-03-15 20:41:58,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:41:58,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:41:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:41:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:58,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:41:58,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745558126] [2022-03-15 20:41:58,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745558126] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:41:58,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30766944] [2022-03-15 20:41:58,644 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:41:58,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:41:58,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:41:58,646 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:41:58,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 20:41:58,664 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 20:41:58,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:41:58,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:41:58,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:41:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:41:58,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:41:58,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:41:58,999 INFO L353 Elim1Store]: treesize reduction 10, result has 47.4 percent of original size [2022-03-15 20:41:59,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 68 [2022-03-15 20:41:59,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2022-03-15 20:41:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:41:59,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30766944] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:41:59,120 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:41:59,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2022-03-15 20:41:59,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [53855605] [2022-03-15 20:41:59,120 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:41:59,121 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:41:59,123 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 40 transitions. [2022-03-15 20:41:59,123 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:41:59,995 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1395#(and (or break_AB (< i_BA An)) (or break_AB (< i_BA Bn)) (or break_AB (not break_BA))), 1394#(and (or (<= Bn i_BA) (<= An i_BA) break_BA (= (select B i_BA) (select A i_BA))) (or (<= Bn i_BA) (<= An i_BA) break_BA (< (+ i_BA 1) Bn)) (or (< (+ i_BA 1) An) (<= Bn i_BA) (<= An i_BA) break_BA)), 1393#(and (not break_BA) (< i_BA Bn) (< i_BA An)), 1397#(and (or (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (< (+ i_BA 1) Bn)) (or (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (= (select B i_BA) (select A i_BA))) (or (not (< i_BA Bn)) (< (+ i_BA 1) An) (not (< i_BA An)) break_AB break_BA)), 1396#(and (or (<= Bn i_AB) (<= An i_AB) break_AB (not break_BA)) (or (<= Bn i_AB) (<= An i_AB) break_AB (< i_BA An)) (or (<= Bn i_AB) (<= An i_AB) break_AB (< i_BA Bn))), 1398#(and (or (not (< i_BA Bn)) (<= Bn i_AB) (<= An i_AB) (not (< i_BA An)) break_AB break_BA (= (select B i_BA) (select A i_BA))) (or (not (< i_BA Bn)) (<= Bn i_AB) (not (< i_BA An)) break_AB break_BA (< (+ i_BA 1) Bn)) (or (not (< i_BA Bn)) (< (+ i_BA 1) An) (<= An i_AB) (not (< i_BA An)) break_AB break_BA))] [2022-03-15 20:41:59,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:41:59,996 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:41:59,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:41:59,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:41:59,996 INFO L87 Difference]: Start difference. First operand 58 states and 144 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:00,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:00,379 INFO L93 Difference]: Finished difference Result 83 states and 181 transitions. [2022-03-15 20:42:00,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 20:42:00,379 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:42:00,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:00,380 INFO L225 Difference]: With dead ends: 83 [2022-03-15 20:42:00,380 INFO L226 Difference]: Without dead ends: 80 [2022-03-15 20:42:00,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:42:00,380 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 40 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:00,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 1 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:00,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-03-15 20:42:00,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 62. [2022-03-15 20:42:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 2.360655737704918) internal successors, (144), 61 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 144 transitions. [2022-03-15 20:42:00,384 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 144 transitions. Word has length 12 [2022-03-15 20:42:00,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:00,384 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 144 transitions. [2022-03-15 20:42:00,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:00,384 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 144 transitions. [2022-03-15 20:42:00,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:42:00,385 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:00,385 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:00,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:00,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:00,602 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:00,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:00,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1499094972, now seen corresponding path program 6 times [2022-03-15 20:42:00,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:00,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381057970] [2022-03-15 20:42:00,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:00,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:00,709 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:00,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381057970] [2022-03-15 20:42:00,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381057970] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:00,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132062576] [2022-03-15 20:42:00,710 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:42:00,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:00,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:00,711 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:00,732 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:42:00,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:00,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:42:00,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:00,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 20:42:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:01,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:01,318 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:01,329 INFO L353 Elim1Store]: treesize reduction 36, result has 20.0 percent of original size [2022-03-15 20:42:01,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 101 [2022-03-15 20:42:01,339 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 20:42:01,340 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 73 [2022-03-15 20:42:01,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:01,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132062576] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:01,417 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:01,417 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2022-03-15 20:42:01,417 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1370107179] [2022-03-15 20:42:01,417 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:01,418 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:01,421 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 51 transitions. [2022-03-15 20:42:01,421 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:04,324 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [1725#(and (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ i_AB 1) An) break_AB (<= (+ i_BA 1) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ i_AB 1) An) break_AB (<= i_AB (+ i_BA 1)) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ i_AB 1) Bn) break_AB (<= i_AB (+ i_BA 1)) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ i_AB 1) Bn) break_AB (<= (+ i_BA 1) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select B i_BA) (select A i_BA)) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (= (select B i_BA) (select A i_BA)) (not (< i_AB An)))), 1722#(and (or (not (= (select B i_BA) (select A i_BA))) (< i_AB Bn) (<= (+ i_BA 1) i_AB)) (or (not break_AB) (not (= (select B i_BA) (select A i_BA))) (<= (+ i_BA 1) i_AB)) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ i_BA 1) i_AB) (< i_AB An)) (or (not break_AB) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (< i_AB Bn) (<= i_AB (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (< i_AB An) (<= i_AB (+ i_BA 1)))), 1720#(and (or break_BA (< i_AB An) (<= i_BA i_AB)) (or (not break_AB) (<= Bn i_BA) (<= An i_BA) break_BA) (or (<= i_AB i_BA) (< i_AB Bn) break_BA) (or (not break_AB) break_BA (<= i_BA i_AB)) (or (< i_AB Bn) break_BA (<= i_BA i_AB)) (or (<= i_AB i_BA) break_BA (< i_AB An))), 1719#(and (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (= i_BA i_AB) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 1729#(and (or (< (+ 2 i_AB) Bn) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= i_BA i_AB) (<= An (+ i_AB 1))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= i_BA i_AB) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 1724#(and (or (not break_AB) (= (select B i_BA) (select A i_BA))) (or (< i_AB Bn) (= (select B i_BA) (select A i_BA))) (or (not break_AB) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= (+ 2 i_BA) i_AB)) (or (<= i_AB (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< i_AB An)) (or (<= i_AB (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< i_AB Bn)) (or (= (select B i_BA) (select A i_BA)) (< i_AB An)) (or (not break_AB) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= An (+ 2 i_BA))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< i_AB Bn) (<= (+ 2 i_BA) i_AB)) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< i_AB An) (<= (+ 2 i_BA) i_AB))), 1728#(and (or (not (= (select B i_BA) (select A i_BA))) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (< (+ 2 i_AB) Bn) (<= i_BA (+ i_AB 1)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= i_BA (+ i_AB 1)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (< (+ 2 i_AB) Bn) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 1721#(and (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_BA (+ i_AB 1)) (< (+ i_AB 1) An) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_BA (+ i_AB 1)) (< (+ i_AB 1) Bn) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 1723#(and (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (<= i_AB i_BA) (< (+ i_AB 1) An) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (<= i_AB i_BA) (< (+ i_AB 1) Bn) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (< (+ i_AB 1) An) break_AB (<= i_BA i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (< (+ i_AB 1) Bn) break_AB (<= i_BA i_AB) (not (< i_AB An)))), 1718#(and (or (= i_BA i_AB) (< i_AB An)) (or (not break_AB) (= i_BA i_AB)) (or (= i_BA i_AB) (< i_AB Bn))), 1727#(and (or (< (+ 2 i_AB) Bn) (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= i_BA (+ 2 i_AB)) (<= An (+ i_AB 1))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= i_BA (+ 2 i_AB)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 1726#(and (or (< (+ 2 i_AB) Bn) (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1))) (or (= (+ i_AB 1) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1))))] [2022-03-15 20:42:04,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:42:04,324 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:04,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:42:04,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:42:04,325 INFO L87 Difference]: Start difference. First operand 62 states and 144 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:06,932 INFO L93 Difference]: Finished difference Result 81 states and 173 transitions. [2022-03-15 20:42:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 20:42:06,932 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:42:06,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:06,932 INFO L225 Difference]: With dead ends: 81 [2022-03-15 20:42:06,932 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 20:42:06,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=360, Invalid=2090, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 20:42:06,933 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 104 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:06,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 1 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:42:06,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 20:42:06,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2022-03-15 20:42:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 2.338709677419355) internal successors, (145), 62 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 145 transitions. [2022-03-15 20:42:06,943 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 145 transitions. Word has length 13 [2022-03-15 20:42:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:06,943 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 145 transitions. [2022-03-15 20:42:06,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 145 transitions. [2022-03-15 20:42:06,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:42:06,945 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:06,945 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:06,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:07,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:07,161 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:07,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:07,162 INFO L85 PathProgramCache]: Analyzing trace with hash 361694397, now seen corresponding path program 7 times [2022-03-15 20:42:07,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:07,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752075930] [2022-03-15 20:42:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:07,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:07,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:07,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752075930] [2022-03-15 20:42:07,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752075930] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:07,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895481426] [2022-03-15 20:42:07,285 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:42:07,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:07,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:07,286 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:07,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 20:42:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:07,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:42:07,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:07,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:07,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:07,922 INFO L353 Elim1Store]: treesize reduction 42, result has 17.6 percent of original size [2022-03-15 20:42:07,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 70 [2022-03-15 20:42:07,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-03-15 20:42:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:07,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895481426] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:07,959 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:07,959 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 20:42:07,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1680762716] [2022-03-15 20:42:07,959 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:07,962 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:07,964 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 51 transitions. [2022-03-15 20:42:07,964 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:13,989 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [2075#(and (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) (< i_BA (+ i_AB 4)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) (< i_BA (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 2072#(and (or (< i_BA (+ 3 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (< i_BA (+ 2 i_AB)) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (<= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1))) (or (<= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1))) (or break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (< i_BA (+ 3 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 2071#(and (or (not (< i_AB Bn)) (<= (+ 2 i_BA) Bn) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (<= Bn i_AB) (<= An i_AB) break_AB (= (select B i_BA) (select A i_BA)) (= (select A i_AB) (select B i_AB))) (or (not (< i_AB Bn)) (<= (+ 2 i_BA) An) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (not break_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (<= i_BA i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (<= i_BA i_AB) (not (< i_AB An))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) An) break_AB (= (select B i_BA) (select A i_BA))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) break_AB (= (select B i_BA) (select A i_BA))) (or (not (< i_AB Bn)) break_AB (not break_BA) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (not break_BA) (not (< i_AB An)))), 2080#(and (or (<= (+ 3 i_BA) An) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (<= (+ 3 i_BA) Bn)) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= i_BA i_AB) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= i_BA i_AB) (<= An (+ i_AB 1)))), 2068#(and (or (not break_AB) (< i_BA (+ i_AB 1)) (< i_BA Bn)) (or (<= i_AB i_BA) (< i_BA An)) (or (not break_BA) (< i_AB An)) (or (< i_BA (+ i_AB 1)) (< i_AB Bn)) (or (< i_AB Bn) (not break_BA)) (or (not break_AB) (not break_BA)) (or (not break_AB) (< i_BA (+ i_AB 1)) (< i_BA An)) (or (<= i_AB i_BA) (< i_BA Bn)) (or (< i_BA (+ i_AB 1)) (< i_AB An))), 2073#(and (or (< i_BA (+ 3 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (< i_BA Bn) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (< i_BA (+ 3 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (< i_BA An))), 2066#(and (or (<= i_AB i_BA) (< i_AB An)) (or (< i_BA (+ i_AB 1)) (< i_AB Bn)) (or (not break_AB) (< i_BA (+ i_AB 1))) (or (not break_AB) (<= i_AB i_BA)) (or (<= i_AB i_BA) (< i_AB Bn)) (or (< i_BA (+ i_AB 1)) (< i_AB An))), 2069#(and (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (< i_BA (+ 2 i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select A i_AB) (select B i_AB)) (< i_BA Bn) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (not break_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (< i_BA (+ 2 i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select A i_AB) (select B i_AB)) (< i_BA An) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (not break_BA) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (not break_BA) (not (< i_AB An)))), 2076#(and (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (<= i_BA (+ i_AB 1)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ 2 i_BA) An) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (<= i_BA (+ i_AB 1)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 2081#(and (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 3 i_BA) Bn)) (or (<= (+ 3 i_BA) An) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 2077#(and (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 2 i_BA) An) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 2079#(and (or (<= Bn i_AB) (<= An i_AB) break_AB (= (select B i_BA) (select A i_BA)) (= (select A i_AB) (select B i_AB))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (not break_BA) (not (< i_AB An))) (or (<= Bn i_AB) (<= An i_AB) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (= (select A i_AB) (select B i_AB))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) An) break_AB (= (select B i_BA) (select A i_BA))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB) (or (<= Bn i_AB) (<= An i_AB) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) (< (+ i_AB 1) An) break_AB) (or (not (< i_AB Bn)) break_AB (= (select A i_AB) (select B i_AB)) (<= (+ 3 i_BA) Bn) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (<= (+ i_BA 1) i_AB) (not (< i_AB An))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) break_AB (= (select B i_BA) (select A i_BA))) (or (not (< i_AB Bn)) break_AB (not break_BA) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (<= (+ i_BA 1) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (not break_BA) (not (< i_AB An))) (or (<= (+ 3 i_BA) An) (not (< i_AB Bn)) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 2067#(and (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (< i_BA (+ 2 i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (< i_BA (+ 2 i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_AB i_BA) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (< i_BA (+ i_AB 1)) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 2078#(and (or (not break_AB) (= (select B i_BA) (select A i_BA))) (or (< i_AB Bn) (<= (+ 2 i_BA) i_AB)) (or (< i_AB Bn) (= (select B i_BA) (select A i_BA))) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) (< i_AB An)) (or (< i_AB An) (<= (+ 2 i_BA) i_AB)) (or (not break_BA) (< i_AB An)) (or (<= (+ 3 i_BA) An) (not break_AB) (<= (+ 2 i_BA) i_AB)) (or (<= (+ 3 i_BA) An) (<= i_AB (+ 2 i_BA))) (or (< i_AB Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (or (not break_AB) (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (or (not break_AB) (<= (+ 3 i_BA) Bn) (<= (+ 2 i_BA) i_AB)) (or (<= i_AB (+ 2 i_BA)) (<= (+ 3 i_BA) Bn)) (or (= (select B i_BA) (select A i_BA)) (< i_AB An)) (or (< i_AB Bn) (not break_BA)) (or (not break_AB) (not break_BA))), 2074#(and (or (<= Bn (+ 2 i_AB)) (< i_BA (+ i_AB 4)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< i_BA (+ 3 i_AB)) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 3 i_AB) i_BA) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 3 i_AB) i_BA) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (<= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) (< i_BA (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 2070#(and (or (not break_AB) (= (select B i_BA) (select A i_BA))) (or (< i_AB Bn) (= (select B i_BA) (select A i_BA))) (or (not break_BA) (< i_AB An)) (or (<= (+ i_BA 1) i_AB) (< i_AB An)) (or (not break_AB) (<= (+ 2 i_BA) Bn) (<= (+ i_BA 1) i_AB)) (or (= (select B i_BA) (select A i_BA)) (< i_AB An)) (or (<= (+ 2 i_BA) Bn) (<= i_AB (+ i_BA 1))) (or (< i_AB Bn) (not break_BA)) (or (not break_AB) (not break_BA)) (or (not break_AB) (<= (+ 2 i_BA) An) (<= (+ i_BA 1) i_AB)) (or (<= (+ 2 i_BA) An) (<= i_AB (+ i_BA 1))) (or (< i_AB Bn) (<= (+ i_BA 1) i_AB)))] [2022-03-15 20:42:13,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:42:13,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:13,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:42:13,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 20:42:13,990 INFO L87 Difference]: Start difference. First operand 63 states and 145 transitions. Second operand has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:22,894 INFO L93 Difference]: Finished difference Result 166 states and 377 transitions. [2022-03-15 20:42:22,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 20:42:22,894 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:42:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:22,895 INFO L225 Difference]: With dead ends: 166 [2022-03-15 20:42:22,895 INFO L226 Difference]: Without dead ends: 156 [2022-03-15 20:42:22,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1021, Invalid=4985, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 20:42:22,897 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 198 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:22,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 1 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:42:22,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-03-15 20:42:22,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 99. [2022-03-15 20:42:22,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 2.7346938775510203) internal successors, (268), 98 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 268 transitions. [2022-03-15 20:42:22,902 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 268 transitions. Word has length 13 [2022-03-15 20:42:22,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:22,902 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 268 transitions. [2022-03-15 20:42:22,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:22,902 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 268 transitions. [2022-03-15 20:42:22,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:42:22,903 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:22,903 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:22,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:23,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 20:42:23,116 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:23,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:23,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1671986447, now seen corresponding path program 8 times [2022-03-15 20:42:23,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:23,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40827855] [2022-03-15 20:42:23,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:23,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:23,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:23,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:23,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40827855] [2022-03-15 20:42:23,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40827855] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:23,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588292349] [2022-03-15 20:42:23,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:42:23,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:23,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:23,280 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:23,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 20:42:23,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:42:23,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:23,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 20:42:23,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:23,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 78 [2022-03-15 20:42:23,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2022-03-15 20:42:23,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:23,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:24,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:24,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:24,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:24,937 INFO L353 Elim1Store]: treesize reduction 95, result has 26.4 percent of original size [2022-03-15 20:42:24,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 291 treesize of output 280 [2022-03-15 20:42:24,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:24,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:24,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:24,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:24,958 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:42:24,958 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 245 treesize of output 229 [2022-03-15 20:42:25,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:25,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588292349] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:25,117 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:25,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-03-15 20:42:25,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [760175523] [2022-03-15 20:42:25,117 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:25,118 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:25,122 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 62 transitions. [2022-03-15 20:42:25,122 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:29,014 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [2634#(and (or (not (= (select B i_BA) (select A i_BA))) (<= i_BA (+ i_AB 1)) break_AB break_BA (not (= (select A i_AB) (select B i_AB)))) (or (<= i_BA (+ i_AB 1)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (or (<= i_AB i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB)))) (or break_AB break_BA (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= i_BA (+ 2 i_AB)))), 2640#(and (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB)))) (or break_AB (= i_BA 0) (not (= (select A i_AB) (select B i_AB)))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= i_AB 1) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select B 2) (select A 2))) (or (<= 0 i_AB) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB)))) (or (not (= (select B 2) (select A 2))) (<= i_AB 1) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B 2) (select A 2))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_AB 2)) (or (not (= (select B 2) (select A 2))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= 1 i_AB))), 2632#(and (or (<= i_AB (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB) (or (not (= (select B i_BA) (select A i_BA))) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (<= i_AB (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) break_AB (<= i_BA i_AB)) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_AB (+ i_BA 1))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (<= (+ i_BA 1) i_AB))), 2636#(and (or (<= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< i_BA (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 3 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< i_BA (+ 3 i_AB)) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 2635#(and (or (not (= (select B i_BA) (select A i_BA))) (<= i_BA (+ i_AB 1)) break_AB (not (= (select A i_AB) (select B i_AB)))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_BA i_AB)) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_AB (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= i_AB i_BA) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (not (= (select A i_AB) (select B i_AB))))), 2630#(and (or (<= i_AB i_BA) break_AB) (or (< i_BA (+ i_AB 1)) break_AB (= (select A i_AB) (select B i_AB))) (or break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB)))) (or break_AB (< i_BA (+ 2 i_AB)))), 2638#(and (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 2639#(and (or (not (= (select B 2) (select A 2))) break_AB (<= i_AB 3)) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (= (select B 2) (select A 2)) (<= i_AB 2)) (or break_AB (= i_BA 0)) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (<= 1 i_AB)) (or break_AB (= (select B i_BA) (select A i_BA))) (or (not (= (select B 2) (select A 2))) break_AB (<= 2 i_AB)) (or (not (= (select B 2) (select A 2))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_AB 2))), 2641#(and (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= 0 (+ i_AB 1)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (= i_BA 0) (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= 0 i_AB) (not (= (select B 2) (select A 2))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B 2) (select A 2))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_AB 0)) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select B 2) (select A 2)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_AB 0)) (or (not (= (select B 2) (select A 2))) (<= i_AB 1) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 2633#(and (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (< i_BA (+ 2 i_AB))) (or (<= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB)))) (or (< i_BA (+ 3 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))))), 2631#(and (or (<= i_AB i_BA) break_AB break_BA (= (select B i_BA) (select A i_BA))) (or (<= i_AB i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB)))) (or (<= i_BA (+ i_AB 1)) break_AB break_BA) (or break_AB break_BA (= (select A i_AB) (select B i_AB)) (<= i_BA i_AB)) (or (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (<= i_BA i_AB)) (or break_AB break_BA (<= i_AB (+ i_BA 1)))), 2637#(and (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or (not (= (select B i_BA) (select A i_BA))) (< i_BA (+ 3 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))))] [2022-03-15 20:42:29,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 20:42:29,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:29,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 20:42:29,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:42:29,015 INFO L87 Difference]: Start difference. First operand 99 states and 268 transitions. Second operand has 21 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:29,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:29,560 INFO L93 Difference]: Finished difference Result 230 states and 525 transitions. [2022-03-15 20:42:29,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:42:29,560 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:42:29,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:29,562 INFO L225 Difference]: With dead ends: 230 [2022-03-15 20:42:29,562 INFO L226 Difference]: Without dead ends: 227 [2022-03-15 20:42:29,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=189, Invalid=1293, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 20:42:29,562 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 49 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:29,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 1 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:42:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-03-15 20:42:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 117. [2022-03-15 20:42:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.7413793103448274) internal successors, (318), 116 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 318 transitions. [2022-03-15 20:42:29,569 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 318 transitions. Word has length 14 [2022-03-15 20:42:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:29,569 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 318 transitions. [2022-03-15 20:42:29,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 318 transitions. [2022-03-15 20:42:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:42:29,570 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:29,570 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:29,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:29,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:29,785 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:29,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:29,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1134135092, now seen corresponding path program 9 times [2022-03-15 20:42:29,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:29,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941507128] [2022-03-15 20:42:29,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:29,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:29,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:29,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941507128] [2022-03-15 20:42:29,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941507128] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:29,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291780193] [2022-03-15 20:42:29,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:42:29,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:29,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:29,874 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:29,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 20:42:29,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:42:29,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:29,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:42:29,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:30,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:30,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:30,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:30,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:30,674 INFO L353 Elim1Store]: treesize reduction 51, result has 21.5 percent of original size [2022-03-15 20:42:30,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 117 treesize of output 114 [2022-03-15 20:42:30,688 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 20:42:30,689 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 73 [2022-03-15 20:42:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:30,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291780193] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:30,774 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:30,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2022-03-15 20:42:30,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1163301246] [2022-03-15 20:42:30,775 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:30,775 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:30,778 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 60 transitions. [2022-03-15 20:42:30,778 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:33,203 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [3218#(and (or (<= Bn i_BA) (<= An i_BA) break_BA (= (select B i_BA) (select A i_BA))) (or (<= (+ 3 i_BA) An) (<= Bn i_BA) (<= An i_BA) break_BA) (or (<= Bn i_BA) (<= An i_BA) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_BA) (or (<= Bn i_BA) (<= An i_BA) break_BA (<= (+ 3 i_BA) Bn))), 3221#(and (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 3217#(and (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (< i_BA Bn) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< i_BA Bn) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1)) (< i_BA An)) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (< i_BA An))), 3212#(and (or (<= Bn i_AB) (<= An i_AB) break_AB (= (select A i_AB) (select B i_AB))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) An) break_AB) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) break_AB)), 3211#(and (not break_AB) (< i_AB Bn) (< i_AB An)), 3216#(and (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) break_AB (< i_BA Bn)) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) An) break_AB (not break_BA)) (or (<= Bn i_AB) (<= An i_AB) break_AB (not break_BA) (= (select A i_AB) (select B i_AB))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) An) break_AB (< i_BA An)) (or (<= Bn i_AB) (<= An i_AB) break_AB (= (select A i_AB) (select B i_AB)) (< i_BA Bn)) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) break_AB (not break_BA)) (or (<= Bn i_AB) (<= An i_AB) break_AB (= (select A i_AB) (select B i_AB)) (< i_BA An))), 3222#(and (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 3215#(and (or (not break_AB) (< i_BA An)) (or (< i_AB Bn) (< i_BA Bn)) (or (not break_BA) (< i_AB An)) (or (< i_AB An) (< i_BA An)) (or (< i_AB Bn) (not break_BA)) (or (not break_AB) (not break_BA)) (or (not break_AB) (< i_BA Bn))), 3220#(and (or (<= Bn i_BA) (<= An i_BA) break_AB break_BA (= (select B i_BA) (select A i_BA))) (or (<= Bn i_BA) (<= An i_BA) break_AB break_BA (= (+ i_BA 1) i_AB))), 3223#(and (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 3213#(and (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 3219#(and (or (<= Bn i_BA) (<= An i_BA) break_AB break_BA (= (select B i_BA) (select A i_BA))) (or (not (< i_BA Bn)) (not (< i_BA An)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA) (or (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (<= (+ 2 i_BA) i_AB))), 3214#(and (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))))] [2022-03-15 20:42:33,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 20:42:33,204 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:33,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 20:42:33,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=925, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:42:33,204 INFO L87 Difference]: Start difference. First operand 117 states and 318 transitions. Second operand has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:38,929 INFO L93 Difference]: Finished difference Result 234 states and 562 transitions. [2022-03-15 20:42:38,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 20:42:38,929 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:42:38,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:38,930 INFO L225 Difference]: With dead ends: 234 [2022-03-15 20:42:38,930 INFO L226 Difference]: Without dead ends: 231 [2022-03-15 20:42:38,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1036, Invalid=3934, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 20:42:38,932 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 122 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:38,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 1 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:42:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-03-15 20:42:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 147. [2022-03-15 20:42:38,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.828767123287671) internal successors, (413), 146 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 413 transitions. [2022-03-15 20:42:38,937 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 413 transitions. Word has length 14 [2022-03-15 20:42:38,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:38,937 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 413 transitions. [2022-03-15 20:42:38,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:38,937 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 413 transitions. [2022-03-15 20:42:38,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:42:38,938 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:38,938 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:38,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:39,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 20:42:39,138 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:39,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:39,139 INFO L85 PathProgramCache]: Analyzing trace with hash -291583171, now seen corresponding path program 10 times [2022-03-15 20:42:39,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:39,139 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242983672] [2022-03-15 20:42:39,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:39,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:39,282 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:39,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242983672] [2022-03-15 20:42:39,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242983672] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:39,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83525702] [2022-03-15 20:42:39,282 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:42:39,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:39,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:39,283 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:39,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 20:42:39,303 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:42:39,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:39,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:42:39,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:39,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:40,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:40,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:40,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:40,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:40,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:40,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:40,266 INFO L353 Elim1Store]: treesize reduction 83, result has 14.4 percent of original size [2022-03-15 20:42:40,267 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 98 treesize of output 91 [2022-03-15 20:42:40,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-03-15 20:42:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:40,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83525702] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:40,311 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:40,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2022-03-15 20:42:40,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1258525099] [2022-03-15 20:42:40,311 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:40,312 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:40,316 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 73 transitions. [2022-03-15 20:42:40,316 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:45,982 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [3952#(and (or (not (< i_AB Bn)) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_AB (+ 2 i_BA)) (< (+ i_AB 1) Bn) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= (+ 2 i_BA) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= (+ 2 i_BA) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select B i_BA) (select A i_BA)) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_AB (+ 2 i_BA)) (< (+ i_AB 1) An) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (= (select B i_BA) (select A i_BA)) (not (< i_AB An)))), 3946#(and (or (= i_BA (+ 3 i_AB)) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= i_BA (+ 3 i_AB)) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 3939#(and (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (= i_BA i_AB) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 3938#(and (or (not break_AB) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_BA (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (< i_AB Bn) break_BA (<= i_AB (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) break_BA (<= (+ i_BA 1) i_AB) (< i_AB An)) (or (not break_AB) (not (= (select B i_BA) (select A i_BA))) break_BA (<= (+ i_BA 1) i_AB)) (or (not (= (select B i_BA) (select A i_BA))) break_BA (< i_AB An) (<= i_AB (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (< i_AB Bn) break_BA (<= (+ i_BA 1) i_AB))), 3954#(and (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) (< (+ 3 i_AB) Bn) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB (<= (+ i_AB 1) i_BA) (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 3940#(and (or (< (+ 2 i_AB) Bn) (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1))) (or (= (+ i_AB 1) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1)))), 3951#(and (or (not break_AB) (= (select B i_BA) (select A i_BA))) (or (< i_AB Bn) (= (select B i_BA) (select A i_BA))) (or (<= i_AB (+ 3 i_BA)) (< i_AB Bn) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))))) (or (not break_AB) (<= An (+ 3 i_BA)) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA))) (or (<= i_AB (+ 3 i_BA)) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (< i_AB An)) (or (<= (+ 3 i_BA) i_AB) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (< i_AB An)) (or (<= (+ 3 i_BA) i_AB) (< i_AB Bn) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))))) (or (= (select B i_BA) (select A i_BA)) (< i_AB An)) (or (not break_AB) (<= (+ 3 i_BA) i_AB) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))))), 3941#(and (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_BA (+ i_AB 1)) (< (+ i_AB 1) An) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_BA (+ i_AB 1)) (< (+ i_AB 1) Bn) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 3955#(and (or (<= i_AB i_BA) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB)) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB)) (or (< (+ 3 i_AB) Bn) (<= i_AB i_BA) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 3948#(and (or (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (< (+ 2 i_AB) Bn) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (< (+ 2 i_AB) Bn) (<= i_BA (+ i_AB 1)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= i_BA (+ i_AB 1)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 3950#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_AB)) (<= (+ 2 i_AB) i_BA) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 3945#(and (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ i_AB 1) An) break_AB (<= (+ i_BA 1) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ i_AB 1) An) break_AB (<= i_AB (+ i_BA 1)) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ i_AB 1) Bn) break_AB (<= i_AB (+ i_BA 1)) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ i_AB 1) Bn) break_AB (<= (+ i_BA 1) i_AB) (not (< i_AB An)))), 3936#(and (or (= i_BA i_AB) (< i_AB An)) (or (not break_AB) (= i_BA i_AB)) (or (= i_BA i_AB) (< i_AB Bn))), 3953#(and (or (not (< (+ i_AB 1) Bn)) (not (< (+ i_AB 1) An)) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (or (not (< (+ i_AB 1) Bn)) (not (< (+ i_AB 1) An)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (or (not (< (+ i_AB 1) Bn)) (not (< (+ i_AB 1) An)) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (< (+ 2 i_AB) An) (<= i_AB (+ i_BA 1))) (or (not (< (+ i_AB 1) Bn)) (< (+ 2 i_AB) Bn) (not (< (+ i_AB 1) An)) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= i_AB (+ i_BA 1))) (or (not (< (+ i_AB 1) Bn)) (< (+ 2 i_AB) Bn) (not (< (+ i_AB 1) An)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB)))) (or (not (< (+ i_AB 1) Bn)) (not (< (+ i_AB 1) An)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (< (+ 2 i_AB) An)) (or (not (< (+ i_AB 1) Bn)) (< (+ 2 i_AB) Bn) (not (< (+ i_AB 1) An)) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= (+ i_BA 1) i_AB)) (or (not (< (+ i_AB 1) Bn)) (not (< (+ i_AB 1) An)) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= (+ i_BA 1) i_AB) (< (+ 2 i_AB) An))), 3944#(and (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (< (+ i_AB 1) An) break_AB break_BA (<= i_BA i_AB) (not (< i_AB An))) (or (not (= (select B i_BA) (select A i_BA))) (<= i_AB i_BA) (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) break_AB break_BA) (or (not (= (select B i_BA) (select A i_BA))) (<= i_AB i_BA) (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) An) break_AB break_BA) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (< (+ i_AB 1) Bn) break_AB break_BA (<= i_BA i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 3942#(and (or (< (+ 2 i_AB) Bn) (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= i_BA (+ 2 i_AB)) (<= An (+ i_AB 1))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= i_BA (+ 2 i_AB)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 3937#(and (or break_BA (< i_AB An) (<= i_BA i_AB)) (or (not break_AB) (<= Bn i_BA) (<= An i_BA) break_BA) (or (<= i_AB i_BA) (< i_AB Bn) break_BA) (or (not break_AB) break_BA (<= i_BA i_AB)) (or (< i_AB Bn) break_BA (<= i_BA i_AB)) (or (<= i_AB i_BA) break_BA (< i_AB An))), 3947#(and (or (<= (+ 3 i_AB) i_BA) (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 3 i_AB) i_BA) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB)))), 3943#(and (or (not break_AB) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= (+ 2 i_BA) i_AB)) (or (<= i_AB (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< i_AB An)) (or (<= i_AB (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< i_AB Bn)) (or (not break_AB) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= An (+ 2 i_BA))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< i_AB Bn) (<= (+ 2 i_BA) i_AB)) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< i_AB An) (<= (+ 2 i_BA) i_AB))), 3949#(and (or (< (+ 2 i_AB) Bn) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= i_BA i_AB) (<= An (+ i_AB 1))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= i_BA i_AB) (<= An (+ i_AB 1))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))))] [2022-03-15 20:42:45,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 20:42:45,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:45,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 20:42:45,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1874, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 20:42:45,983 INFO L87 Difference]: Start difference. First operand 147 states and 413 transitions. Second operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:57,260 INFO L93 Difference]: Finished difference Result 231 states and 570 transitions. [2022-03-15 20:42:57,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 20:42:57,260 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:42:57,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:57,261 INFO L225 Difference]: With dead ends: 231 [2022-03-15 20:42:57,261 INFO L226 Difference]: Without dead ends: 217 [2022-03-15 20:42:57,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=759, Invalid=4791, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 20:42:57,263 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 213 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:57,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 1 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:42:57,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-03-15 20:42:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 174. [2022-03-15 20:42:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 2.7283236994219653) internal successors, (472), 173 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 472 transitions. [2022-03-15 20:42:57,267 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 472 transitions. Word has length 15 [2022-03-15 20:42:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:57,268 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 472 transitions. [2022-03-15 20:42:57,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:57,268 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 472 transitions. [2022-03-15 20:42:57,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:42:57,268 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:57,268 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:57,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:57,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 20:42:57,493 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:57,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:57,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1558312420, now seen corresponding path program 11 times [2022-03-15 20:42:57,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:57,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062229406] [2022-03-15 20:42:57,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:57,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:57,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:57,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062229406] [2022-03-15 20:42:57,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062229406] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:57,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830573659] [2022-03-15 20:42:57,688 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:42:57,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:57,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:57,690 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:57,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 20:42:57,713 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 20:42:57,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:57,714 WARN L261 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 20:42:57,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:58,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2022-03-15 20:42:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:58,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:59,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:59,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:59,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:59,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:59,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:59,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:59,520 INFO L353 Elim1Store]: treesize reduction 124, result has 23.9 percent of original size [2022-03-15 20:42:59,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 305 treesize of output 295 [2022-03-15 20:42:59,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:59,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:59,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:59,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:42:59,535 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:42:59,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 247 treesize of output 231 [2022-03-15 20:42:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:59,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830573659] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:59,735 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:59,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-03-15 20:42:59,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1756150536] [2022-03-15 20:42:59,735 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:59,736 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:59,740 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 73 transitions. [2022-03-15 20:42:59,740 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:08,474 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [4702#(and (or (= i_BA i_AB) (< i_AB An)) (or (not break_AB) (= i_BA i_AB)) (or (= i_BA i_AB) (< i_AB Bn))), 4706#(and (or (< (+ 2 i_AB) Bn) (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1))) (or (= (+ i_AB 1) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1)))), 4708#(and (or (= i_BA (+ 3 i_AB)) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= i_BA (+ 3 i_AB)) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 4717#(and (or (< i_AB Bn) (<= (+ 2 i_BA) i_AB)) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) (< i_AB An)) (or (< i_AB An) (<= (+ 2 i_BA) i_AB)) (or (<= (+ 3 i_BA) An) (not break_AB) (<= (+ 2 i_BA) i_AB)) (or (<= (+ 3 i_BA) An) (<= i_AB (+ 2 i_BA))) (or (< i_AB Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (or (not break_AB) (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (or (not break_AB) (<= (+ 3 i_BA) Bn) (<= (+ 2 i_BA) i_AB)) (or (<= i_AB (+ 2 i_BA)) (<= (+ 3 i_BA) Bn))), 4714#(and (or (<= (+ 2 i_BA) Bn) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (<= i_BA (+ i_AB 1)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (<= (+ 2 i_BA) An) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= i_BA (+ i_AB 1)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 4711#(and (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (= i_BA (+ 3 i_AB)) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (= (+ i_AB 4) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (= (+ i_AB 4) i_BA) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (+ i_AB 4) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (+ i_AB 4) i_BA) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An))), 4707#(and (or (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< i_BA Bn) (<= An (+ i_AB 1))) (or (= (+ i_AB 1) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (< i_BA Bn) (<= An (+ i_AB 1))) (or (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1)) (< i_BA An)) (or (< (+ 2 i_AB) Bn) (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (< i_BA An))), 4725#(and (or (<= (+ i_BA 4) Bn) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ i_BA 4) An) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB)) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB)) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 4723#(and (or (not (< i_AB Bn)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) (< (+ i_AB 1) An) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (<= (+ 2 i_BA) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (<= (+ 2 i_BA) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ i_BA 4) An) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select B i_BA) (select A i_BA)) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (= (select B i_BA) (select A i_BA)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ i_BA 4) Bn) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 4704#(and (or (= i_BA i_AB) (< i_AB Bn) (not break_BA)) (or (not break_AB) (= i_BA i_AB) (not break_BA)) (or (= i_BA i_AB) (not break_BA) (< i_AB An)) (or (= i_BA i_AB) (< i_AB Bn) (< i_BA Bn)) (or (= i_BA i_AB) (< i_AB An) (< i_BA An)) (or (not break_AB) (= i_BA i_AB) (< i_BA An)) (or (not break_AB) (= i_BA i_AB) (< i_BA Bn))), 4724#(and (or (<= (+ i_BA 4) An) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= (+ i_BA 1) i_AB) (<= An (+ i_AB 1))) (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ i_BA 4) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= (+ i_BA 1) i_AB) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 4712#(and (or (not break_AB) break_BA (= (select B i_BA) (select A i_BA))) (or (< i_AB Bn) break_BA (<= (+ i_BA 1) i_AB)) (or (not break_AB) (<= (+ 2 i_BA) Bn) break_BA (<= (+ i_BA 1) i_AB)) (or break_BA (= (select B i_BA) (select A i_BA)) (< i_AB An)) (or (<= (+ 2 i_BA) An) break_BA (<= i_AB (+ i_BA 1))) (or (not break_AB) (<= (+ 2 i_BA) An) break_BA (<= (+ i_BA 1) i_AB)) (or (< i_AB Bn) break_BA (= (select B i_BA) (select A i_BA))) (or (<= (+ 2 i_BA) Bn) break_BA (<= i_AB (+ i_BA 1))) (or break_BA (<= (+ i_BA 1) i_AB) (< i_AB An))), 4713#(and (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) An) break_AB break_BA (= (select B i_BA) (select A i_BA))) (or (not (< i_AB Bn)) (<= (+ 2 i_BA) An) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) break_AB break_BA (= (select B i_BA) (select A i_BA))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB break_BA (<= i_BA i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 2 i_BA) Bn) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB break_BA (<= i_BA i_AB) (not (< i_AB An)))), 4705#(and (or (not (< i_AB Bn)) break_AB (= (select A i_AB) (select B i_AB)) (< i_BA Bn) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) An) break_AB (< i_BA An) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) Bn) break_AB (< i_BA Bn) (not (< i_AB An))) (or (not (< i_AB Bn)) (= i_BA i_AB) break_AB (not break_BA) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select A i_AB) (select B i_AB)) (< i_BA An) (not (< i_AB An)))), 4722#(and (or (not break_AB) (= (select B i_BA) (select A i_BA))) (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) (< i_AB An)) (or (<= (+ i_BA 4) Bn) (<= i_AB (+ 3 i_BA))) (or (not break_AB) (<= (+ i_BA 4) Bn) (<= (+ 3 i_BA) i_AB)) (or (< i_AB Bn) (= (select B i_BA) (select A i_BA))) (or (< i_AB Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (or (<= (+ 3 i_BA) i_AB) (< i_AB An)) (or (not break_AB) (<= (+ i_BA 4) An) (<= (+ 3 i_BA) i_AB)) (or (<= i_AB (+ 3 i_BA)) (<= (+ i_BA 4) An)) (or (not break_AB) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (or (= (select B i_BA) (select A i_BA)) (< i_AB An)) (or (<= (+ 3 i_BA) i_AB) (< i_AB Bn))), 4710#(and (or (< (+ i_AB 4) Bn) (= (+ i_AB 4) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (= i_BA (+ 3 i_AB)) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (+ i_AB 4) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 4716#(and (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ 2 i_BA) An) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ 2 i_BA) Bn) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB break_BA (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) break_AB break_BA (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB)))), 4718#(and (or (not (< i_AB Bn)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) (< (+ i_AB 1) An) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select A i_AB) (select B i_AB)) (<= (+ 3 i_BA) Bn) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (<= (+ i_BA 1) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (<= (+ i_BA 1) i_AB) (not (< i_AB An))) (or (<= (+ 3 i_BA) An) (not (< i_AB Bn)) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 4709#(and (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or (= i_BA (+ 3 i_AB)) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= i_BA (+ 3 i_AB)) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= i_BA (+ 3 i_AB)) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or (= i_BA (+ 3 i_AB)) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 4719#(and (or (<= (+ 3 i_BA) An) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (<= (+ 3 i_BA) Bn)) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= i_BA i_AB) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= i_BA i_AB) (<= An (+ i_AB 1)))), 4715#(and (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (<= (+ 2 i_BA) Bn) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 2 i_BA) An) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 4721#(and (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= i_BA (+ 2 i_AB)) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ 3 i_BA) An) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 3 i_BA) Bn)) (or (< (+ i_AB 4) Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= i_BA (+ 2 i_AB)) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 4726#(and (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ i_BA 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ i_BA 4) An) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (<= i_BA (+ i_AB 1)) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 4703#(and (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (= i_BA i_AB) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 4720#(and (or (<= i_BA (+ i_AB 1)) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 3 i_BA) Bn)) (or (<= (+ 3 i_BA) An) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))))] [2022-03-15 20:43:08,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 20:43:08,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:08,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 20:43:08,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=2085, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 20:43:08,475 INFO L87 Difference]: Start difference. First operand 174 states and 472 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:58,968 INFO L93 Difference]: Finished difference Result 430 states and 1035 transitions. [2022-03-15 20:43:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-03-15 20:43:58,969 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:43:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:58,970 INFO L225 Difference]: With dead ends: 430 [2022-03-15 20:43:58,970 INFO L226 Difference]: Without dead ends: 418 [2022-03-15 20:43:58,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10701 ImplicationChecksByTransitivity, 52.0s TimeCoverageRelationStatistics Valid=4436, Invalid=28144, Unknown=0, NotChecked=0, Total=32580 [2022-03-15 20:43:58,975 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 482 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:58,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 1 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 20:43:58,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-03-15 20:43:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 212. [2022-03-15 20:43:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.862559241706161) internal successors, (604), 211 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 604 transitions. [2022-03-15 20:43:58,981 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 604 transitions. Word has length 15 [2022-03-15 20:43:58,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:58,981 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 604 transitions. [2022-03-15 20:43:58,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:58,981 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 604 transitions. [2022-03-15 20:43:58,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:43:58,982 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:58,982 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:59,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:59,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 20:43:59,198 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:59,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:59,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1156109897, now seen corresponding path program 12 times [2022-03-15 20:43:59,199 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:59,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73883788] [2022-03-15 20:43:59,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:59,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:59,291 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:59,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73883788] [2022-03-15 20:43:59,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73883788] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:59,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179890340] [2022-03-15 20:43:59,291 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:43:59,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:59,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:59,292 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:59,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 20:43:59,314 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:43:59,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:59,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:43:59,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:59,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:59,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:43:59,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:43:59,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:43:59,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:43:59,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:43:59,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:43:59,930 INFO L353 Elim1Store]: treesize reduction 66, result has 22.4 percent of original size [2022-03-15 20:43:59,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 131 treesize of output 129 [2022-03-15 20:43:59,939 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 20:43:59,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 75 [2022-03-15 20:44:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:00,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179890340] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:00,017 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:00,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 21 [2022-03-15 20:44:00,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [465597266] [2022-03-15 20:44:00,017 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:00,018 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:00,022 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 69 transitions. [2022-03-15 20:44:00,022 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:02,900 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [5953#(and (or (<= (+ An 1) i_AB) break_AB (<= (+ Bn 1) i_AB) (< i_BA Bn)) (or (<= (+ An 1) i_AB) break_AB (<= (+ Bn 1) i_AB) (not break_BA)) (or (<= (+ An 1) i_AB) break_AB (<= (+ Bn 1) i_AB) (< i_BA An))), 5959#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) An)) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_BA (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) Bn))), 5955#(and (or (<= Bn i_AB) (<= An i_AB) break_AB (not break_BA)) (or (<= Bn i_AB) (<= An i_AB) break_AB (< i_BA An)) (or (<= Bn i_AB) (<= An i_AB) break_AB (< i_BA Bn))), 5950#(and (or (<= Bn i_BA) (<= An i_BA) break_BA (= (select B i_BA) (select A i_BA))) (or (<= Bn i_BA) (<= An i_BA) break_BA (< (+ i_BA 1) Bn)) (or (< (+ i_BA 1) An) (<= Bn i_BA) (<= An i_BA) break_BA)), 5952#(and (or (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (<= (+ 2 Bn) i_AB) (< (+ i_BA 1) Bn)) (or (<= (+ 2 An) i_AB) (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (<= (+ 2 Bn) i_AB)) (or (<= (+ 2 An) i_AB) (not (< i_BA Bn)) (< (+ i_BA 1) An) (not (< i_BA An)) break_AB break_BA)), 5957#(and (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< i_BA Bn) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (< i_BA An))), 5962#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= Bn i_AB) break_AB break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) Bn)) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= Bn i_AB) (<= An i_AB) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= An i_AB) break_AB break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) An))), 5963#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_AB break_BA (<= An (+ i_BA 1)) (not (= (select A i_AB) (select B i_AB))) (< (+ 2 i_BA) An) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= An (+ i_BA 1)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_AB break_BA (<= An (+ i_BA 1)) (not (= (select A i_AB) (select B i_AB))) (< (+ 2 i_BA) Bn) (<= Bn (+ i_AB 1)))), 5949#(and (not break_BA) (< i_BA Bn) (< i_BA An)), 5956#(and (or (not (< i_BA Bn)) (<= Bn i_AB) (<= An i_AB) (not (< i_BA An)) break_AB break_BA (= (select B i_BA) (select A i_BA))) (or (not (< i_BA Bn)) (<= Bn i_AB) (not (< i_BA An)) break_AB break_BA (< (+ i_BA 1) Bn)) (or (not (< i_BA Bn)) (< (+ i_BA 1) An) (<= An i_AB) (not (< i_BA An)) break_AB break_BA)), 5958#(and (or (<= Bn i_BA) (<= An i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ i_BA 1) Bn)) (or (not (< i_BA Bn)) (< (+ i_BA 1) An) (not (< i_BA An)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ i_AB 1))) (or (<= Bn i_BA) (<= An i_BA) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 5954#(and (or (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (<= (+ Bn 1) i_AB) (< (+ i_BA 1) Bn)) (or (not (< i_BA Bn)) (<= (+ An 1) i_AB) (not (< i_BA An)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (<= (+ Bn 1) i_AB)) (or (not (< i_BA Bn)) (< (+ i_BA 1) An) (<= (+ An 1) i_AB) (not (< i_BA An)) break_AB break_BA)), 5961#(and (or (not (= (select B i_BA) (select A i_BA))) (not (< (+ i_BA 1) An)) (not (< (+ i_BA 1) Bn)) (<= (+ An 1) i_AB) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= (+ Bn 1) i_AB)) (or (not (= (select B i_BA) (select A i_BA))) (not (< (+ i_BA 1) An)) (not (< (+ i_BA 1) Bn)) (<= (+ An 1) i_AB) break_AB break_BA (< (+ 2 i_BA) An)) (or (not (= (select B i_BA) (select A i_BA))) (not (< (+ i_BA 1) An)) (not (< (+ i_BA 1) Bn)) break_AB break_BA (<= (+ Bn 1) i_AB) (< (+ 2 i_BA) Bn))), 5960#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_AB break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) Bn) (<= (+ 2 Bn) i_AB)) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 2 An) i_AB) (<= Bn (+ i_BA 1)) break_AB break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) An)) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 2 An) i_AB) (<= Bn (+ i_BA 1)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= An (+ i_BA 1)) (<= (+ 2 Bn) i_AB))), 5951#(and (or (<= (+ 2 An) i_AB) break_AB (<= (+ 2 Bn) i_AB) (< i_BA Bn)) (or (<= (+ 2 An) i_AB) break_AB (not break_BA) (<= (+ 2 Bn) i_AB)) (or (<= (+ 2 An) i_AB) break_AB (<= (+ 2 Bn) i_AB) (< i_BA An)))] [2022-03-15 20:44:02,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:44:02,900 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:02,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:44:02,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 20:44:02,901 INFO L87 Difference]: Start difference. First operand 212 states and 604 transitions. Second operand has 25 states, 25 states have (on average 2.24) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:04,537 INFO L93 Difference]: Finished difference Result 271 states and 720 transitions. [2022-03-15 20:44:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 20:44:04,537 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:44:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:04,538 INFO L225 Difference]: With dead ends: 271 [2022-03-15 20:44:04,538 INFO L226 Difference]: Without dead ends: 264 [2022-03-15 20:44:04,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=706, Invalid=2954, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 20:44:04,541 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 77 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:04,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 1 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:44:04,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-03-15 20:44:04,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 219. [2022-03-15 20:44:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.8073394495412844) internal successors, (612), 218 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 612 transitions. [2022-03-15 20:44:04,546 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 612 transitions. Word has length 15 [2022-03-15 20:44:04,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:04,546 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 612 transitions. [2022-03-15 20:44:04,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:04,547 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 612 transitions. [2022-03-15 20:44:04,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:44:04,547 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:04,547 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:04,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 20:44:04,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 20:44:04,763 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:04,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:04,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1063433898, now seen corresponding path program 13 times [2022-03-15 20:44:04,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:04,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888384131] [2022-03-15 20:44:04,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:04,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:04,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:04,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888384131] [2022-03-15 20:44:04,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888384131] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:04,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528120293] [2022-03-15 20:44:04,989 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:44:04,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:04,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:04,990 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:44:04,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 20:44:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:05,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:44:05,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:05,615 INFO L353 Elim1Store]: treesize reduction 58, result has 30.1 percent of original size [2022-03-15 20:44:05,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 112 treesize of output 118 [2022-03-15 20:44:05,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:44:05,639 INFO L353 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-03-15 20:44:05,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 94 [2022-03-15 20:44:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:05,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:06,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,852 INFO L353 Elim1Store]: treesize reduction 179, result has 26.3 percent of original size [2022-03-15 20:44:06,852 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 253 treesize of output 272 [2022-03-15 20:44:06,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,870 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,870 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:06,911 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:44:06,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 245 treesize of output 333 [2022-03-15 20:44:07,162 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:07,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528120293] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:07,162 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:07,162 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2022-03-15 20:44:07,162 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [697133355] [2022-03-15 20:44:07,162 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:07,163 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:07,168 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 86 transitions. [2022-03-15 20:44:07,168 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:13,725 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [6850#(and (or (not (= (select B i_BA) (select A i_BA))) (<= i_AB i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (<= i_BA (+ i_AB 1)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 6856#(and (or (not (= (select B 2) (select A 2))) (<= i_AB 1) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select B 2) (select A 2))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_AB 0)) (or (not (= (select B 2) (select A 2))) (<= 0 (+ i_AB 1)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (= i_BA 0) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= 0 i_AB) (not (= (select B 3) (select A 3))) (not (= (select B 2) (select A 2))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 6841#(and (or (not (= (select B i_BA) (select A i_BA))) break_AB (<= i_AB (+ i_BA 1))) (or (<= i_AB i_BA) break_AB break_BA (= (select B i_BA) (select A i_BA))) (or (<= i_BA (+ i_AB 1)) break_AB break_BA) (or (not (= (select B i_BA) (select A i_BA))) (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB)))) (or break_AB break_BA (= (select A i_AB) (select B i_AB)) (<= i_BA i_AB)) (or (not (= (select B i_BA) (select A i_BA))) break_AB (<= i_BA i_AB))), 6840#(and (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (< i_BA (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< i_BA (+ 5 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= (+ i_AB 4) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 3 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 6849#(and (or (not (= (select B 3) (select A 3))) (not (= (select B 2) (select A 2))) break_AB (<= 2 i_AB) (not (= (select A i_AB) (select B i_AB)))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB)))) (or (not (= (select B 2) (select A 2))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_AB 2) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (= i_BA 0) (not (= (select A i_AB) (select B i_AB)))) (or (not (= (select B 2) (select A 2))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_AB 3)) (or (not (= (select B 2) (select A 2))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= 1 i_AB))), 6842#(and (or (not (= (select B i_BA) (select A i_BA))) (<= i_BA (+ i_AB 1)) break_AB (not (= (select A i_AB) (select B i_AB)))) (or (<= i_BA (+ i_AB 1)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (or (not (= (select B i_BA) (select A i_BA))) (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB)))) (or (not (= (select B i_BA) (select A i_BA))) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (= (select B i_BA) (select A i_BA)) (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB)))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= i_BA (+ 2 i_AB)))), 6854#(and (or (not (= (select B i_BA) (select A i_BA))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB)))), 6838#(and (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (< i_BA (+ 2 i_AB))) (or (<= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB)))) (or (< i_BA (+ 3 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))))), 6852#(and (or (not (= (select B 3) (select A 3))) (not (= (select B 2) (select A 2))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= 1 i_AB)) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B 2) (select A 2))) (<= i_AB 1) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B 2) (select A 2))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_AB 2) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (= i_BA 0) (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= 0 i_AB) (not (= (select B 2) (select A 2))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 6848#(and (or (<= i_AB (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB)))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_BA i_AB)) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_AB (+ i_BA 1))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= (+ i_BA 1) i_AB))), 6845#(and (or (<= i_AB (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB)))) (or (<= i_AB (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= (+ 2 i_BA) i_AB)) (or (<= i_AB (+ 3 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (<= (+ i_BA 1) i_AB))), 6837#(and (or (<= i_AB i_BA) break_AB) (or (< i_BA (+ i_AB 1)) break_AB (= (select A i_AB) (select B i_AB))) (or break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB)))) (or break_AB (< i_BA (+ 2 i_AB)))), 6839#(and (or (<= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< i_BA (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 3 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< i_BA (+ 3 i_AB)) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 6846#(and (or (not (= (select B 3) (select A 3))) (not (= (select B 2) (select A 2))) break_AB (<= 3 i_AB)) (or (= (select B 3) (select A 3)) (not (= (select B 2) (select A 2))) break_AB (<= i_AB 3)) (or (not (= (select B 2) (select A 2))) (<= i_AB 4) break_AB) (or break_AB (= i_BA 0)) (or break_AB (= (select B i_BA) (select A i_BA))) (or (not (= (select B 2) (select A 2))) break_AB (<= 2 i_AB)) (or (not (= (select B 2) (select A 2))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_AB 3))), 6847#(and (or (not (= (select B i_BA) (select A i_BA))) (<= i_BA (+ i_AB 1)) break_AB break_BA (not (= (select A i_AB) (select B i_AB)))) (or (not (= (select B i_BA) (select A i_BA))) (<= i_AB i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= i_AB (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= i_BA i_AB))), 6851#(and (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_AB (+ i_BA 1))) (or (<= i_BA (+ i_AB 1)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB))), 6844#(and (or (not (= (select B i_BA) (select A i_BA))) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= i_AB (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (<= i_BA i_AB)) (or (not (= (select B i_BA) (select A i_BA))) (<= i_AB (+ 2 i_BA)) break_AB break_BA) (or (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= i_AB (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= (+ i_BA 1) i_AB))), 6853#(and (or break_AB break_BA (<= i_BA (+ i_AB 4)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 3 i_AB) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or (<= (+ 3 i_AB) i_BA) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 6855#(and (or (<= i_BA (+ i_AB 1)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 6843#(and (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 2 i_AB) i_BA) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or (not (= (select B i_BA) (select A i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))))] [2022-03-15 20:44:13,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 20:44:13,725 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:13,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 20:44:13,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1907, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 20:44:13,726 INFO L87 Difference]: Start difference. First operand 219 states and 612 transitions. Second operand has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:14,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:14,819 INFO L93 Difference]: Finished difference Result 413 states and 980 transitions. [2022-03-15 20:44:14,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:44:14,819 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:44:14,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:14,821 INFO L225 Difference]: With dead ends: 413 [2022-03-15 20:44:14,821 INFO L226 Difference]: Without dead ends: 402 [2022-03-15 20:44:14,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 20 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=209, Invalid=2341, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 20:44:14,821 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 76 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:14,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 1 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:44:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-03-15 20:44:14,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 244. [2022-03-15 20:44:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.8065843621399176) internal successors, (682), 243 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 682 transitions. [2022-03-15 20:44:14,827 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 682 transitions. Word has length 16 [2022-03-15 20:44:14,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:14,827 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 682 transitions. [2022-03-15 20:44:14,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 682 transitions. [2022-03-15 20:44:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:44:14,828 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:14,828 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:14,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 20:44:15,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:15,039 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:15,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:15,040 INFO L85 PathProgramCache]: Analyzing trace with hash 427137453, now seen corresponding path program 14 times [2022-03-15 20:44:15,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:15,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864470396] [2022-03-15 20:44:15,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:15,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:15,136 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:15,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864470396] [2022-03-15 20:44:15,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864470396] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:15,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973162885] [2022-03-15 20:44:15,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:44:15,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:15,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:15,137 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:44:15,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 20:44:15,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:44:15,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:15,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:44:15,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:15,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:16,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:16,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:16,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:16,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:16,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:16,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:16,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:16,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:16,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:16,298 INFO L353 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2022-03-15 20:44:16,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 110 treesize of output 104 [2022-03-15 20:44:16,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-03-15 20:44:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:16,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973162885] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:16,349 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:16,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2022-03-15 20:44:16,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [724677991] [2022-03-15 20:44:16,349 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:16,350 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:16,356 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 84 transitions. [2022-03-15 20:44:16,357 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:21,036 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [7894#(and (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 2 i_BA) An) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 2 i_BA) An) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 7886#(and (not break_AB) (< i_AB Bn) (< i_AB An)), 7899#(and (or (<= Bn i_BA) (<= An i_BA) break_AB break_BA (= (select B i_BA) (select A i_BA))) (or (<= (+ 3 i_BA) i_AB) (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA) (or (not (< i_BA Bn)) (not (< i_BA An)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA)), 7903#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_AB break_BA (<= An (+ i_BA 1)) (<= (+ i_BA 4) i_AB)) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (<= An (+ i_BA 1)))), 7906#(and (or (not (< i_AB Bn)) (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (< i_AB An)))), 7900#(and (or (<= Bn i_BA) (<= An i_BA) break_AB break_BA (= (select B i_BA) (select A i_BA))) (or (<= Bn i_BA) (<= An i_BA) break_AB break_BA (<= (+ 2 i_BA) i_AB)) (or (<= Bn i_BA) (<= An i_BA) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA)), 7888#(and (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 7905#(and (or (= i_AB (+ 2 i_BA)) (not (= (select B i_BA) (select A i_BA))) (not (< (+ i_BA 1) An)) (not (< (+ i_BA 1) Bn)) break_AB break_BA) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= An (+ i_BA 1)))), 7897#(and (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (<= (+ 2 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (<= (+ 2 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 7904#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= (+ 3 i_BA) i_AB) break_AB break_BA (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (<= An (+ i_BA 1)))), 7889#(and (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 7890#(and (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 7893#(and (or (< (+ 2 i_AB) Bn) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ 2 i_BA) An) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ 2 i_BA) An) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1)))), 7887#(and (or (<= Bn i_AB) (<= An i_AB) break_AB (= (select A i_AB) (select B i_AB))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) An) break_AB) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) break_AB)), 7896#(and (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 7895#(and (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ 2 i_BA) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (<= (+ 2 i_BA) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 2 i_BA) An) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ 2 i_BA) An) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 7892#(and (or (not (< i_AB Bn)) (<= (+ 2 i_BA) Bn) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) (<= (+ 2 i_BA) Bn) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 2 i_BA) An) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) An) break_AB (not break_BA)) (or (<= Bn i_AB) (<= An i_AB) break_AB (not break_BA) (= (select A i_AB) (select B i_AB))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) break_AB (not break_BA)) (or (not (< i_AB Bn)) (<= (+ 2 i_BA) An) (< (+ i_AB 1) An) break_AB (not (< i_AB An)))), 7891#(and (or (<= (+ 2 i_BA) An) (< i_AB An)) (or (not break_AB) (<= (+ 2 i_BA) Bn)) (or (not break_BA) (< i_AB An)) (or (< i_AB Bn) (<= (+ 2 i_BA) Bn)) (or (< i_AB Bn) (not break_BA)) (or (not break_AB) (not break_BA)) (or (not break_AB) (<= (+ 2 i_BA) An))), 7898#(and (or (<= Bn i_BA) (<= An i_BA) break_BA (= (select B i_BA) (select A i_BA))) (or (<= (+ i_BA 4) Bn) (<= Bn i_BA) (<= An i_BA) break_BA) (or (<= (+ i_BA 4) An) (<= Bn i_BA) (<= An i_BA) break_BA) (or (<= Bn i_BA) (<= An i_BA) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_BA)), 7901#(and (or (<= Bn i_BA) (<= An i_BA) break_AB break_BA (= (select B i_BA) (select A i_BA))) (or (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (= (+ i_BA 1) i_AB))), 7902#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_BA (<= An (+ i_BA 1)) (<= (+ 5 i_BA) Bn)) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_BA (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= (+ 5 i_BA) An) break_BA (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_BA (<= An (+ i_BA 1))))] [2022-03-15 20:44:21,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 20:44:21,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:21,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 20:44:21,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2028, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 20:44:21,037 INFO L87 Difference]: Start difference. First operand 244 states and 682 transitions. Second operand has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:30,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:30,736 INFO L93 Difference]: Finished difference Result 591 states and 1385 transitions. [2022-03-15 20:44:30,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-03-15 20:44:30,736 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:44:30,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:30,738 INFO L225 Difference]: With dead ends: 591 [2022-03-15 20:44:30,738 INFO L226 Difference]: Without dead ends: 572 [2022-03-15 20:44:30,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3176 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=2129, Invalid=9213, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 20:44:30,739 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 195 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:30,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 1 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:44:30,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-03-15 20:44:30,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 250. [2022-03-15 20:44:30,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 2.6506024096385543) internal successors, (660), 249 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 660 transitions. [2022-03-15 20:44:30,745 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 660 transitions. Word has length 16 [2022-03-15 20:44:30,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:30,746 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 660 transitions. [2022-03-15 20:44:30,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:30,746 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 660 transitions. [2022-03-15 20:44:30,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:44:30,746 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:30,746 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:30,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 20:44:30,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 20:44:30,957 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:30,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:30,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1392898396, now seen corresponding path program 15 times [2022-03-15 20:44:30,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:30,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585822405] [2022-03-15 20:44:30,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:30,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:31,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:31,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585822405] [2022-03-15 20:44:31,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585822405] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:31,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977285368] [2022-03-15 20:44:31,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:44:31,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:31,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:31,160 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:44:31,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 20:44:31,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:44:31,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:31,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 20:44:31,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:31,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:32,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:32,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:32,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:32,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:32,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:32,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:32,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:32,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:32,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:32,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:32,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:32,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:44:32,491 INFO L353 Elim1Store]: treesize reduction 158, result has 10.7 percent of original size [2022-03-15 20:44:32,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 122 treesize of output 112 [2022-03-15 20:44:32,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-03-15 20:44:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:32,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977285368] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:32,570 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:32,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 31 [2022-03-15 20:44:32,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1962979093] [2022-03-15 20:44:32,570 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:32,572 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:32,578 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 99 transitions. [2022-03-15 20:44:32,578 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:42,591 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [9269#(and (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (<= (+ 2 i_BA) i_AB) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (< (+ 2 i_AB) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1)) (<= (+ 2 i_BA) i_AB) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (< (+ 2 i_AB) Bn) (<= i_AB (+ 2 i_BA)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= i_AB (+ 2 i_BA)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1)) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))))), 9246#(and (or (<= i_AB (+ 3 i_BA)) (< i_AB Bn) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))))) (or (not break_AB) (<= An (+ 3 i_BA)) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA))) (or (<= i_AB (+ 3 i_BA)) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (< i_AB An)) (or (<= (+ 3 i_BA) i_AB) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (< i_AB An)) (or (<= (+ 3 i_BA) i_AB) (< i_AB Bn) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))))) (or (not break_AB) (<= (+ 3 i_BA) i_AB) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))))), 9250#(and (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ i_AB 1) An) break_AB break_BA (<= (+ i_BA 1) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ i_AB 1) Bn) break_AB break_BA (<= i_AB (+ i_BA 1)) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ i_AB 1) Bn) break_AB break_BA (<= (+ i_BA 1) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ i_AB 1) An) break_AB break_BA (<= i_AB (+ i_BA 1)) (not (< i_AB An)))), 9245#(and (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (< i_AB An) (<= (+ 2 i_BA) i_AB)) (or (not break_AB) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (<= (+ 2 i_BA) i_AB)) (or (not break_AB) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (<= An (+ 2 i_BA))) (or (<= i_AB (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< i_AB Bn) break_BA) (or (<= i_AB (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (< i_AB An)) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< i_AB Bn) break_BA (<= (+ 2 i_BA) i_AB))), 9249#(and (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (< (+ i_AB 1) An) break_AB break_BA (<= i_BA i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (<= i_AB i_BA) (< (+ i_AB 1) Bn) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (< (+ i_AB 1) Bn) break_AB break_BA (<= i_BA i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (<= i_AB i_BA) (< (+ i_AB 1) An) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 9265#(and (or (<= i_AB i_BA) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB)) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB)) (or (< (+ 3 i_AB) Bn) (<= i_AB i_BA) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 9266#(and (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (<= (+ i_AB 1) i_BA) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (<= i_BA (+ i_AB 1)) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= Bn (+ 3 i_AB)) (<= (+ i_AB 1) i_BA) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 9254#(and (or (not (< (+ i_AB 1) Bn)) (not (< (+ i_AB 1) An)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= i_AB i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (< (+ 2 i_AB) An)) (or (not (< (+ i_AB 1) Bn)) (not (< (+ i_AB 1) An)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (or (not (< (+ i_AB 1) Bn)) (not (< (+ i_AB 1) An)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (< (+ 2 i_AB) An) (<= i_BA i_AB)) (or (not (< (+ i_AB 1) Bn)) (< (+ 2 i_AB) Bn) (not (< (+ i_AB 1) An)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= i_AB i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB)))) (or (not (< (+ i_AB 1) Bn)) (< (+ 2 i_AB) Bn) (not (< (+ i_AB 1) An)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= i_BA i_AB))), 9263#(and (or (not (< i_AB Bn)) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_AB (+ 2 i_BA)) (< (+ i_AB 1) Bn) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= (+ 2 i_BA) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= (+ 2 i_BA) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_AB (+ 2 i_BA)) (< (+ i_AB 1) An) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (< i_AB An)))), 9244#(and (or (not break_AB) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_BA (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (< i_AB Bn) break_BA (<= i_AB (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) break_BA (<= (+ i_BA 1) i_AB) (< i_AB An)) (or (not break_AB) (not (= (select B i_BA) (select A i_BA))) break_BA (<= (+ i_BA 1) i_AB)) (or (not (= (select B i_BA) (select A i_BA))) break_BA (< i_AB An) (<= i_AB (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (< i_AB Bn) break_BA (<= (+ i_BA 1) i_AB))), 9261#(and (or (< (+ i_AB 4) Bn) (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (not (= (select B i_BA) (select A i_BA))) (<= (+ 3 i_AB) i_BA) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 3 i_AB) i_BA) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 9253#(and (or (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (< (+ 2 i_AB) Bn) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (< (+ 2 i_AB) Bn) (<= i_BA (+ i_AB 1)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= i_BA (+ i_AB 1)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 9259#(and (or (< (+ i_AB 4) Bn) (= (+ i_AB 4) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (= i_BA (+ 3 i_AB)) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (+ i_AB 4) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 9262#(and (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= (+ 2 i_AB) i_BA) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= i_BA (+ 2 i_AB)) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= (+ 2 i_AB) i_BA) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= i_BA (+ 2 i_AB)) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 9255#(and (or (= i_BA (+ 3 i_AB)) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= i_BA (+ 3 i_AB)) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 9242#(and (or (= i_BA i_AB) (< i_AB An)) (or (not break_AB) (= i_BA i_AB)) (or (= i_BA i_AB) (< i_AB Bn))), 9248#(and (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_BA (+ i_AB 1)) (< (+ i_AB 1) An) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_BA (+ i_AB 1)) (< (+ i_AB 1) Bn) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 9270#(and (or (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= (+ i_BA 1) i_AB) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (<= i_AB (+ i_BA 1))) (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (<= i_AB (+ i_BA 1))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= (+ i_BA 1) i_AB) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 9247#(and (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (= i_BA i_AB) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 9267#(and (or (not break_AB) (= (select B i_BA) (select A i_BA))) (or (< i_AB Bn) (= (select B i_BA) (select A i_BA))) (or (< i_AB An) (<= (+ i_BA 4) i_AB) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (< i_AB Bn) (<= (+ i_BA 4) i_AB) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (not break_AB) (<= (+ i_BA 4) i_AB) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (<= i_AB (+ i_BA 4)) (< i_AB Bn) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (<= An (+ i_BA 4)) (not break_AB) (<= Bn (+ i_BA 4)) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (= (select B i_BA) (select A i_BA)) (< i_AB An)) (or (<= i_AB (+ i_BA 4)) (< i_AB An) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))))), 9258#(and (or (<= i_BA (+ i_AB 1)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB break_BA (<= (+ i_AB 1) i_BA) (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) (< (+ 3 i_AB) Bn) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 9256#(and (or (<= (+ 3 i_AB) i_BA) (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 3 i_AB) i_BA) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB)))), 9271#(and (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (<= i_AB i_BA) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_AB i_BA) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))))), 9252#(and (or (< (+ 2 i_AB) Bn) (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= i_BA (+ 2 i_AB)) (<= An (+ i_AB 1))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= i_BA (+ 2 i_AB)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 9257#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_AB)) (<= (+ 2 i_AB) i_BA) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 9260#(and (or (< (+ i_AB 4) Bn) break_AB break_BA (<= Bn (+ 3 i_AB)) (<= i_BA (+ i_AB 4)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (<= (+ i_AB 4) i_BA) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ i_AB 4) i_BA) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (<= Bn (+ 3 i_AB)) (<= i_BA (+ i_AB 4)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 9268#(and (or (not (< i_AB Bn)) (<= i_AB (+ 3 i_BA)) (< (+ i_AB 1) An) break_AB (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_AB (+ 3 i_BA)) (< (+ i_AB 1) Bn) break_AB (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select A i_AB) (select B i_AB)) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 3 i_BA) i_AB) (< (+ i_AB 1) An) break_AB (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 3 i_BA) i_AB) (< (+ i_AB 1) Bn) break_AB (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select B i_BA) (select A i_BA)) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (= (select B i_BA) (select A i_BA)) (not (< i_AB An)))), 9251#(and (or (< (+ 2 i_AB) Bn) (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1))) (or (= (+ i_AB 1) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1)))), 9243#(and (or break_BA (< i_AB An) (<= i_BA i_AB)) (or (not break_AB) (<= Bn i_BA) (<= An i_BA) break_BA) (or (<= i_AB i_BA) (< i_AB Bn) break_BA) (or (not break_AB) break_BA (<= i_BA i_AB)) (or (< i_AB Bn) break_BA (<= i_BA i_AB)) (or (<= i_AB i_BA) break_BA (< i_AB An))), 9264#(and (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (<= i_AB (+ i_BA 1))) (or break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= (+ i_BA 1) i_AB) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= (+ i_BA 1) i_AB) (<= An (+ i_AB 1))) (or break_AB (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1)) (<= i_AB (+ i_BA 1))))] [2022-03-15 20:44:42,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 20:44:42,591 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:42,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 20:44:42,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=3495, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 20:44:42,592 INFO L87 Difference]: Start difference. First operand 250 states and 660 transitions. Second operand has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:05,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:05,545 INFO L93 Difference]: Finished difference Result 363 states and 909 transitions. [2022-03-15 20:45:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 20:45:05,545 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:45:05,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:05,546 INFO L225 Difference]: With dead ends: 363 [2022-03-15 20:45:05,546 INFO L226 Difference]: Without dead ends: 345 [2022-03-15 20:45:05,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2185 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=1273, Invalid=9029, Unknown=0, NotChecked=0, Total=10302 [2022-03-15 20:45:05,547 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 331 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:05,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 1 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:45:05,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-03-15 20:45:05,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 305. [2022-03-15 20:45:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 2.5690789473684212) internal successors, (781), 304 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 781 transitions. [2022-03-15 20:45:05,552 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 781 transitions. Word has length 17 [2022-03-15 20:45:05,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:05,553 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 781 transitions. [2022-03-15 20:45:05,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 781 transitions. [2022-03-15 20:45:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:45:05,553 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:05,553 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:05,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 20:45:05,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 20:45:05,767 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:05,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:05,768 INFO L85 PathProgramCache]: Analyzing trace with hash 119290077, now seen corresponding path program 16 times [2022-03-15 20:45:05,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:05,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631078749] [2022-03-15 20:45:05,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:05,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:05,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:05,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631078749] [2022-03-15 20:45:05,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631078749] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:05,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457822425] [2022-03-15 20:45:05,973 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:45:05,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:05,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:05,974 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:45:05,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 20:45:05,996 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:45:05,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:05,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 20:45:05,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:06,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2022-03-15 20:45:06,736 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:06,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:07,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:45:07,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:45:07,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:45:07,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:45:07,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:45:07,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:45:07,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:45:07,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:45:07,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:45:07,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:45:08,011 INFO L353 Elim1Store]: treesize reduction 235, result has 18.7 percent of original size [2022-03-15 20:45:08,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 10 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 26 case distinctions, treesize of input 270 treesize of output 275 [2022-03-15 20:45:08,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:45:08,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:45:08,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:45:08,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:45:08,020 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:45:08,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:45:08,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:45:08,032 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:45:08,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 210 [2022-03-15 20:45:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:08,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457822425] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:08,173 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:08,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 31 [2022-03-15 20:45:08,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [435463678] [2022-03-15 20:45:08,173 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:08,174 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:08,180 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 99 transitions. [2022-03-15 20:45:08,180 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:23,124 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [10479#(and (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (<= (+ 3 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB)) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB)) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 3 i_BA) Bn) (<= Bn (+ i_AB 4)))), 10468#(and (or (= i_BA (+ 3 i_AB)) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= i_BA (+ 3 i_AB)) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 10471#(and (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (= (+ i_AB 4) i_BA) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (+ i_AB 4) i_BA) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 10488#(and (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (<= i_BA (+ i_AB 1)) (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)) (<= (+ 5 i_BA) Bn)) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (<= i_BA (+ i_AB 1)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (<= (+ 5 i_BA) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 10475#(and (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (+ 5 i_AB) i_BA) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (+ 5 i_AB) i_BA) (< i_BA An) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 10463#(and (or (< (+ 2 i_AB) Bn) (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1))) (or (= (+ i_AB 1) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1)))), 10484#(and (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= (+ i_BA 1) i_AB) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= (+ 5 i_BA) An) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= (+ i_BA 1) i_AB) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 5 i_BA) Bn))), 10482#(and (or (not (< i_AB Bn)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (< (+ i_AB 1) An) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 5 i_BA) An) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 3 i_BA) i_AB) (< (+ i_AB 1) Bn) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select A i_AB) (select B i_AB)) (<= (+ 5 i_BA) Bn) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (< (+ i_AB 1) Bn) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 3 i_BA) i_AB) (< (+ i_AB 1) An) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select B i_BA) (select A i_BA)) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (= (select B i_BA) (select A i_BA)) (not (< i_AB An)))), 10464#(and (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< i_BA Bn) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (< i_BA Bn) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1)) (< i_BA An)) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (< i_BA An))), 10455#(and (or (not break_AB) break_BA (= (select B i_BA) (select A i_BA))) (or (< i_AB Bn) break_BA (<= (+ i_BA 1) i_AB)) (or (not break_AB) (<= (+ 2 i_BA) Bn) break_BA (<= (+ i_BA 1) i_AB)) (or break_BA (= (select B i_BA) (select A i_BA)) (< i_AB An)) (or (<= (+ 2 i_BA) An) break_BA (<= i_AB (+ i_BA 1))) (or (not break_AB) (<= (+ 2 i_BA) An) break_BA (<= (+ i_BA 1) i_AB)) (or (< i_AB Bn) break_BA (= (select B i_BA) (select A i_BA))) (or (<= (+ 2 i_BA) Bn) break_BA (<= i_AB (+ i_BA 1))) (or break_BA (<= (+ i_BA 1) i_AB) (< i_AB An))), 10472#(and (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (<= (+ 2 i_BA) Bn) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 2 i_BA) An) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 10477#(and (or (<= i_BA (+ i_AB 1)) (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 3 i_BA) An) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 3 i_BA) Bn))), 10474#(and (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (+ 5 i_AB) i_BA) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (+ 5 i_AB) i_BA) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (= (+ i_AB 4) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 10467#(and (or (<= (+ i_BA 4) An) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= (+ i_BA 1) i_AB) (<= An (+ i_AB 1))) (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ i_BA 4) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= (+ i_BA 1) i_AB) (< (+ 2 i_AB) An) (<= An (+ i_AB 1)))), 10461#(and (or (not (< i_AB Bn)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) (< (+ i_AB 1) An) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB break_BA (= (select A i_AB) (select B i_AB)) (<= (+ 3 i_BA) Bn) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB break_BA (<= (+ i_BA 1) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB break_BA (<= (+ i_BA 1) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (<= (+ 3 i_BA) An) (not (< i_AB Bn)) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 10462#(and (or (not (< i_AB Bn)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) (< (+ i_AB 1) An) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (<= (+ 2 i_BA) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (<= (+ 2 i_BA) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ i_BA 4) An) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ i_BA 4) Bn) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 10483#(and (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1)) (<= (+ 2 i_BA) i_AB)) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (<= (+ 5 i_BA) Bn)) (or (<= (+ 5 i_BA) An) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (<= (+ 2 i_BA) i_AB)) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 10478#(and (or break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= i_BA (+ 2 i_AB)) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= i_BA (+ 2 i_AB)) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ 3 i_BA) An) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 3 i_BA) Bn)) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 10480#(and (or (<= (+ i_BA 4) Bn) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ i_BA 4) An) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB)) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB)) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 10481#(and (or (not break_AB) (= (select B i_BA) (select A i_BA))) (or (< i_AB Bn) (= (select B i_BA) (select A i_BA))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (< i_AB Bn)) (or (< i_AB An) (<= (+ i_BA 4) i_AB)) (or (not break_AB) (<= (+ 5 i_BA) An) (<= (+ i_BA 4) i_AB)) (or (not break_AB) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (or (= (select B i_BA) (select A i_BA)) (< i_AB An)) (or (<= i_AB (+ i_BA 4)) (<= (+ 5 i_BA) Bn)) (or (<= i_AB (+ i_BA 4)) (<= (+ 5 i_BA) An)) (or (< i_AB Bn) (<= (+ i_BA 4) i_AB)) (or (not break_AB) (<= (+ i_BA 4) i_AB) (<= (+ 5 i_BA) Bn)) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (< i_AB An))), 10456#(and (or (<= (+ 3 i_BA) An) (<= i_AB (+ 2 i_BA)) break_BA) (or (not break_AB) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_BA) (or (< i_AB Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_BA) (or (<= i_AB (+ 2 i_BA)) break_BA (<= (+ 3 i_BA) Bn)) (or (not break_AB) break_BA (<= (+ 3 i_BA) Bn) (<= (+ 2 i_BA) i_AB)) (or (< i_AB Bn) break_BA (<= (+ 2 i_BA) i_AB)) (or break_BA (< i_AB An) (<= (+ 2 i_BA) i_AB)) (or (<= (+ 3 i_BA) An) (not break_AB) break_BA (<= (+ 2 i_BA) i_AB)) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_BA (< i_AB An))), 10485#(and (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ i_BA 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ i_BA 4) An) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (<= i_BA (+ i_AB 1)) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 10476#(and (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (<= (+ 2 i_BA) Bn) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (<= (+ 2 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB break_BA (<= i_BA (+ i_AB 4)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (<= i_BA (+ i_AB 4)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 10453#(and (or (= i_BA i_AB) (< i_AB An)) (or (not break_AB) (= i_BA i_AB)) (or (= i_BA i_AB) (< i_AB Bn))), 10454#(and (or (not break_BA) (< i_AB An)) (or (= i_BA i_AB) (< i_AB Bn) (< i_BA Bn)) (or (= i_BA i_AB) (< i_AB An) (< i_BA An)) (or (not break_AB) (= i_BA i_AB) (< i_BA An)) (or (< i_AB Bn) (not break_BA)) (or (not break_AB) (not break_BA)) (or (not break_AB) (= i_BA i_AB) (< i_BA Bn))), 10459#(and (or (not (< i_AB Bn)) break_AB (= (select A i_AB) (select B i_AB)) (< i_BA Bn) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (not break_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) An) break_AB (< i_BA An) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) Bn) break_AB (< i_BA Bn) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select A i_AB) (select B i_AB)) (< i_BA An) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (not break_BA) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (not break_BA) (not (< i_AB An)))), 10466#(and (or (not (< (+ i_AB 1) Bn)) (not (< (+ i_AB 1) An)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= (+ 3 i_BA) Bn)) (or (not (< (+ i_AB 1) Bn)) (< (+ 2 i_AB) Bn) (not (< (+ i_AB 1) An)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= i_BA i_AB)) (or (not (< (+ i_AB 1) Bn)) (< (+ 2 i_AB) Bn) (not (< (+ i_AB 1) An)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB)))) (or (not (< (+ i_AB 1) Bn)) (not (< (+ i_AB 1) An)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (< (+ 2 i_AB) An)) (or (not (< (+ i_AB 1) Bn)) (not (< (+ i_AB 1) An)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (< (+ 2 i_AB) An) (<= i_BA i_AB)) (or (not (< (+ i_AB 1) Bn)) (not (< (+ i_AB 1) An)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (or (<= (+ 3 i_BA) An) (not (< (+ i_AB 1) Bn)) (not (< (+ i_AB 1) An)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))), 10470#(and (or (< (+ i_AB 4) Bn) (= (+ i_AB 4) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (= i_BA (+ 3 i_AB)) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (+ i_AB 4) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 10457#(and (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) (< i_AB An)) (or (<= (+ i_BA 4) Bn) (<= i_AB (+ 3 i_BA))) (or (not break_AB) (<= (+ i_BA 4) Bn) (<= (+ 3 i_BA) i_AB)) (or (< i_AB Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (or (<= (+ 3 i_BA) i_AB) (< i_AB An)) (or (not break_AB) (<= (+ i_BA 4) An) (<= (+ 3 i_BA) i_AB)) (or (<= i_AB (+ 3 i_BA)) (<= (+ i_BA 4) An)) (or (not break_AB) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (or (<= (+ 3 i_BA) i_AB) (< i_AB Bn))), 10465#(and (or (<= (+ 2 i_BA) Bn) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (<= i_BA (+ i_AB 1)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (<= (+ 2 i_BA) An) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= i_BA (+ i_AB 1)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 10486#(and (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB)) (or (< (+ i_AB 4) Bn) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 5 i_BA) Bn)) (or break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ 5 i_BA) An) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB))), 10469#(and (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= i_BA (+ 3 i_AB)) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or (= i_BA (+ 3 i_AB)) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 10473#(and (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ 2 i_BA) An) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ 2 i_BA) Bn) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB break_BA (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) break_AB break_BA (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB)))), 10458#(and (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (= i_BA i_AB) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 10487#(and (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (<= (+ i_BA 4) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (<= (+ i_BA 4) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 10460#(and (or (not (< i_AB Bn)) (<= (+ 2 i_BA) An) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB break_BA (<= i_BA i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 2 i_BA) Bn) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB break_BA (<= i_BA i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (< i_AB An))))] [2022-03-15 20:45:23,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-15 20:45:23,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:23,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-15 20:45:23,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=4003, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 20:45:23,125 INFO L87 Difference]: Start difference. First operand 305 states and 781 transitions. Second operand has 48 states, 47 states have (on average 2.0) internal successors, (94), 47 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:26,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:26,474 INFO L93 Difference]: Finished difference Result 720 states and 1799 transitions. [2022-03-15 20:47:26,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2022-03-15 20:47:26,474 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.0) internal successors, (94), 47 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:47:26,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:26,477 INFO L225 Difference]: With dead ends: 720 [2022-03-15 20:47:26,477 INFO L226 Difference]: Without dead ends: 712 [2022-03-15 20:47:26,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22616 ImplicationChecksByTransitivity, 126.0s TimeCoverageRelationStatistics Valid=9097, Invalid=57725, Unknown=0, NotChecked=0, Total=66822 [2022-03-15 20:47:26,481 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 773 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 1881 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 1881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:26,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [773 Valid, 1 Invalid, 2425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 1881 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 20:47:26,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-03-15 20:47:26,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 382. [2022-03-15 20:47:26,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 2.7532808398950133) internal successors, (1049), 381 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:26,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1049 transitions. [2022-03-15 20:47:26,497 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1049 transitions. Word has length 17 [2022-03-15 20:47:26,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:26,498 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 1049 transitions. [2022-03-15 20:47:26,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.0) internal successors, (94), 47 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:26,498 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1049 transitions. [2022-03-15 20:47:26,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:47:26,500 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:26,500 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:26,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-03-15 20:47:26,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:26,715 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:26,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:26,716 INFO L85 PathProgramCache]: Analyzing trace with hash -767335138, now seen corresponding path program 17 times [2022-03-15 20:47:26,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:26,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744838197] [2022-03-15 20:47:26,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:26,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:26,871 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:26,872 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:26,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744838197] [2022-03-15 20:47:26,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744838197] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:26,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378155579] [2022-03-15 20:47:26,872 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:47:26,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:26,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:26,873 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:47:26,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 20:47:26,895 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:47:26,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:26,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 20:47:26,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:47:27,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:27,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:27,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:27,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:27,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:27,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:27,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:27,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:27,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:27,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:27,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:27,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:27,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:27,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:27,882 INFO L353 Elim1Store]: treesize reduction 141, result has 14.5 percent of original size [2022-03-15 20:47:27,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 13 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 122 treesize of output 117 [2022-03-15 20:47:27,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-03-15 20:47:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:27,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378155579] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:27,940 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:27,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 27 [2022-03-15 20:47:27,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [794394513] [2022-03-15 20:47:27,940 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:27,941 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:27,947 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 95 transitions. [2022-03-15 20:47:27,948 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:33,271 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [12502#(and (or (< (+ 3 i_BA) Bn) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_BA (<= An (+ 2 i_BA)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_BA (<= An (+ 2 i_AB)) (<= An (+ 2 i_BA)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (<= An (+ 2 i_AB)) (<= An (+ 2 i_BA)) (< (+ 3 i_BA) An) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 12491#(and (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< i_BA Bn) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (< i_BA An))), 12479#(and (not break_BA) (< i_BA Bn) (< i_BA An)), 12492#(and (or (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (< i_BA Bn)) (< (+ i_BA 1) An) (not (< i_BA An)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ i_AB 1))) (or (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ i_BA 1) Bn))), 12485#(and (or (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (<= (+ Bn 1) i_AB) (< (+ i_BA 1) Bn)) (or (not (< i_BA Bn)) (<= (+ An 1) i_AB) (not (< i_BA An)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (<= (+ Bn 1) i_AB)) (or (not (< i_BA Bn)) (< (+ i_BA 1) An) (<= (+ An 1) i_AB) (not (< i_BA An)) break_AB break_BA)), 12499#(and (or (<= Bn (+ 2 i_AB)) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) (<= An (+ 2 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An))), 12483#(and (or (<= Bn i_BA) (<= An i_BA) break_BA (= (select B i_BA) (select A i_BA))) (or (<= Bn i_BA) (<= An i_BA) break_BA (< (+ i_BA 1) Bn)) (or (< (+ i_BA 1) An) (<= Bn i_BA) (<= An i_BA) break_BA)), 12482#(and (or (<= Bn i_AB) (<= An i_AB) break_AB (not break_BA)) (or (<= Bn i_AB) (<= An i_AB) break_AB (< i_BA An)) (or (<= Bn i_AB) (<= An i_AB) break_AB (< i_BA Bn))), 12498#(and (or (< (+ 3 i_BA) Bn) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_BA)) (<= Bn (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_BA)) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_BA)) (< (+ 3 i_BA) An) (<= An (+ i_AB 1)))), 12487#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) An)) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_BA (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) Bn))), 12486#(and (or (not (< i_BA Bn)) (<= Bn i_AB) (<= An i_AB) (not (< i_BA An)) break_AB break_BA (= (select B i_BA) (select A i_BA))) (or (not (< i_BA Bn)) (<= Bn i_AB) (not (< i_BA An)) break_AB break_BA (< (+ i_BA 1) Bn)) (or (not (< i_BA Bn)) (< (+ i_BA 1) An) (<= An i_AB) (not (< i_BA An)) break_AB break_BA)), 12484#(and (or (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (<= (+ 2 Bn) i_AB) (< (+ i_BA 1) Bn)) (or (<= (+ 2 An) i_AB) (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (<= (+ 2 Bn) i_AB)) (or (<= (+ 2 An) i_AB) (not (< i_BA Bn)) (< (+ i_BA 1) An) (not (< i_BA An)) break_AB break_BA)), 12493#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_AB break_BA (<= An (+ i_BA 1)) (not (= (select A i_AB) (select B i_AB))) (< (+ 2 i_BA) An) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= An (+ i_BA 1)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_AB break_BA (<= An (+ i_BA 1)) (not (= (select A i_AB) (select B i_AB))) (< (+ 2 i_BA) Bn) (<= Bn (+ i_AB 1)))), 12494#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_BA (<= An (+ 2 i_BA))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (<= An (+ 2 i_BA)) (< (+ 3 i_BA) An)) (or (< (+ 3 i_BA) Bn) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (<= An (+ 2 i_BA)))), 12480#(and (or (<= (+ 2 An) i_AB) break_AB (<= (+ 2 Bn) i_AB) (< i_BA Bn)) (or (<= (+ 2 An) i_AB) break_AB (not break_BA) (<= (+ 2 Bn) i_AB)) (or (<= (+ 2 An) i_AB) break_AB (<= (+ 2 Bn) i_AB) (< i_BA An))), 12488#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_AB break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) Bn) (<= (+ 2 Bn) i_AB)) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 2 An) i_AB) (<= Bn (+ i_BA 1)) break_AB break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) An)) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 2 An) i_AB) (<= Bn (+ i_BA 1)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= An (+ i_BA 1)) (<= (+ 2 Bn) i_AB))), 12495#(and (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 2 An) i_AB) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= An (+ 2 i_BA)) (< (+ 3 i_BA) An)) (or (< (+ 3 i_BA) Bn) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= (+ 2 Bn) i_AB) (<= An (+ 2 i_BA))) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 2 An) i_AB) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (<= (+ 2 Bn) i_AB) (<= An (+ 2 i_BA)))), 12500#(and (or (not (< i_BA Bn)) (<= Bn (+ 2 i_AB)) (not (< i_BA An)) break_BA (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< (+ i_BA 1) Bn)) (or (not (< i_BA Bn)) (< (+ i_BA 1) An) (not (< i_BA An)) break_BA (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (< i_BA Bn)) (<= Bn (+ 2 i_AB)) (not (< i_BA An)) break_BA (= (select B i_BA) (select A i_BA)) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 12496#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= (+ An 1) i_AB) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (<= (+ Bn 1) i_AB) (<= An (+ 2 i_BA))) (or (< (+ 3 i_BA) Bn) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= (+ Bn 1) i_AB) (<= An (+ 2 i_BA))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= (+ An 1) i_AB) break_AB break_BA (<= An (+ 2 i_BA)) (< (+ 3 i_BA) An))), 12501#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) An) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= Bn (+ 2 i_AB)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_BA (<= An (+ i_BA 1)) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= Bn (+ 2 i_AB)) break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 12490#(and (or (not (= (select B i_BA) (select A i_BA))) (not (< (+ i_BA 1) An)) (not (< (+ i_BA 1) Bn)) (<= Bn i_AB) (<= An i_AB) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA) (or (not (= (select B i_BA) (select A i_BA))) (not (< (+ i_BA 1) An)) (not (< (+ i_BA 1) Bn)) (<= An i_AB) break_AB break_BA (< (+ 2 i_BA) An)) (or (not (= (select B i_BA) (select A i_BA))) (not (< (+ i_BA 1) An)) (not (< (+ i_BA 1) Bn)) (<= Bn i_AB) break_AB break_BA (< (+ 2 i_BA) Bn))), 12489#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_AB break_BA (<= (+ Bn 1) i_AB) (<= An (+ i_BA 1)) (< (+ 2 i_BA) Bn)) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= (+ An 1) i_AB) break_AB break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) An)) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= (+ An 1) i_AB) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= (+ Bn 1) i_AB) (<= An (+ i_BA 1)))), 12497#(and (or (< (+ 3 i_BA) Bn) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn i_AB) break_AB break_BA (<= An (+ 2 i_BA))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= An i_AB) break_AB break_BA (<= An (+ 2 i_BA)) (< (+ 3 i_BA) An)) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn i_AB) (<= An i_AB) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (<= An (+ 2 i_BA)))), 12481#(and (or (<= (+ An 1) i_AB) break_AB (<= (+ Bn 1) i_AB) (< i_BA Bn)) (or (<= (+ An 1) i_AB) break_AB (<= (+ Bn 1) i_AB) (not break_BA)) (or (<= (+ An 1) i_AB) break_AB (<= (+ Bn 1) i_AB) (< i_BA An)))] [2022-03-15 20:47:33,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 20:47:33,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:33,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 20:47:33,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=2338, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 20:47:33,272 INFO L87 Difference]: Start difference. First operand 382 states and 1049 transitions. Second operand has 36 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 35 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:35,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:35,535 INFO L93 Difference]: Finished difference Result 479 states and 1252 transitions. [2022-03-15 20:47:35,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 20:47:35,535 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 35 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:47:35,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:35,537 INFO L225 Difference]: With dead ends: 479 [2022-03-15 20:47:35,537 INFO L226 Difference]: Without dead ends: 474 [2022-03-15 20:47:35,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1511 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=876, Invalid=4824, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 20:47:35,541 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 129 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:35,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 1 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:47:35,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-03-15 20:47:35,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 383. [2022-03-15 20:47:35,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 2.6989528795811517) internal successors, (1031), 382 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1031 transitions. [2022-03-15 20:47:35,552 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1031 transitions. Word has length 17 [2022-03-15 20:47:35,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:35,552 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 1031 transitions. [2022-03-15 20:47:35,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 35 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:35,552 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1031 transitions. [2022-03-15 20:47:35,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:47:35,553 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:35,553 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:35,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 20:47:35,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:35,767 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:35,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:35,768 INFO L85 PathProgramCache]: Analyzing trace with hash -596585775, now seen corresponding path program 18 times [2022-03-15 20:47:35,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:35,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408488750] [2022-03-15 20:47:35,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:35,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:35,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:35,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408488750] [2022-03-15 20:47:35,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408488750] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:35,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865463888] [2022-03-15 20:47:35,981 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:47:35,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:35,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:35,982 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:47:35,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 20:47:36,004 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:47:36,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:36,005 WARN L261 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:47:36,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:36,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 95 [2022-03-15 20:47:36,878 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2022-03-15 20:47:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:36,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:38,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:38,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:38,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:38,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:38,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:38,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:38,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:38,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:38,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:38,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:38,646 INFO L353 Elim1Store]: treesize reduction 349, result has 11.2 percent of original size [2022-03-15 20:47:38,646 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 10 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 35 case distinctions, treesize of input 265 treesize of output 256 [2022-03-15 20:47:38,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:38,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2022-03-15 20:47:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:38,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865463888] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:38,756 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:38,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 35 [2022-03-15 20:47:38,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1140636386] [2022-03-15 20:47:38,756 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:38,757 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:38,765 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 114 transitions. [2022-03-15 20:47:38,765 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:49,176 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [13941#(and (or break_AB break_BA (<= i_BA i_AB)) (or break_AB break_BA (= (select B i_BA) (select A i_BA))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= (+ i_BA 1) i_AB)) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= i_AB (+ i_BA 1))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= i_AB (+ i_BA 1))) (or (<= i_AB (+ 2 i_BA)) break_AB break_BA)), 13943#(and (or (<= (+ 3 i_BA) i_AB) break_AB (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (<= i_AB (+ i_BA 4)) break_AB) (or break_AB (<= (+ 2 i_BA) i_AB)) (or (<= i_AB (+ 3 i_BA)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB) (or (<= i_AB (+ 3 i_BA)) break_AB (not (= (select A i_AB) (select B i_AB)))) (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB)), 13940#(and (or (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB)))) (or break_AB (= (select A i_AB) (select B i_AB)) (<= i_BA i_AB)) (or (not (= (select B i_BA) (select A i_BA))) break_AB (<= i_BA i_AB)) (or (<= i_AB i_BA) break_AB (= (select B i_BA) (select A i_BA))) (or (<= i_BA (+ i_AB 1)) break_AB) (or break_AB (<= i_AB (+ i_BA 1)))), 13936#(and (or (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (+ i_AB 1) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))), 13961#(and (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))))), 13960#(and (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_AB (+ i_BA 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))))), 13947#(and (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= (+ 2 i_BA) i_AB) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB)))) (or (<= i_AB (+ 2 i_BA)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= (+ i_BA 1) i_AB)) (or (<= i_AB (+ 3 i_BA)) break_AB (not (= (select A i_AB) (select B i_AB))))), 13963#(and (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= (+ i_BA 1) i_AB) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_AB (+ i_BA 1))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB)) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_AB (+ 2 i_BA)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 13952#(and (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_AB (+ i_BA 1))) (or (<= i_AB i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB))), 13945#(and (or (<= i_AB i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= i_AB (+ i_BA 1))) (or (<= i_BA (+ i_AB 1)) break_AB break_BA (not (= (select A i_AB) (select B i_AB)))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= i_BA i_AB)) (or break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))))), 13957#(and (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB break_BA (<= i_BA (+ i_AB 4)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 3 i_AB) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 13944#(and (or (not (= (select B i_BA) (select A i_BA))) (<= i_BA (+ i_AB 1)) break_AB (not (= (select A i_AB) (select B i_AB)))) (or break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_BA (+ 2 i_AB))) (or (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB)))) (or (<= i_BA (+ i_AB 1)) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))), 13956#(and (or (<= i_BA (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (<= i_BA (+ i_AB 4)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= (+ i_AB 4) i_BA) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 3 i_AB) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (<= i_BA (+ i_AB 4)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 13962#(and (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= (+ i_BA 1) i_AB) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_AB (+ 2 i_BA)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_AB (+ 3 i_BA)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 2 i_BA) i_AB))), 13959#(and (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= (+ i_BA 1) i_AB) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (<= i_AB (+ 2 i_BA)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_AB (+ i_BA 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB))), 13939#(and (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (+ 5 i_AB) i_BA)) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (= (+ i_AB 4) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 13949#(and (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB)))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB)))) (or (<= i_AB (+ i_BA 4)) break_AB (not (= (select A i_AB) (select B i_AB)))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= (+ 2 i_BA) i_AB)) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (<= (+ 3 i_BA) i_AB) break_AB (not (= (select A i_AB) (select B i_AB)))) (or (<= i_AB (+ 3 i_BA)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 13942#(and (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA) (or break_AB break_BA (<= (+ i_BA 1) i_AB)) (or break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= (+ 2 i_BA) i_AB)) (or (<= i_AB (+ 2 i_BA)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA) (or (<= i_AB (+ 3 i_BA)) break_AB break_BA) (or (<= i_AB (+ 2 i_BA)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))))), 13951#(and (or (<= i_BA (+ i_AB 1)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_AB i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 13937#(and (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= i_BA (+ 3 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 13955#(and (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_AB i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 13950#(and (or break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or (not (= (select B i_BA) (select A i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 13946#(and (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_AB (+ i_BA 1))) (or break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= (+ i_BA 1) i_AB)) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB)))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= i_BA i_AB)) (or (<= i_AB (+ 2 i_BA)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))))), 13954#(and (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 13938#(and (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (= i_BA (+ 3 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (+ i_AB 4) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 13935#(and (or (= i_BA i_AB) break_AB (= (select A i_AB) (select B i_AB))) (or (= (+ i_AB 1) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))))), 13948#(and (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB) (or (<= i_AB (+ i_BA 4)) break_AB (not (= (select A i_AB) (select B i_AB)))) (or break_AB (<= i_AB (+ 5 i_BA))) (or (<= i_AB (+ i_BA 4)) break_AB (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (or (<= (+ 3 i_BA) i_AB) break_AB) (or break_AB (= (select B i_BA) (select A i_BA))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) break_AB (<= (+ i_BA 4) i_AB))), 13964#(and (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= i_AB i_BA) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_AB (+ i_BA 1))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB))), 13958#(and (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 13953#(and (or (<= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or break_AB (<= i_BA (+ i_AB 4)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 3 i_AB) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))))] [2022-03-15 20:47:49,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 20:47:49,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:49,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 20:47:49,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=3999, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 20:47:49,177 INFO L87 Difference]: Start difference. First operand 383 states and 1031 transitions. Second operand has 42 states, 41 states have (on average 2.268292682926829) internal successors, (93), 41 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:52,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:52,251 INFO L93 Difference]: Finished difference Result 906 states and 2072 transitions. [2022-03-15 20:47:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 20:47:52,253 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.268292682926829) internal successors, (93), 41 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:47:52,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:52,256 INFO L225 Difference]: With dead ends: 906 [2022-03-15 20:47:52,256 INFO L226 Difference]: Without dead ends: 887 [2022-03-15 20:47:52,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 18 SyntacticMatches, 10 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2137 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=616, Invalid=5864, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 20:47:52,256 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 218 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 3334 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:52,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 1 Invalid, 3373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3334 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 20:47:52,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-03-15 20:47:52,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 446. [2022-03-15 20:47:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 2.730337078651685) internal successors, (1215), 445 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:52,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1215 transitions. [2022-03-15 20:47:52,265 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1215 transitions. Word has length 18 [2022-03-15 20:47:52,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:52,265 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 1215 transitions. [2022-03-15 20:47:52,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.268292682926829) internal successors, (93), 41 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1215 transitions. [2022-03-15 20:47:52,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:47:52,266 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:52,266 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:52,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-03-15 20:47:52,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:52,479 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:52,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:52,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1137107668, now seen corresponding path program 19 times [2022-03-15 20:47:52,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:52,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784564163] [2022-03-15 20:47:52,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:52,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:52,643 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:52,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784564163] [2022-03-15 20:47:52,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784564163] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:52,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356740218] [2022-03-15 20:47:52,643 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:47:52,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:52,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:52,644 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:47:52,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 20:47:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:52,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 20:47:52,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:53,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:54,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:54,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:54,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:54,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:54,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:54,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:54,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:54,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:54,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:54,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:54,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:54,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:54,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:54,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:54,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:54,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:47:54,243 INFO L353 Elim1Store]: treesize reduction 199, result has 10.8 percent of original size [2022-03-15 20:47:54,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 16 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 134 treesize of output 125 [2022-03-15 20:47:54,248 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-03-15 20:47:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:54,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356740218] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:54,312 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:54,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-03-15 20:47:54,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1449511133] [2022-03-15 20:47:54,312 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:54,313 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:54,321 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 112 transitions. [2022-03-15 20:47:54,321 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:48:00,667 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [15956#(and (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 15944#(or (not (= (select B i_BA) (select A i_BA))) (= (+ i_BA 1) (+ i_AB 1)) (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA), 15939#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= An (+ i_BA 1)) (<= (+ i_BA 4) i_AB))), 15942#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= An (+ 2 i_BA)) (<= (+ i_BA 4) i_AB)) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= An (+ 2 i_BA)))), 15951#(or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= An (+ 2 i_BA)) (= (+ i_BA 1) i_AB)), 15945#(or (not (= (select B i_BA) (select A i_BA))) (not (< i_BA Bn)) (= (+ 2 i_AB) (+ i_BA 1)) (not (< i_BA An)) break_AB break_BA), 15955#(and (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ 2 i_BA) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (<= (+ 2 i_BA) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 2 i_BA) An) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ 2 i_BA) An) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 15952#(and (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 15950#(or (= i_AB (+ 2 i_BA)) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= An (+ 2 i_BA))), 15934#(and (or (<= (+ 2 i_BA) An) (< i_AB An)) (or (not break_AB) (<= (+ 2 i_BA) Bn)) (or (not break_BA) (< i_AB An)) (or (< i_AB Bn) (<= (+ 2 i_BA) Bn)) (or (< i_AB Bn) (not break_BA)) (or (not break_AB) (not break_BA)) (or (not break_AB) (<= (+ 2 i_BA) An))), 15928#(and (not break_AB) (< i_AB Bn) (< i_AB An)), 15957#(and (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (<= (+ 2 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (<= (+ 2 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 15935#(and (or (not (< i_AB Bn)) (<= (+ 2 i_BA) Bn) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) (<= (+ 2 i_BA) Bn) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 2 i_BA) An) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) An) break_AB (not break_BA)) (or (<= Bn i_AB) (<= An i_AB) break_AB (not break_BA) (= (select A i_AB) (select B i_AB))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) break_AB (not break_BA)) (or (not (< i_AB Bn)) (<= (+ 2 i_BA) An) (< (+ i_AB 1) An) break_AB (not (< i_AB An)))), 15941#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= (+ 3 i_BA) i_AB) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= An (+ i_BA 1)))), 15940#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (<= (+ 5 i_BA) i_AB) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= An (+ 2 i_BA))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= An (+ 2 i_BA)))), 15943#(or (not (= (select B i_BA) (select A i_BA))) (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (= (+ i_BA 1) i_AB)), 15959#(and (or (<= Bn (+ 5 i_AB)) (<= (+ 2 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (<= (+ 2 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 15946#(or (= i_AB (+ 2 i_BA)) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= An (+ i_BA 1))), 15936#(and (or (< (+ 2 i_AB) Bn) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ 2 i_BA) An) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ 2 i_BA) An) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1)))), 15949#(or (= i_AB (+ 3 i_BA)) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= An (+ 2 i_BA))), 15938#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (<= (+ 6 i_BA) Bn) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= An (+ 2 i_BA))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= An (+ 2 i_BA))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (<= (+ 6 i_BA) An) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= An (+ 2 i_BA)))), 15948#(or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (= i_BA i_AB) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= An (+ i_BA 1))), 15954#(and (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 2 i_BA) An) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 2 i_BA) An) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 15947#(or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= An (+ i_BA 1)) (= (+ i_BA 1) i_AB)), 15937#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_BA (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= (+ 5 i_BA) An) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (<= An (+ i_BA 1)) (<= (+ 5 i_BA) Bn))), 15933#(and (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 15932#(and (or (<= Bn i_AB) (<= An i_AB) break_AB (= (select A i_AB) (select B i_AB))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) An) break_AB) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) break_AB)), 15953#(and (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 15958#(and (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB))))), 15929#(and (or (not (= (select B i_BA) (select A i_BA))) (not (< i_BA Bn)) (not (< i_BA An)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_BA) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ i_BA 4) An) (not (< i_BA Bn)) (not (< i_BA An)) break_BA) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ i_BA 4) Bn) (not (< i_BA Bn)) (not (< i_BA An)) break_BA)), 15931#(and (or (not (= (select B i_BA) (select A i_BA))) (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (<= (+ 2 i_BA) i_AB)) (or (not (= (select B i_BA) (select A i_BA))) (not (< i_BA Bn)) (not (< i_BA An)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA)), 15930#(and (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 3 i_BA) i_AB) (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA) (or (not (= (select B i_BA) (select A i_BA))) (not (< i_BA Bn)) (not (< i_BA An)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA))] [2022-03-15 20:48:00,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 20:48:00,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:48:00,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 20:48:00,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=4029, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 20:48:00,668 INFO L87 Difference]: Start difference. First operand 446 states and 1215 transitions. Second operand has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 44 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:45,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:48:45,346 INFO L93 Difference]: Finished difference Result 1222 states and 2934 transitions. [2022-03-15 20:48:45,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2022-03-15 20:48:45,347 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 44 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:48:45,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:48:45,351 INFO L225 Difference]: With dead ends: 1222 [2022-03-15 20:48:45,351 INFO L226 Difference]: Without dead ends: 1222 [2022-03-15 20:48:45,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16300 ImplicationChecksByTransitivity, 45.4s TimeCoverageRelationStatistics Valid=7170, Invalid=45042, Unknown=0, NotChecked=0, Total=52212 [2022-03-15 20:48:45,353 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 743 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 2707 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 2707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:48:45,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [743 Valid, 1 Invalid, 3625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 2707 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 20:48:45,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2022-03-15 20:48:45,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 518. [2022-03-15 20:48:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 2.793036750483559) internal successors, (1444), 517 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1444 transitions. [2022-03-15 20:48:45,364 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1444 transitions. Word has length 18 [2022-03-15 20:48:45,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:48:45,364 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 1444 transitions. [2022-03-15 20:48:45,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 44 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:45,364 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1444 transitions. [2022-03-15 20:48:45,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:48:45,365 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:48:45,365 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:48:45,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 20:48:45,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-15 20:48:45,578 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:48:45,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:48:45,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1313900707, now seen corresponding path program 20 times [2022-03-15 20:48:45,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:48:45,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62002420] [2022-03-15 20:48:45,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:48:45,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:48:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:48:45,823 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:45,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:48:45,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62002420] [2022-03-15 20:48:45,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62002420] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:48:45,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882030735] [2022-03-15 20:48:45,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:48:45,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:48:45,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:48:45,824 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:48:45,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 20:48:45,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:48:45,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:48:45,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 20:48:45,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:48:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:46,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:48:47,528 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:48:47,597 INFO L353 Elim1Store]: treesize reduction 257, result has 8.5 percent of original size [2022-03-15 20:48:47,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 20 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 25 case distinctions, treesize of input 148 treesize of output 135 [2022-03-15 20:48:47,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-03-15 20:48:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:47,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882030735] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:48:47,685 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:48:47,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 37 [2022-03-15 20:48:47,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [944415623] [2022-03-15 20:48:47,685 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:48:47,687 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:48:47,697 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 129 transitions. [2022-03-15 20:48:47,697 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:49:03,720 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 42 new interpolants: [18710#(and (or (not (= (select B i_BA) (select A i_BA))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB break_BA (<= i_BA (+ i_AB 4)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B i_BA) (select A i_BA))) (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (<= i_BA (+ i_AB 4)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B i_BA) (select A i_BA))) (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (<= (+ i_AB 4) i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B i_BA) (select A i_BA))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B i_BA) (select A i_BA))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (<= (+ i_AB 4) i_BA) (< (+ 5 i_AB) An) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 18692#(and (or (< (+ 2 i_AB) Bn) (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1))) (or (= (+ i_AB 1) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= An (+ i_AB 1)))), 18690#(and (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (+ i_AB 1) i_BA) (< (+ i_AB 1) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not (< i_AB An))) (or (not (< i_AB Bn)) (= i_BA i_AB) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 18694#(and (or (= i_BA (+ 3 i_AB)) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (= (+ 2 i_AB) i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= i_BA (+ 3 i_AB)) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 18719#(and (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= (+ i_BA 1) i_AB) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (<= i_AB (+ i_BA 1))) (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (<= i_AB (+ i_BA 1))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= (+ i_BA 1) i_AB) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))))), 18714#(and (or (not (< (+ i_AB 1) Bn)) (not (< (+ i_AB 1) An)) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= (+ i_BA 1) i_AB) (< (+ 2 i_AB) An)) (or (not (< (+ i_AB 1) Bn)) (< (+ 2 i_AB) Bn) (not (< (+ i_AB 1) An)) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= i_AB (+ i_BA 1))) (or (not (< (+ i_AB 1) Bn)) (not (< (+ i_AB 1) An)) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (or (not (< (+ i_AB 1) Bn)) (< (+ 2 i_AB) Bn) (not (< (+ i_AB 1) An)) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= (+ i_BA 1) i_AB)) (or (not (< (+ i_AB 1) Bn)) (not (< (+ i_AB 1) An)) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (< (+ 2 i_AB) An) (<= i_AB (+ i_BA 1)))), 18726#(and (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (< (+ 2 i_AB) Bn) (<= (+ 3 i_BA) i_AB) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (<= i_AB (+ 3 i_BA)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (< (+ 2 i_AB) Bn) (<= i_AB (+ 3 i_BA)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (<= (+ 3 i_BA) i_AB) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1)))), 18702#(and (or (< (+ i_AB 4) Bn) (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (not (= (select B i_BA) (select A i_BA))) (<= (+ 3 i_AB) i_BA) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 3 i_AB) i_BA) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 18707#(and (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= (+ 2 i_AB) i_BA) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= i_BA (+ 2 i_AB)) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= (+ 2 i_AB) i_BA) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= i_BA (+ 2 i_AB)) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 18705#(and (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= i_AB i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= i_BA i_AB) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= i_AB i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= i_BA i_AB) (<= An (+ i_AB 1)))), 18698#(and (or (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (< (+ 2 i_AB) Bn) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (< (+ 2 i_AB) Bn) (<= i_BA (+ i_AB 1)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= i_BA (+ i_AB 1)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 18721#(and (or (< (+ i_AB 4) Bn) (<= i_AB i_BA) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (<= i_AB i_BA) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))))), 18699#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_AB)) (<= (+ 2 i_AB) i_BA) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 18706#(and (or (<= i_BA (+ i_AB 1)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB break_BA (<= (+ i_AB 1) i_BA) (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) (< (+ 3 i_AB) Bn) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 18701#(and (or (< (+ i_AB 4) Bn) break_AB break_BA (<= Bn (+ 3 i_AB)) (<= i_BA (+ i_AB 4)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (<= (+ i_AB 4) i_BA) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ i_AB 4) i_BA) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (<= Bn (+ 3 i_AB)) (<= i_BA (+ i_AB 4)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 18709#(and (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (<= i_BA (+ 5 i_AB)) (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (<= (+ 5 i_AB) i_BA) (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (<= i_BA (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (<= (+ 5 i_AB) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 18703#(and (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (< i_AB An) (<= (+ 2 i_BA) i_AB)) (or (not break_AB) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (<= (+ 2 i_BA) i_AB)) (or (not break_AB) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (<= An (+ 2 i_BA))) (or (<= i_AB (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< i_AB Bn) break_BA) (or (<= i_AB (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (< i_AB An)) (or (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< i_AB Bn) break_BA (<= (+ 2 i_BA) i_AB))), 18713#(and (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= (+ 2 i_BA) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_AB (+ 2 i_BA)) (< (+ i_AB 1) Bn) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_AB (+ 2 i_BA)) (< (+ i_AB 1) An) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= (+ 2 i_BA) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 18696#(and (or (not break_AB) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_BA (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (< i_AB Bn) break_BA (<= i_AB (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) break_BA (<= (+ i_BA 1) i_AB) (< i_AB An)) (or (not break_AB) (not (= (select B i_BA) (select A i_BA))) break_BA (<= (+ i_BA 1) i_AB)) (or (not (= (select B i_BA) (select A i_BA))) break_BA (< i_AB An) (<= i_AB (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (< i_AB Bn) break_BA (<= (+ i_BA 1) i_AB))), 18708#(and (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (+ 5 i_AB) i_BA) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (+ 5 i_AB) i_BA) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (= (+ i_AB 4) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 18711#(and (or (<= (+ 3 i_AB) i_BA) (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (<= (+ 3 i_AB) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ 5 i_AB) An) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB)) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ 5 i_AB) An) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB)) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 18689#(and (or break_BA (< i_AB An) (<= i_BA i_AB)) (or (not break_AB) (<= Bn i_BA) (<= An i_BA) break_BA) (or (<= i_AB i_BA) (< i_AB Bn) break_BA) (or (not break_AB) break_BA (<= i_BA i_AB)) (or (< i_AB Bn) break_BA (<= i_BA i_AB)) (or (<= i_AB i_BA) break_BA (< i_AB An))), 18697#(and (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (< (+ i_AB 1) An) break_AB break_BA (<= i_BA i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (<= i_AB i_BA) (< (+ i_AB 1) Bn) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (< (+ i_AB 1) Bn) break_AB break_BA (<= i_BA i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) (<= i_AB i_BA) (< (+ i_AB 1) An) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B i_BA) (select A i_BA))) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 18695#(and (or (<= (+ 3 i_AB) i_BA) (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 3 i_AB) i_BA) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA (+ 3 i_AB)))), 18723#(and (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (<= Bn (+ i_AB 4))) (or (<= i_BA (+ i_AB 1)) (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (<= Bn (+ i_AB 4))) (or (<= i_BA (+ i_AB 1)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (<= (+ i_AB 1) i_BA) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (<= Bn (+ i_AB 4)))), 18729#(and (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (<= i_AB i_BA) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (<= i_AB i_BA) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 18712#(and (or (<= i_AB (+ 3 i_BA)) (< i_AB Bn) break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))))) (or (<= (+ 3 i_BA) i_AB) (< i_AB Bn) break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))))) (or (not break_AB) (<= An (+ 3 i_BA)) break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA))) (or (<= i_AB (+ 3 i_BA)) break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (< i_AB An)) (or (<= (+ 3 i_BA) i_AB) break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (< i_AB An)) (or (not break_AB) (<= (+ 3 i_BA) i_AB) break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))))), 18693#(and (or (< (+ 2 i_AB) Bn) (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= i_BA (+ 2 i_AB)) (<= An (+ i_AB 1))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= i_BA (+ 2 i_AB)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 18700#(and (or (< (+ i_AB 4) Bn) (= (+ i_AB 4) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (= i_BA (+ 3 i_AB)) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (+ i_AB 4) i_BA) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 18720#(and (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (<= i_BA (+ i_AB 1)) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= i_BA (+ i_AB 1)) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (<= Bn (+ 3 i_AB)) (<= (+ i_AB 1) i_BA) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) break_AB break_BA (<= Bn (+ 3 i_AB)) (<= (+ i_AB 1) i_BA) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 18688#(and (or (= i_BA i_AB) (< i_AB An)) (or (not break_AB) (= i_BA i_AB)) (or (= i_BA i_AB) (< i_AB Bn))), 18716#(and (or (not (< i_AB Bn)) (<= i_AB (+ 3 i_BA)) (< (+ i_AB 1) An) break_AB (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_AB (+ 3 i_BA)) (< (+ i_AB 1) Bn) break_AB (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select A i_AB) (select B i_AB)) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 3 i_BA) i_AB) (< (+ i_AB 1) An) break_AB (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 3 i_BA) i_AB) (< (+ i_AB 1) Bn) break_AB (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (not (< i_AB An)))), 18704#(and (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ i_AB 1) An) break_AB break_BA (<= (+ i_BA 1) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ i_AB 1) Bn) break_AB break_BA (<= i_AB (+ i_BA 1)) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ i_AB 1) Bn) break_AB break_BA (<= (+ i_BA 1) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (< (+ i_AB 1) An) break_AB break_BA (<= i_AB (+ i_BA 1)) (not (< i_AB An)))), 18722#(and (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) (<= (+ 2 i_AB) i_BA) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= i_BA (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 18691#(and (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB break_BA (<= (+ i_AB 1) i_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_BA (+ i_AB 1)) (< (+ i_AB 1) An) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_BA (+ i_AB 1)) (< (+ i_AB 1) Bn) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 18724#(and (or (not break_AB) (= (select B i_BA) (select A i_BA))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (not break_AB) (<= (+ 5 i_BA) i_AB)) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (<= (+ 5 i_BA) i_AB) (< i_AB An)) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (not break_AB) (<= Bn (+ 5 i_BA)) (<= An (+ 5 i_BA))) (or (< i_AB Bn) (= (select B i_BA) (select A i_BA))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (< i_AB Bn) (<= i_AB (+ 5 i_BA))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (<= i_AB (+ 5 i_BA)) (< i_AB An)) (or (= (select B i_BA) (select A i_BA)) (< i_AB An)) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (<= (+ 5 i_BA) i_AB) (< i_AB Bn))), 18715#(and (or (< i_AB An) (<= (+ i_BA 4) i_AB) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (< i_AB Bn) (<= (+ i_BA 4) i_AB) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (not break_AB) (<= (+ i_BA 4) i_AB) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (<= i_AB (+ i_BA 4)) (< i_AB Bn) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (<= An (+ i_BA 4)) (not break_AB) (<= Bn (+ i_BA 4)) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (<= i_AB (+ i_BA 4)) (< i_AB An) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))))), 18717#(and (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (<= (+ 2 i_BA) i_AB) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1)) (<= (+ 2 i_BA) i_AB) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (< (+ 2 i_AB) Bn) (<= i_AB (+ 2 i_BA)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))))) (or (<= i_AB (+ 2 i_BA)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1)) (not (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))))), 18728#(and (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_AB (+ i_BA 1))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= (+ i_BA 1) i_AB) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= (+ i_BA 1) i_AB) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_AB (+ i_BA 1))) (or break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 18718#(and (or (< (+ 3 i_AB) Bn) (<= i_AB i_BA) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB)) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= i_BA i_AB)) (or (<= i_AB i_BA) (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 18727#(and (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (< (+ 3 i_AB) Bn) (<= i_AB (+ 2 i_BA)) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (<= i_AB (+ 2 i_BA)) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 2 i_BA) i_AB)) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 2 i_BA) i_AB))), 18725#(and (or (not (< i_AB Bn)) (<= i_AB (+ i_BA 4)) (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (< (+ i_AB 1) Bn) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (<= i_AB (+ i_BA 4)) (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (< (+ i_AB 1) An) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (< (+ i_AB 1) An) break_AB (<= (+ i_BA 4) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (< i_AB An))) (or (not (< i_AB Bn)) (not (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (< (+ i_AB 1) Bn) break_AB (<= (+ i_BA 4) i_AB) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select B i_BA) (select A i_BA)) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (= (select B i_BA) (select A i_BA)) (not (< i_AB An))))] [2022-03-15 20:49:03,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 20:49:03,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:49:03,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 20:49:03,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=5925, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 20:49:03,721 INFO L87 Difference]: Start difference. First operand 518 states and 1444 transitions. Second operand has 56 states, 55 states have (on average 2.090909090909091) internal successors, (115), 55 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:49:45,226 INFO L93 Difference]: Finished difference Result 696 states and 1830 transitions. [2022-03-15 20:49:45,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 20:49:45,226 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.090909090909091) internal successors, (115), 55 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 20:49:45,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:49:45,228 INFO L225 Difference]: With dead ends: 696 [2022-03-15 20:49:45,229 INFO L226 Difference]: Without dead ends: 674 [2022-03-15 20:49:45,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3801 ImplicationChecksByTransitivity, 45.5s TimeCoverageRelationStatistics Valid=1936, Invalid=15356, Unknown=0, NotChecked=0, Total=17292 [2022-03-15 20:49:45,230 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 506 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:49:45,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [506 Valid, 1 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 20:49:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-03-15 20:49:45,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 587. [2022-03-15 20:49:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 586 states have (on average 2.71160409556314) internal successors, (1589), 586 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1589 transitions. [2022-03-15 20:49:45,238 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1589 transitions. Word has length 19 [2022-03-15 20:49:45,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:49:45,238 INFO L470 AbstractCegarLoop]: Abstraction has 587 states and 1589 transitions. [2022-03-15 20:49:45,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.090909090909091) internal successors, (115), 55 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:45,239 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1589 transitions. [2022-03-15 20:49:45,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:49:45,240 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:49:45,240 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:49:45,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 20:49:45,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 20:49:45,455 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:49:45,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:49:45,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1680698300, now seen corresponding path program 21 times [2022-03-15 20:49:45,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:49:45,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575456107] [2022-03-15 20:49:45,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:49:45,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:49:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:49:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:45,659 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:49:45,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575456107] [2022-03-15 20:49:45,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575456107] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:49:45,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193485758] [2022-03-15 20:49:45,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:49:45,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:49:45,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:49:45,660 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:49:45,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 20:49:45,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:49:45,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:49:45,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 20:49:45,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:49:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:46,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:49:47,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:49:47,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:49:47,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:49:47,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:49:47,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:49:47,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:49:47,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:49:47,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:49:47,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:49:47,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:49:47,325 INFO L353 Elim1Store]: treesize reduction 369, result has 6.1 percent of original size [2022-03-15 20:49:47,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 10 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 35 case distinctions, treesize of input 146 treesize of output 133 [2022-03-15 20:49:47,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-03-15 20:49:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:47,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193485758] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:49:47,379 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:49:47,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2022-03-15 20:49:47,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [448493197] [2022-03-15 20:49:47,379 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:49:47,381 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:49:47,390 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 129 transitions. [2022-03-15 20:49:47,390 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:15,589 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 49 new interpolants: [20858#(and (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) (< (+ i_AB 1) An) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ i_BA 4) Bn) (< (+ i_AB 1) Bn) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ i_BA 4) Bn) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ i_BA 4) An) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ i_BA 4) An) (< (+ i_AB 1) An) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) (< (+ i_AB 1) An) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 20879#(and (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 20897#(and (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= (+ 6 i_BA) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (<= (+ 6 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (<= (+ 6 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= (+ 6 i_BA) Bn) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 20850#(and (or (<= Bn i_AB) (<= An i_AB) break_AB (= (select A i_AB) (select B i_AB))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) An) break_AB) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) break_AB)), 20877#(and (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 5 i_BA) An) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= (+ 5 i_BA) An) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 5 i_BA) Bn)) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 5 i_BA) Bn))), 20891#(and (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB))))), 20894#(and (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 3 i_BA) An) (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (<= (+ 3 i_BA) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 3 i_BA) Bn)) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 3 i_BA) Bn) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB))))), 20867#(and (or (<= (+ 3 i_BA) An) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 3 i_BA) Bn)) (or (<= (+ 3 i_BA) An) (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 3 i_BA) Bn))), 20865#(and (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 20878#(and (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 5 i_BA) Bn)) (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 5 i_BA) Bn)) (or (< (+ i_AB 4) Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ 5 i_BA) An) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 5 i_BA) An) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 20855#(and (or (not break_AB) (<= (+ i_BA 4) An) break_BA) (or (< i_AB Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_BA) (or (not break_AB) (<= (+ i_BA 4) Bn) break_BA) (or (not break_AB) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_BA) (or (not break_AB) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_BA) (or (<= (+ i_BA 4) An) break_BA (< i_AB An)) (or (<= (+ i_BA 4) Bn) (< i_AB Bn) break_BA) (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_BA (< i_AB An)) (or (< i_AB Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_BA) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_BA (< i_AB An))), 20889#(and (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)) (<= (+ 5 i_BA) Bn)) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (<= (+ 5 i_BA) An) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (<= (+ 5 i_BA) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)) (<= (+ 5 i_BA) Bn)) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 20885#(and (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ 6 i_BA) An) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ 6 i_BA) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 6 i_BA) An) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (<= (+ 6 i_BA) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 20860#(and (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (< i_BA Bn) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< i_BA Bn) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1)) (< i_BA An)) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (< i_BA An))), 20851#(and (or (not break_AB) (< i_BA An)) (or (< i_AB Bn) (< i_BA Bn)) (or (not break_BA) (< i_AB An)) (or (< i_AB An) (< i_BA An)) (or (< i_AB Bn) (not break_BA)) (or (not break_AB) (not break_BA)) (or (not break_AB) (< i_BA Bn))), 20869#(and (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 20849#(and (not break_AB) (< i_AB Bn) (< i_AB An)), 20864#(and (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 20852#(and (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) break_AB (< i_BA Bn)) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) An) break_AB (not break_BA)) (or (<= Bn i_AB) (<= An i_AB) break_AB (not break_BA) (= (select A i_AB) (select B i_AB))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) An) break_AB (< i_BA An)) (or (<= Bn i_AB) (<= An i_AB) break_AB (= (select A i_AB) (select B i_AB)) (< i_BA Bn)) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) break_AB (not break_BA)) (or (<= Bn i_AB) (<= An i_AB) break_AB (= (select A i_AB) (select B i_AB)) (< i_BA An))), 20890#(and (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= (+ 6 i_BA) Bn) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= (+ 6 i_BA) Bn) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (<= (+ 6 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (<= (+ 6 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 20856#(and (or (not (< i_AB Bn)) (<= (+ 2 i_BA) Bn) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) (<= (+ 2 i_BA) Bn) break_AB (not (< i_AB An))) (or (<= Bn i_AB) (<= An i_AB) break_AB (= (select B i_BA) (select A i_BA)) (= (select A i_AB) (select B i_AB))) (or (not (< i_AB Bn)) (<= (+ 2 i_BA) An) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (not break_BA) (not (< i_AB An))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) An) break_AB (= (select B i_BA) (select A i_BA))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) break_AB (= (select B i_BA) (select A i_BA))) (or (not (< i_AB Bn)) break_AB (not break_BA) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (not break_BA) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 2 i_BA) An) (< (+ i_AB 1) An) break_AB (not (< i_AB An)))), 20868#(and (or (<= (+ i_BA 4) An) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ i_BA 4) Bn) (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ i_BA 4) Bn) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ i_BA 4) An) (<= Bn (+ 2 i_AB)) break_AB break_BA (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 20872#(and (or (< (+ i_AB 4) Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB break_BA (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ 3 i_BA) An) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 3 i_BA) Bn)) (or (< (+ i_AB 4) Bn) break_AB break_BA (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB break_BA (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 3 i_BA) Bn)) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 3 i_BA) An) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 20887#(and (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (<= (+ 3 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (<= (+ 3 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 3 i_BA) Bn) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 3 i_BA) Bn) (<= Bn (+ i_AB 4)))), 20854#(and (or (not break_AB) break_BA (= (select B i_BA) (select A i_BA))) (or break_BA (= (select B i_BA) (select A i_BA)) (< i_AB An)) (or (<= (+ 3 i_BA) An) (not break_AB) break_BA) (or (not break_AB) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_BA) (or (not break_AB) break_BA (<= (+ 3 i_BA) Bn)) (or (< i_AB Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_BA) (or (< i_AB Bn) break_BA (= (select B i_BA) (select A i_BA))) (or (<= (+ 3 i_BA) An) break_BA (< i_AB An)) (or (< i_AB Bn) break_BA (<= (+ 3 i_BA) Bn)) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_BA (< i_AB An))), 20886#(and (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (<= (+ 2 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (<= (+ 2 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 20866#(and (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 2 i_BA) An) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 2 i_BA) An) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 20871#(and (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ 2 i_BA) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (<= (+ 2 i_BA) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 2 i_BA) An) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ 2 i_BA) An) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 20892#(and (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB))) (< i_BA An)) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB))))), 20861#(and (or (< (+ 2 i_AB) Bn) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ 2 i_BA) An) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (<= (+ 2 i_BA) An) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 20881#(and (or (not break_AB) (= (select B i_BA) (select A i_BA))) (or (<= (+ 6 i_BA) An) (< i_AB An)) (or (< i_AB Bn) (= (select B i_BA) (select A i_BA))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (< i_AB Bn)) (or (< i_AB Bn) (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (or (not break_AB) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (or (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (< i_AB An)) (or (not break_AB) (<= (+ 6 i_BA) An)) (or (not break_AB) (<= (+ 6 i_BA) Bn)) (or (= (select B i_BA) (select A i_BA)) (< i_AB An)) (or (not break_AB) (= (select A (+ i_BA 4)) (select B (+ i_BA 4)))) (or (<= (+ 6 i_BA) Bn) (< i_AB Bn)) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (< i_AB An))), 20883#(and (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ 6 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ 6 i_BA) An) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (<= (+ 6 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ 6 i_BA) An) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 20896#(and (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= (+ 5 i_BA) An) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= (+ 5 i_BA) Bn)) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= (+ 5 i_BA) An) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB))) (<= (+ 5 i_BA) Bn))), 20857#(and (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) An) break_AB break_BA (= (select B i_BA) (select A i_BA))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB break_BA (<= (+ 3 i_BA) Bn) (not (< i_AB An))) (or (<= (+ 3 i_BA) An) (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB break_BA (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB break_BA (= (select A i_AB) (select B i_AB)) (<= (+ 3 i_BA) Bn) (not (< i_AB An))) (or (<= Bn i_AB) (<= An i_AB) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) (< (+ i_AB 1) An) break_AB break_BA) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA) (or (<= Bn i_AB) (<= An i_AB) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (= (select A i_AB) (select B i_AB))) (or (<= Bn i_AB) (<= An i_AB) (< (+ i_AB 1) Bn) break_AB break_BA (= (select B i_BA) (select A i_BA))) (or (<= Bn i_AB) (<= An i_AB) break_AB break_BA (= (select B i_BA) (select A i_BA)) (= (select A i_AB) (select B i_AB))) (or (<= (+ 3 i_BA) An) (not (< i_AB Bn)) break_AB break_BA (= (select A i_AB) (select B i_AB)) (not (< i_AB An)))), 20870#(and (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 20888#(and (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (<= (+ i_BA 4) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (<= (+ i_BA 4) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (<= (+ i_BA 4) Bn) (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (<= (+ i_BA 4) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 20853#(and (or (<= (+ 2 i_BA) An) (< i_AB An)) (or (not break_AB) (= (select B i_BA) (select A i_BA))) (or (not break_AB) (<= (+ 2 i_BA) Bn)) (or (< i_AB Bn) (= (select B i_BA) (select A i_BA))) (or (not break_BA) (< i_AB An)) (or (< i_AB Bn) (<= (+ 2 i_BA) Bn)) (or (= (select B i_BA) (select A i_BA)) (< i_AB An)) (or (< i_AB Bn) (not break_BA)) (or (not break_AB) (not break_BA)) (or (not break_AB) (<= (+ 2 i_BA) An))), 20876#(and (or (<= (+ 5 i_BA) An) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (<= (+ 5 i_BA) Bn)) (or (<= (+ 5 i_BA) An) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (<= (+ 5 i_BA) Bn))), 20884#(and (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 6 i_BA) Bn) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 6 i_BA) An) (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= (+ 6 i_BA) Bn) (<= Bn (+ 2 i_AB)) break_AB (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ 6 i_BA) An) (<= Bn (+ 2 i_AB)) break_AB (< (+ 3 i_AB) An) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_AB) Bn) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))) (<= Bn (+ 2 i_AB)) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 20882#(and (or (not (< i_AB Bn)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (< (+ i_AB 1) An) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (< (+ i_AB 1) Bn) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 6 i_BA) An) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (= (select B i_BA) (select A i_BA)) (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 6 i_BA) An) (< (+ i_AB 1) An) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (= (select A (+ i_BA 4)) (select B (+ i_BA 4))) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 6 i_BA) Bn) (< (+ i_AB 1) Bn) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select B i_BA) (select A i_BA)) (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 6 i_BA) Bn) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) An) break_AB (= (select B i_BA) (select A i_BA)) (not (< i_AB An)))), 20893#(and (or (<= Bn (+ 5 i_AB)) (<= (+ 2 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) (<= (+ 2 i_BA) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (<= (+ 2 i_BA) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 20873#(and (or (< (+ i_AB 4) Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ i_BA 4) An) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ i_BA 4) An) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_AB 4) An) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (<= (+ i_BA 4) Bn) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_AB 4) Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB))) (<= (+ i_BA 4) Bn) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 20880#(and (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An) (<= Bn (+ i_AB 4))) (or (< (+ 5 i_AB) Bn) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (= (select A (+ i_AB 4)) (select B (+ i_AB 4))) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An) (<= Bn (+ i_AB 4))) (or (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (<= An (+ i_AB 4)) (< (+ 5 i_AB) An) break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (<= Bn (+ i_AB 4)))), 20859#(and (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)))), 20895#(and (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (<= (+ i_BA 4) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ i_BA 4) Bn) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (<= Bn (+ 5 i_AB)) (<= (+ i_BA 4) An) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (= (select A (+ 5 i_AB)) (select B (+ 5 i_AB)))) (or (< (+ 6 i_AB) An) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= (+ i_BA 4) Bn) (<= Bn (+ 5 i_AB)) (not (= (select B (+ 3 i_AB)) (select A (+ 3 i_AB)))) (< (+ 6 i_AB) Bn) (not (= (select A (+ i_AB 4)) (select B (+ i_AB 4)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 5 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 20862#(and (or (<= (+ 3 i_BA) An) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ 3 i_BA) An) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (<= (+ 3 i_BA) Bn)) (or break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (<= (+ 3 i_BA) Bn))), 20875#(and (or (not (< i_AB Bn)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (< (+ i_AB 1) An) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 5 i_BA) An) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (<= (+ 5 i_BA) An) (< (+ i_AB 1) An) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) break_AB (= (select A i_AB) (select B i_AB)) (<= (+ 5 i_BA) Bn) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (= (select A i_AB) (select B i_AB)) (not (< i_AB An))) (or (not (< i_AB Bn)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (< (+ i_AB 1) Bn) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) (< (+ i_AB 1) An) break_AB (not (< i_AB An))) (or (not (< i_AB Bn)) (< (+ i_AB 1) Bn) break_AB (<= (+ 5 i_BA) Bn) (not (< i_AB An)))), 20863#(and (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ i_BA 4) An) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ i_BA 4) Bn) (< (+ 2 i_AB) Bn) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ i_BA 4) Bn) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ 2 i_AB) Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (<= (+ i_BA 4) An) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1))) (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (= (select A (+ i_AB 1)) (select B (+ i_AB 1))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ 2 i_AB) An) (<= An (+ i_AB 1)))), 20874#(and (or (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) (< i_AB An)) (or (not break_AB) (<= (+ 5 i_BA) An)) (or (<= (+ 5 i_BA) An) (< i_AB An)) (or (< i_AB Bn) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (< i_AB Bn)) (or (not break_AB) (<= (+ 5 i_BA) Bn)) (or (not break_AB) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA)))) (or (< i_AB Bn) (<= (+ 5 i_BA) Bn)) (or (not break_AB) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (or (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (< i_AB An)))] [2022-03-15 20:50:15,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 20:50:15,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:15,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 20:50:15,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=690, Invalid=6620, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 20:50:15,591 INFO L87 Difference]: Start difference. First operand 587 states and 1589 transitions. Second operand has 63 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:53:33,289 INFO L93 Difference]: Finished difference Result 1245 states and 3263 transitions. [2022-03-15 20:53:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2022-03-15 20:53:33,289 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 20:53:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:53:33,293 INFO L225 Difference]: With dead ends: 1245 [2022-03-15 20:53:33,293 INFO L226 Difference]: Without dead ends: 1243 [2022-03-15 20:53:33,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32175 ImplicationChecksByTransitivity, 202.3s TimeCoverageRelationStatistics Valid=11573, Invalid=81147, Unknown=0, NotChecked=0, Total=92720 [2022-03-15 20:53:33,298 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 694 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 569 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 569 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:53:33,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [694 Valid, 1 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [569 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 20:53:33,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2022-03-15 20:53:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 711. [2022-03-15 20:53:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 710 states have (on average 2.871830985915493) internal successors, (2039), 710 states have internal predecessors, (2039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 2039 transitions. [2022-03-15 20:53:33,311 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 2039 transitions. Word has length 19 [2022-03-15 20:53:33,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:53:33,311 INFO L470 AbstractCegarLoop]: Abstraction has 711 states and 2039 transitions. [2022-03-15 20:53:33,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 2039 transitions. [2022-03-15 20:53:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:53:33,314 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:53:33,314 INFO L514 BasicCegarLoop]: trace histogram [7, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:53:33,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 20:53:33,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:33,523 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:53:33,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:53:33,524 INFO L85 PathProgramCache]: Analyzing trace with hash 643101207, now seen corresponding path program 22 times [2022-03-15 20:53:33,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:53:33,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033488005] [2022-03-15 20:53:33,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:33,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:53:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:33,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:53:33,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033488005] [2022-03-15 20:53:33,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033488005] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:53:33,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140465519] [2022-03-15 20:53:33,706 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:53:33,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:33,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:53:33,707 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:53:33,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 20:53:33,730 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:53:33,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:53:33,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 20:53:33,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:53:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:53:34,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:53:35,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:35,079 INFO L353 Elim1Store]: treesize reduction 240, result has 10.8 percent of original size [2022-03-15 20:53:35,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 21 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 24 case distinctions, treesize of input 146 treesize of output 138 [2022-03-15 20:53:35,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-03-15 20:53:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:35,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140465519] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:53:35,155 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:53:35,155 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 33 [2022-03-15 20:53:35,155 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1555840033] [2022-03-15 20:53:35,155 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:53:35,156 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:53:35,166 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 125 transitions. [2022-03-15 20:53:35,166 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:53:44,836 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [24150#(and (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 2 An) i_AB) (not (< (+ i_BA 1) An)) (not (< (+ i_BA 1) Bn)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= (+ 2 Bn) i_AB)) (or (not (= (select B i_BA) (select A i_BA))) (not (< (+ i_BA 1) An)) (not (< (+ i_BA 1) Bn)) break_AB break_BA (< (+ 2 i_BA) Bn) (<= (+ 2 Bn) i_AB)) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 2 An) i_AB) (not (< (+ i_BA 1) An)) (not (< (+ i_BA 1) Bn)) break_AB break_BA (< (+ 2 i_BA) An))), 24167#(and (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 2 An) i_AB) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= An (+ 2 i_BA)) (< (+ 3 i_BA) An)) (or (< (+ 3 i_BA) Bn) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= (+ 2 Bn) i_AB) (<= An (+ 2 i_BA))) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 2 An) i_AB) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (<= (+ 2 Bn) i_AB) (<= An (+ 2 i_BA)))), 24145#(and (not break_BA) (< i_BA Bn) (< i_BA An)), 24157#(and (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< i_BA Bn) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (not break_BA) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or break_AB (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1)) (< i_BA An))), 24176#(and (or (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn i_AB) (<= An i_AB) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA))) (or (< (+ i_BA 4) Bn) (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn i_AB) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA))) (or (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= An i_AB) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA)) (< (+ i_BA 4) An))), 24177#(and (or (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ 3 i_BA)) (< (+ i_BA 4) An) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ 3 i_BA)) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (< (+ i_BA 4) Bn) (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ 3 i_BA)) (<= Bn (+ i_AB 1)))), 24148#(and (or (<= (+ 2 An) i_AB) break_AB (<= (+ 2 Bn) i_AB) (< i_BA Bn)) (or (<= (+ 2 An) i_AB) break_AB (not break_BA) (<= (+ 2 Bn) i_AB)) (or (<= (+ 2 An) i_AB) break_AB (<= (+ 2 Bn) i_AB) (< i_BA An))), 24179#(and (or (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (< (+ i_BA 4) An)) (or (< (+ i_BA 4) Bn) (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))))) (or (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)))), 24149#(and (or (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (<= (+ 2 Bn) i_AB) (< (+ i_BA 1) Bn)) (or (<= (+ 2 An) i_AB) (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (<= (+ 2 Bn) i_AB)) (or (<= (+ 2 An) i_AB) (not (< i_BA Bn)) (< (+ i_BA 1) An) (not (< i_BA An)) break_AB break_BA)), 24173#(and (or (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA))) (or (< (+ i_BA 4) Bn) (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA))) (or (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA)) (< (+ i_BA 4) An))), 24151#(and (or (<= (+ An 1) i_AB) break_AB (<= (+ Bn 1) i_AB) (< i_BA Bn)) (or (<= (+ An 1) i_AB) break_AB (<= (+ Bn 1) i_AB) (not break_BA)) (or (<= (+ An 1) i_AB) break_AB (<= (+ Bn 1) i_AB) (< i_BA An))), 24175#(and (or (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= (+ An 1) i_AB) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA)) (< (+ i_BA 4) An)) (or (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= (+ An 1) i_AB) break_AB break_BA (<= (+ Bn 1) i_AB) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA))) (or (< (+ i_BA 4) Bn) (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= (+ Bn 1) i_AB) (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA)))), 24156#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= Bn i_AB) break_AB break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) Bn)) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= Bn i_AB) (<= An i_AB) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= An i_AB) break_AB break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) An))), 24154#(and (or (<= Bn i_AB) (<= An i_AB) break_AB (not break_BA)) (or (<= Bn i_AB) (<= An i_AB) break_AB (< i_BA An)) (or (<= Bn i_AB) (<= An i_AB) break_AB (< i_BA Bn))), 24170#(and (or (< (+ 3 i_BA) Bn) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_BA)) (<= Bn (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_BA)) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ 2 i_BA)) (< (+ 3 i_BA) An) (<= An (+ i_AB 1)))), 24147#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) An)) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_BA (<= An (+ i_BA 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) Bn))), 24166#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_BA (<= An (+ 2 i_BA))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (<= An (+ 2 i_BA)) (< (+ 3 i_BA) An)) (or (< (+ 3 i_BA) Bn) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_BA (<= An (+ 2 i_BA)))), 24153#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_AB break_BA (<= (+ Bn 1) i_AB) (<= An (+ i_BA 1)) (< (+ 2 i_BA) Bn)) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= (+ An 1) i_AB) break_AB break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) An)) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= (+ An 1) i_AB) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= (+ Bn 1) i_AB) (<= An (+ i_BA 1)))), 24159#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_AB break_BA (<= An (+ i_BA 1)) (not (= (select A i_AB) (select B i_AB))) (< (+ 2 i_BA) An) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= An (+ i_BA 1)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_AB break_BA (<= An (+ i_BA 1)) (not (= (select A i_AB) (select B i_AB))) (< (+ 2 i_BA) Bn) (<= Bn (+ i_AB 1)))), 24171#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (<= An (+ 2 i_AB)) (<= An (+ 2 i_BA)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= An (+ 2 i_AB)) (<= An (+ 2 i_BA)) (< (+ 3 i_BA) An) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ 3 i_BA) Bn) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB break_BA (<= An (+ 2 i_BA)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 24158#(and (or (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (<= An (+ i_AB 1))) (or (not (< i_BA Bn)) (< (+ i_BA 1) An) (not (< i_BA An)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= An (+ i_AB 1))) (or (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (not (= (select A i_AB) (select B i_AB))) (<= Bn (+ i_AB 1)) (< (+ i_BA 1) Bn))), 24162#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= Bn (+ 2 i_AB)) break_AB break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_AB break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) An) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (<= Bn (+ 2 i_AB)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= An (+ i_BA 1)) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 24168#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= (+ An 1) i_AB) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (<= (+ Bn 1) i_AB) (<= An (+ 2 i_BA))) (or (< (+ 3 i_BA) Bn) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= (+ Bn 1) i_AB) (<= An (+ 2 i_BA))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= (+ An 1) i_AB) break_AB break_BA (<= An (+ 2 i_BA)) (< (+ 3 i_BA) An))), 24146#(and (or (<= Bn i_BA) (<= An i_BA) break_BA (= (select B i_BA) (select A i_BA))) (or (<= Bn i_BA) (<= An i_BA) break_BA (< (+ i_BA 1) Bn)) (or (< (+ i_BA 1) An) (<= Bn i_BA) (<= An i_BA) break_BA)), 24160#(and (or (<= Bn (+ 2 i_AB)) break_AB (<= An (+ 2 i_AB)) (< i_BA Bn) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (<= Bn (+ 2 i_AB)) break_AB (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< i_BA An)) (or (<= Bn (+ 2 i_AB)) break_AB (<= An (+ 2 i_AB)) (not break_BA) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 24152#(and (or (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (<= (+ Bn 1) i_AB) (< (+ i_BA 1) Bn)) (or (not (< i_BA Bn)) (<= (+ An 1) i_AB) (not (< i_BA An)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (<= (+ Bn 1) i_AB)) (or (not (< i_BA Bn)) (< (+ i_BA 1) An) (<= (+ An 1) i_AB) (not (< i_BA An)) break_AB break_BA)), 24155#(and (or (not (< i_BA Bn)) (<= Bn i_AB) (<= An i_AB) (not (< i_BA An)) break_AB break_BA (= (select B i_BA) (select A i_BA))) (or (not (< i_BA Bn)) (<= Bn i_AB) (not (< i_BA An)) break_AB break_BA (< (+ i_BA 1) Bn)) (or (not (< i_BA Bn)) (< (+ i_BA 1) An) (<= An i_AB) (not (< i_BA An)) break_AB break_BA)), 24178#(and (or (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= An (+ 2 i_AB)) (<= Bn (+ 3 i_BA)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< (+ i_BA 4) An)) (or (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= An (+ 2 i_AB)) (<= Bn (+ 3 i_BA)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (< (+ i_BA 4) Bn) (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn (+ 2 i_AB)) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))))), 24161#(and (or (not (< i_BA Bn)) (<= Bn (+ 2 i_AB)) (not (< i_BA An)) break_AB break_BA (= (select B i_BA) (select A i_BA)) (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (< i_BA Bn)) (< (+ i_BA 1) An) (not (< i_BA An)) break_AB break_BA (<= An (+ 2 i_AB)) (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1))))) (or (not (< i_BA Bn)) (<= Bn (+ 2 i_AB)) (not (< i_BA An)) break_AB break_BA (not (= (select A (+ i_AB 1)) (select B (+ i_AB 1)))) (< (+ i_BA 1) Bn))), 24172#(and (or (< (+ 3 i_BA) Bn) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= Bn (+ 3 i_AB)) (<= An (+ 2 i_BA)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB))))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (<= Bn (+ 3 i_AB)) (<= An (+ 2 i_BA)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (<= An (+ 2 i_BA)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (< (+ 3 i_BA) An))), 24163#(and (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (< i_BA Bn)) (or break_AB (<= Bn (+ 3 i_AB)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)) (< i_BA An)) (or break_AB (<= Bn (+ 3 i_AB)) (not break_BA) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)))), 24165#(and (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) (= (select B (+ i_BA 1)) (select A (+ i_BA 1))) break_AB break_BA (<= Bn (+ 3 i_AB)) (<= An (+ i_BA 1)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_AB break_BA (<= An (+ i_BA 1)) (< (+ 2 i_BA) An) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ i_BA 1)) break_AB break_BA (<= Bn (+ 3 i_AB)) (<= An (+ i_BA 1)) (< (+ 2 i_BA) Bn) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))))), 24174#(and (or (< (+ i_BA 4) Bn) (not (= (select B i_BA) (select A i_BA))) (<= An (+ 3 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA)) (<= (+ 2 Bn) i_AB)) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 2 An) i_AB) (<= An (+ 3 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA)) (< (+ i_BA 4) An)) (or (not (= (select B i_BA) (select A i_BA))) (<= (+ 2 An) i_AB) (<= An (+ 3 i_BA)) (= (select B (+ 3 i_BA)) (select A (+ 3 i_BA))) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) break_AB break_BA (not (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA)))) (<= Bn (+ 3 i_BA)) (<= (+ 2 Bn) i_AB))), 24164#(and (or (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (<= Bn (+ 3 i_AB)) (= (select B i_BA) (select A i_BA)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB))) (or (not (< i_BA Bn)) (not (< i_BA An)) break_AB break_BA (<= Bn (+ 3 i_AB)) (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (< (+ i_BA 1) Bn)) (or (not (< i_BA Bn)) (< (+ i_BA 1) An) (not (< i_BA An)) break_AB break_BA (not (= (select B (+ 2 i_AB)) (select A (+ 2 i_AB)))) (<= An (+ 3 i_AB)))), 24169#(and (or (< (+ 3 i_BA) Bn) (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn i_AB) break_AB break_BA (<= An (+ 2 i_BA))) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= An i_AB) break_AB break_BA (<= An (+ 2 i_BA)) (< (+ 3 i_BA) An)) (or (not (= (select B i_BA) (select A i_BA))) (<= Bn (+ 2 i_BA)) (not (= (select B (+ i_BA 1)) (select A (+ i_BA 1)))) (<= Bn i_AB) (<= An i_AB) (= (select A (+ 2 i_BA)) (select B (+ 2 i_BA))) break_AB break_BA (<= An (+ 2 i_BA))))] [2022-03-15 20:53:44,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-15 20:53:44,837 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:53:44,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-15 20:53:44,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=4181, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 20:53:44,838 INFO L87 Difference]: Start difference. First operand 711 states and 2039 transitions. Second operand has 49 states, 49 states have (on average 2.163265306122449) internal successors, (106), 48 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:51,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:53:51,129 INFO L93 Difference]: Finished difference Result 1120 states and 2884 transitions. [2022-03-15 20:53:51,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 20:53:51,129 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.163265306122449) internal successors, (106), 48 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 20:53:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:53:51,133 INFO L225 Difference]: With dead ends: 1120 [2022-03-15 20:53:51,133 INFO L226 Difference]: Without dead ends: 1072 [2022-03-15 20:53:51,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3189 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2160, Invalid=10722, Unknown=0, NotChecked=0, Total=12882 [2022-03-15 20:53:51,134 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 192 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:53:51,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 1 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:53:51,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2022-03-15 20:53:51,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 713. [2022-03-15 20:53:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 712 states have (on average 2.7387640449438204) internal successors, (1950), 712 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1950 transitions. [2022-03-15 20:53:51,144 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1950 transitions. Word has length 19 [2022-03-15 20:53:51,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:53:51,144 INFO L470 AbstractCegarLoop]: Abstraction has 713 states and 1950 transitions. [2022-03-15 20:53:51,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.163265306122449) internal successors, (106), 48 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:51,145 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1950 transitions. [2022-03-15 20:53:51,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:53:51,146 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:53:51,146 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:53:51,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-03-15 20:53:51,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:51,359 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:53:51,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:53:51,360 INFO L85 PathProgramCache]: Analyzing trace with hash -561650614, now seen corresponding path program 23 times [2022-03-15 20:53:51,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:53:51,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520159423] [2022-03-15 20:53:51,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:51,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:53:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:51,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:53:51,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520159423] [2022-03-15 20:53:51,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520159423] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:53:51,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215765079] [2022-03-15 20:53:51,646 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:53:51,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:51,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:53:51,648 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:53:51,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 20:53:51,674 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:53:51,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:53:51,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:53:51,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:53:52,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 93 [2022-03-15 20:53:52,635 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2022-03-15 20:53:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:52,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:53:54,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,459 INFO L353 Elim1Store]: treesize reduction 475, result has 18.0 percent of original size [2022-03-15 20:53:54,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 15 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 51 case distinctions, treesize of input 291 treesize of output 334 [2022-03-15 20:53:54,468 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,493 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,495 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:53:54,600 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:53:54,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 36 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 30 case distinctions, treesize of input 291 treesize of output 571 [2022-03-15 20:53:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:56,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215765079] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:53:56,099 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:53:56,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 36 [2022-03-15 20:53:56,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1238328125] [2022-03-15 20:53:56,099 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:53:56,101 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:53:56,113 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 146 transitions. [2022-03-15 20:53:56,113 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider Received shutdown request... [2022-03-15 20:53:57,239 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 20:53:57,240 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2022-03-15 20:53:57,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 20:53:57,274 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 20:53:57,287 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 20:53:57,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 20:53:57,441 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 6,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 0ms.. [2022-03-15 20:53:57,442 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 20:53:57,442 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 20:53:57,444 INFO L732 BasicCegarLoop]: Path program histogram: [23, 1, 1, 1] [2022-03-15 20:53:57,445 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:53:57,445 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:53:57,446 INFO L202 PluginConnector]: Adding new model array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:53:57 BasicIcfg [2022-03-15 20:53:57,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:53:57,446 INFO L158 Benchmark]: Toolchain (without parser) took 737329.42ms. Allocated memory was 187.7MB in the beginning and 549.5MB in the end (delta: 361.8MB). Free memory was 146.8MB in the beginning and 305.1MB in the end (delta: -158.3MB). Peak memory consumption was 205.0MB. Max. memory is 8.0GB. [2022-03-15 20:53:57,446 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:53:57,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.90ms. Allocated memory is still 187.7MB. Free memory was 146.7MB in the beginning and 145.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:53:57,447 INFO L158 Benchmark]: Boogie Preprocessor took 13.30ms. Allocated memory is still 187.7MB. Free memory was 145.1MB in the beginning and 144.2MB in the end (delta: 942.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:53:57,447 INFO L158 Benchmark]: RCFGBuilder took 179.97ms. Allocated memory is still 187.7MB. Free memory was 144.1MB in the beginning and 134.9MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 20:53:57,447 INFO L158 Benchmark]: TraceAbstraction took 737109.53ms. Allocated memory was 187.7MB in the beginning and 549.5MB in the end (delta: 361.8MB). Free memory was 134.3MB in the beginning and 305.1MB in the end (delta: -170.8MB). Peak memory consumption was 192.4MB. Max. memory is 8.0GB. [2022-03-15 20:53:57,447 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.90ms. Allocated memory is still 187.7MB. Free memory was 146.7MB in the beginning and 145.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.30ms. Allocated memory is still 187.7MB. Free memory was 145.1MB in the beginning and 144.2MB in the end (delta: 942.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 179.97ms. Allocated memory is still 187.7MB. Free memory was 144.1MB in the beginning and 134.9MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 737109.53ms. Allocated memory was 187.7MB in the beginning and 549.5MB in the end (delta: 361.8MB). Free memory was 134.3MB in the beginning and 305.1MB in the end (delta: -170.8MB). Peak memory consumption was 192.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 28 PlacesBefore, 18 PlacesAfterwards, 25 TransitionsBefore, 13 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 2 ChoiceCompositions, 15 TotalNumberOfCompositions, 98 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 98, positive: 98, positive conditional: 0, positive unconditional: 98, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 59, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 98, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 59, unknown conditional: 0, unknown unconditional: 59] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 6,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 0ms.. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 6,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 0ms.. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 6,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 36 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 737.0s, OverallIterations: 26, TraceHistogramMax: 7, PathProgramHistogramMax: 23, EmptinessCheckTime: 0.0s, AutomataDifference: 539.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5387 SdHoareTripleChecker+Valid, 15.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5387 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 13.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5208 mSDsCounter, 3770 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23453 IncrementalHoareTripleChecker+Invalid, 27223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3770 mSolverCounterUnsat, 25 mSDtfsCounter, 23453 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2662 GetRequests, 455 SyntacticMatches, 83 SemanticMatches, 2124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105221 ImplicationChecksByTransitivity, 569.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=713occurred in iteration=25, InterpolantAutomatonStates: 1368, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 3745 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 32.4s InterpolantComputationTime, 697 NumberOfCodeBlocks, 697 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 966 ConstructedInterpolants, 0 QuantifiedInterpolants, 36625 SizeOfPredicates, 265 NumberOfNonLiveVariables, 685 ConjunctsInSsa, 293 ConjunctsInUnsatCore, 71 InterpolantComputations, 2 PerfectInterpolantSequences, 284/1219 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown