/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/popl20-more/max-array-hom.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:01:53,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:01:53,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:01:54,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:01:54,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:01:54,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:01:54,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:01:54,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:01:54,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:01:54,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:01:54,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:01:54,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:01:54,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:01:54,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:01:54,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:01:54,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:01:54,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:01:54,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:01:54,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:01:54,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:01:54,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:01:54,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:01:54,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:01:54,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:01:54,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:01:54,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:01:54,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:01:54,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:01:54,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:01:54,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:01:54,067 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:01:54,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:01:54,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:01:54,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:01:54,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:01:54,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:01:54,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:01:54,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:01:54,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:01:54,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:01:54,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:01:54,073 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 22:01:54,099 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:01:54,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:01:54,100 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:01:54,100 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:01:54,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:01:54,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:01:54,101 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:01:54,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:01:54,101 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:01:54,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:01:54,102 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:01:54,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:01:54,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:01:54,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:01:54,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:01:54,102 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:01:54,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:01:54,102 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:01:54,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:01:54,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:01:54,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:01:54,103 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:01:54,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:01:54,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:01:54,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:01:54,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:01:54,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:01:54,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:01:54,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:01:54,104 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:01:54,104 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:01:54,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:01:54,104 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 22:01:54,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:01:54,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:01:54,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:01:54,323 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:01:54,324 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:01:54,325 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-array-hom.wvr.bpl [2022-03-15 22:01:54,325 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-array-hom.wvr.bpl' [2022-03-15 22:01:54,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:01:54,345 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:01:54,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:01:54,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:01:54,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:01:54,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:54" (1/1) ... [2022-03-15 22:01:54,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:54" (1/1) ... [2022-03-15 22:01:54,367 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:01:54,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:01:54,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:01:54,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:01:54,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:01:54,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:54" (1/1) ... [2022-03-15 22:01:54,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:54" (1/1) ... [2022-03-15 22:01:54,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:54" (1/1) ... [2022-03-15 22:01:54,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:54" (1/1) ... [2022-03-15 22:01:54,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:54" (1/1) ... [2022-03-15 22:01:54,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:54" (1/1) ... [2022-03-15 22:01:54,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:54" (1/1) ... [2022-03-15 22:01:54,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:01:54,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:01:54,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:01:54,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:01:54,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:54" (1/1) ... [2022-03-15 22:01:54,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:01:54,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:54,418 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 22:01:54,423 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 22:01:54,448 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:01:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:01:54,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:01:54,448 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:01:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:01:54,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:01:54,448 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:01:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:01:54,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:01:54,449 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 22:01:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 22:01:54,449 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 22:01:54,449 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 22:01:54,484 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:01:54,485 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:01:54,602 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:01:54,651 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:01:54,651 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:01:54,653 INFO L202 PluginConnector]: Adding new model max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:01:54 BoogieIcfgContainer [2022-03-15 22:01:54,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:01:54,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:01:54,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:01:54,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:01:54,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:54" (1/2) ... [2022-03-15 22:01:54,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281d5b54 and model type max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:01:54, skipping insertion in model container [2022-03-15 22:01:54,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:01:54" (2/2) ... [2022-03-15 22:01:54,671 INFO L111 eAbstractionObserver]: Analyzing ICFG max-array-hom.wvr.bpl [2022-03-15 22:01:54,674 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:01:54,675 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:01:54,675 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:01:54,675 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:01:54,714 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 22:01:54,765 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:01:54,771 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 22:01:54,772 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 22:01:54,786 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:01:54,802 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:01:54,805 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:01:54,806 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 82 flow [2022-03-15 22:01:54,831 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2022-03-15 22:01:54,831 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 22:01:54,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2022-03-15 22:01:54,840 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 22:01:55,137 INFO L131 LiptonReduction]: Checked pairs total: 116 [2022-03-15 22:01:55,138 INFO L133 LiptonReduction]: Total number of compositions: 12 [2022-03-15 22:01:55,143 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 22:01:55,161 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 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 22:01:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 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 22:01:55,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:01:55,166 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:55,166 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:55,167 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:01:55,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:55,170 INFO L85 PathProgramCache]: Analyzing trace with hash -580571257, now seen corresponding path program 1 times [2022-03-15 22:01:55,191 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:55,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6090390] [2022-03-15 22:01:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:55,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:55,338 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 22:01:55,339 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:55,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6090390] [2022-03-15 22:01:55,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6090390] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:01:55,340 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:01:55,340 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 22:01:55,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [407451680] [2022-03-15 22:01:55,342 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:55,344 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:55,355 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 22:01:55,356 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:55,657 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:01:55,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:01:55,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:55,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:01:55,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:01:55,679 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 22:01:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:55,713 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 22:01:55,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:01:55,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 22:01:55,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:55,723 INFO L225 Difference]: With dead ends: 45 [2022-03-15 22:01:55,723 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 22:01:55,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 22:01:55,737 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:55,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:01:55,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 22:01:55,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 22:01:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.7) internal successors, (108), 40 states have internal predecessors, (108), 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 22:01:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 22:01:55,764 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 22:01:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:55,764 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 22:01:55,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 22:01:55,765 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 22:01:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:01:55,765 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:55,765 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:55,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:01:55,766 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:01:55,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:55,767 INFO L85 PathProgramCache]: Analyzing trace with hash -817689900, now seen corresponding path program 1 times [2022-03-15 22:01:55,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:55,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397763437] [2022-03-15 22:01:55,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:55,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:55,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:01:55,799 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:55,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397763437] [2022-03-15 22:01:55,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397763437] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:01:55,803 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:01:55,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:01:55,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1793732012] [2022-03-15 22:01:55,804 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:55,805 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:55,809 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:01:55,810 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:55,955 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [220#(< i N)] [2022-03-15 22:01:55,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 22:01:55,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:55,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 22:01:55,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:01:55,967 INFO L87 Difference]: Start difference. First operand 41 states and 108 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 22:01:55,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:55,993 INFO L93 Difference]: Finished difference Result 37 states and 98 transitions. [2022-03-15 22:01:55,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:01:55,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 22:01:55,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:55,995 INFO L225 Difference]: With dead ends: 37 [2022-03-15 22:01:55,995 INFO L226 Difference]: Without dead ends: 37 [2022-03-15 22:01:55,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:01:55,997 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:55,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:01:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-03-15 22:01:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-03-15 22:01:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 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 22:01:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-03-15 22:01:56,009 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 80 transitions. Word has length 12 [2022-03-15 22:01:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:56,010 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 80 transitions. [2022-03-15 22:01:56,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 22:01:56,010 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 80 transitions. [2022-03-15 22:01:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:01:56,013 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:56,013 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:56,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:01:56,018 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:01:56,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:56,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1068507127, now seen corresponding path program 1 times [2022-03-15 22:01:56,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:56,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19556881] [2022-03-15 22:01:56,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:56,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:01:56,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:56,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19556881] [2022-03-15 22:01:56,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19556881] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:01:56,041 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:01:56,041 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:01:56,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1415765244] [2022-03-15 22:01:56,041 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:56,042 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:56,044 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:01:56,044 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:56,201 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:01:56,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:01:56,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:56,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:01:56,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:01:56,202 INFO L87 Difference]: Start difference. First operand 31 states and 80 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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 22:01:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:56,229 INFO L93 Difference]: Finished difference Result 40 states and 106 transitions. [2022-03-15 22:01:56,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:01:56,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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 12 [2022-03-15 22:01:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:56,230 INFO L225 Difference]: With dead ends: 40 [2022-03-15 22:01:56,230 INFO L226 Difference]: Without dead ends: 40 [2022-03-15 22:01:56,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 8 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 22:01:56,231 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:56,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:01:56,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-15 22:01:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-03-15 22:01:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 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 22:01:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 106 transitions. [2022-03-15 22:01:56,235 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 106 transitions. Word has length 12 [2022-03-15 22:01:56,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:56,235 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 106 transitions. [2022-03-15 22:01:56,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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 22:01:56,236 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 106 transitions. [2022-03-15 22:01:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:01:56,236 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:56,236 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:56,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 22:01:56,236 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:01:56,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:56,237 INFO L85 PathProgramCache]: Analyzing trace with hash 282949368, now seen corresponding path program 1 times [2022-03-15 22:01:56,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:56,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674437478] [2022-03-15 22:01:56,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:56,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:56,429 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 22:01:56,430 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:56,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674437478] [2022-03-15 22:01:56,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674437478] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:56,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943581031] [2022-03-15 22:01:56,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:56,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:56,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:56,447 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 22:01:56,475 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 22:01:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:56,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 22:01:56,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:56,705 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 33 [2022-03-15 22:01:56,793 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 22:01:56,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:56,945 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:56,946 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 73 treesize of output 67 [2022-03-15 22:01:57,217 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 22:01:57,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943581031] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:57,218 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:57,218 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-03-15 22:01:57,218 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [166926148] [2022-03-15 22:01:57,218 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:57,219 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:57,222 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 22:01:57,222 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:59,129 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [529#(and (or (< max3 (select A k)) (<= 1 max3) (= max2 max1)) (or (< max3 (select A k)) (= max3 max1)) (or (= max2 0) (= max2 max1)) (or (= max1 (select A k)) (not (< max3 (select A k)))) (or (<= 1 (select A k)) (<= (select A k) max3) (= max2 max1))), 528#(and (or (< j M) (<= 1 max3) (= max2 max1)) (or (= max2 0) (< j M) (= max2 max1)) (or (< j M) (= max3 max1))), 530#(and (or (<= 1 (select A k)) (< j M) (<= (select A k) max3) (= max2 max1)) (or (< j M) (< max3 (select A k)) (= max3 max1)) (or (= max2 0) (< j M) (= max2 max1)) (or (= max1 (select A k)) (< j M) (not (< max3 (select A k)))) (or (< j M) (< max3 (select A k)) (<= 1 max3) (= max2 max1))), 532#(and (or (< j M) (= k i)) (or (< j M) (= max2 max1)) (or (<= 0 max3) (< j M)) (or (< j M) (= k 0)) (or (< j M) (= max3 max1)) (or (< j M) (<= max3 0))), 531#(and (or (< j M) (= max2 max1)) (or (< j M) (= max3 max1) (<= 1 (select A i))) (or (< j M) (= max1 0)) (or (< j M) (<= (select A i) 0) (= (select A i) max3)))] [2022-03-15 22:01:59,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:01:59,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:59,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:01:59,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-03-15 22:01:59,131 INFO L87 Difference]: Start difference. First operand 40 states and 106 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 22:01:59,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:59,371 INFO L93 Difference]: Finished difference Result 76 states and 207 transitions. [2022-03-15 22:01:59,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:01:59,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 22:01:59,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:59,372 INFO L225 Difference]: With dead ends: 76 [2022-03-15 22:01:59,372 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 22:01:59,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:01:59,373 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:59,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:01:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 22:01:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-03-15 22:01:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 2.8656716417910446) internal successors, (192), 67 states have internal predecessors, (192), 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 22:01:59,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 192 transitions. [2022-03-15 22:01:59,378 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 192 transitions. Word has length 13 [2022-03-15 22:01:59,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:59,378 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 192 transitions. [2022-03-15 22:01:59,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 22:01:59,379 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 192 transitions. [2022-03-15 22:01:59,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:01:59,379 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:59,379 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:59,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 22:01:59,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:59,596 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:01:59,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:59,596 INFO L85 PathProgramCache]: Analyzing trace with hash 134365460, now seen corresponding path program 2 times [2022-03-15 22:01:59,598 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:59,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829568127] [2022-03-15 22:01:59,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:59,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:59,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:59,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829568127] [2022-03-15 22:01:59,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829568127] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:59,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010225200] [2022-03-15 22:01:59,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:01:59,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:59,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:59,639 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 22:01:59,640 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 22:01:59,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:01:59,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:01:59,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:01:59,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:59,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:59,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:59,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010225200] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:01:59,743 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:01:59,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-03-15 22:01:59,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1456595795] [2022-03-15 22:01:59,743 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:59,744 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:59,748 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:01:59,749 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:00,217 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [847#(or (< j M) (<= k (+ i 1))), 843#(or (<= N i) (< k N)), 839#(or (<= N k) (< (+ k 1) N)), 841#(or (<= N i) (< j M)), 829#(or (<= k i) (< j M)), 842#(or (<= N (+ i 1)) (< j M)), 840#(or (< j M) (<= N k) (< (+ k 1) N)), 837#(< k N), 844#(or (<= N i) (<= N k) (< (+ k 1) N)), 838#(or (< j M) (< k N)), 846#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 836#(< j M), 845#(or (<= N i) (< j M) (< k N))] [2022-03-15 22:02:00,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:02:00,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:00,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:02:00,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:02:00,218 INFO L87 Difference]: Start difference. First operand 68 states and 192 transitions. Second operand has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 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 22:02:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:01,109 INFO L93 Difference]: Finished difference Result 175 states and 510 transitions. [2022-03-15 22:02:01,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 22:02:01,110 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 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 14 [2022-03-15 22:02:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:01,111 INFO L225 Difference]: With dead ends: 175 [2022-03-15 22:02:01,111 INFO L226 Difference]: Without dead ends: 172 [2022-03-15 22:02:01,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=800, Invalid=2622, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:02:01,113 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:01,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:02:01,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-03-15 22:02:01,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 91. [2022-03-15 22:02:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 3.2555555555555555) internal successors, (293), 90 states have internal predecessors, (293), 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 22:02:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 293 transitions. [2022-03-15 22:02:01,119 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 293 transitions. Word has length 14 [2022-03-15 22:02:01,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:01,119 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 293 transitions. [2022-03-15 22:02:01,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 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 22:02:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 293 transitions. [2022-03-15 22:02:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:02:01,120 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:01,120 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:01,141 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 22:02:01,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:01,336 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:02:01,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:01,336 INFO L85 PathProgramCache]: Analyzing trace with hash -771572247, now seen corresponding path program 3 times [2022-03-15 22:02:01,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:01,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098846643] [2022-03-15 22:02:01,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:01,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:01,391 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 22:02:01,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:01,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098846643] [2022-03-15 22:02:01,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098846643] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:01,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128453715] [2022-03-15 22:02:01,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:02:01,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:01,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:01,394 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 22:02:01,395 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 22:02:01,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:02:01,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:01,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:02:01,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:01,482 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 22:02:01,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:01,506 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 22:02:01,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128453715] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:01,507 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:01,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-03-15 22:02:01,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [424660814] [2022-03-15 22:02:01,507 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:01,508 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:01,511 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:02:01,511 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:01,864 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1372#(or (<= N k) (< (+ k 1) N)), 1375#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 1373#(or (<= N (+ k 1)) (< (+ 2 k) N)), 1374#(or (<= N k) (< (+ k 1) N) (< i N)), 1370#(< k N), 1371#(or (< k N) (< i N))] [2022-03-15 22:02:01,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 22:02:01,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:01,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 22:02:01,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:02:01,865 INFO L87 Difference]: Start difference. First operand 91 states and 293 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 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 22:02:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:02,295 INFO L93 Difference]: Finished difference Result 240 states and 732 transitions. [2022-03-15 22:02:02,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 22:02:02,296 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 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 22:02:02,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:02,297 INFO L225 Difference]: With dead ends: 240 [2022-03-15 22:02:02,297 INFO L226 Difference]: Without dead ends: 240 [2022-03-15 22:02:02,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:02:02,298 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:02,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:02:02,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-03-15 22:02:02,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 170. [2022-03-15 22:02:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 3.4319526627218937) internal successors, (580), 169 states have internal predecessors, (580), 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 22:02:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 580 transitions. [2022-03-15 22:02:02,306 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 580 transitions. Word has length 14 [2022-03-15 22:02:02,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:02,307 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 580 transitions. [2022-03-15 22:02:02,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 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 22:02:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 580 transitions. [2022-03-15 22:02:02,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:02:02,308 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:02,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:02,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 22:02:02,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:02,528 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:02:02,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:02,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1294994650, now seen corresponding path program 1 times [2022-03-15 22:02:02,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:02,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544737265] [2022-03-15 22:02:02,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:02,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:02,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:02,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544737265] [2022-03-15 22:02:02,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544737265] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:02,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191843964] [2022-03-15 22:02:02,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:02,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:02,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:02,588 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 22:02:02,591 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 22:02:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:02,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:02:02,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:02,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:02,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:02,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191843964] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:02,678 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:02,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-03-15 22:02:02,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1534888644] [2022-03-15 22:02:02,679 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:02,679 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:02,683 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 110 transitions. [2022-03-15 22:02:02,683 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:03,038 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [2081#(or (< j M) (<= (+ 2 i) N)), 2078#(or (< j M) (< i N)), 2077#(< j M), 2082#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 2079#(or (< (+ j 1) M) (<= M j)), 2080#(or (< (+ j 1) M) (< i N) (<= M j))] [2022-03-15 22:02:03,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:02:03,039 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:03,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:02:03,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-03-15 22:02:03,039 INFO L87 Difference]: Start difference. First operand 170 states and 580 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 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 22:02:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:03,205 INFO L93 Difference]: Finished difference Result 256 states and 873 transitions. [2022-03-15 22:02:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 22:02:03,205 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 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 22:02:03,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:03,210 INFO L225 Difference]: With dead ends: 256 [2022-03-15 22:02:03,210 INFO L226 Difference]: Without dead ends: 256 [2022-03-15 22:02:03,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:02:03,212 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:03,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:02:03,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-03-15 22:02:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 210. [2022-03-15 22:02:03,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 3.444976076555024) internal successors, (720), 209 states have internal predecessors, (720), 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 22:02:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 720 transitions. [2022-03-15 22:02:03,221 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 720 transitions. Word has length 14 [2022-03-15 22:02:03,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:03,221 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 720 transitions. [2022-03-15 22:02:03,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 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 22:02:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 720 transitions. [2022-03-15 22:02:03,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:02:03,222 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:03,222 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:03,239 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 22:02:03,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:03,436 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:02:03,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:03,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1803933763, now seen corresponding path program 4 times [2022-03-15 22:02:03,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:03,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667261613] [2022-03-15 22:02:03,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:03,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:03,842 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 22:02:03,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:03,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667261613] [2022-03-15 22:02:03,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667261613] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:03,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81460525] [2022-03-15 22:02:03,842 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:02:03,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:03,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:03,843 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 22:02:03,845 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 22:02:03,875 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:02:03,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:03,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 22:02:03,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:04,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:04,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:04,274 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 75 [2022-03-15 22:02:04,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 22:02:04,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:04,997 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:02:04,997 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 367 treesize of output 253 [2022-03-15 22:02:07,059 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 22:02:07,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81460525] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:07,059 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:07,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-03-15 22:02:07,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1168268300] [2022-03-15 22:02:07,060 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:07,060 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:07,065 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 22:02:07,065 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:21,793 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [2876#(and (or (< j M) (< k N) (<= (+ i 1) N) (= max3 max1) (<= max3 max2)) (or (< j M) (< k N) (<= (+ i 1) N) (<= (+ max2 1) max3) (= max2 max1))), 2884#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< j M) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2)) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1))), 2875#(and (or (< j M) (< k N) (= max3 max1) (<= max3 max2)) (or (< j M) (< k N) (<= (+ max2 1) max3) (= max2 max1))), 2888#(and (or (not (< k N)) (<= (select A i) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (= (select A i) max3)) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= (select A i) max3)) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max1 1) (select A i)))), 2887#(and (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (select A k) max2) (< i N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N))), 2870#(and (or (< j M) (= max3 max1) (<= max3 max2)) (or (< j M) (<= (+ max2 1) max3) (= max2 max1))), 2872#(and (or (< j M) (<= (+ 2 i) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (<= (+ 2 i) N) (= max3 max1) (= (select A i) max3)) (or (< j M) (<= (+ 2 i) N) (<= (select A i) max3)) (or (< j M) (<= (+ 2 i) N) (= max3 max1) (<= (+ max1 1) (select A i)))), 2892#(and (or (< j M) (= max2 max1)) (or (< j M) (= max3 max1) (<= 1 (select A i))) (or (< j M) (= max1 0)) (or (< j M) (<= (select A i) 0) (= (select A i) max3)) (or (<= (+ i 1) k) (< j M)) (or (< j M) (= i max2))), 2880#(and (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1)) (or (not (< k N)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2)) (or (not (< k N)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2))), 2871#(and (or (< j M) (<= (+ i 1) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (<= (+ i 1) N) (= max3 max1) (<= max3 max2))), 2891#(and (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (<= (select A i) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (= (select A i) max3)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= (select A i) (select A (+ k 1)))) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k))) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (<= (select A i) (select A (+ k 1))) (< max3 (select A k))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= (select A i) max3)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1))), 2889#(and (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= (select A i) max3)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= (select A i) (select A (+ k 1)))) (or (<= N (+ k 1)) (<= (select A i) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (= (select A i) max3)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (<= (select A i) (select A (+ k 1))) (< max3 (select A k))) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k)))), 2873#(and (or (< k N) (= max3 max1) (<= max3 max2)) (or (< k N) (<= (+ max2 1) max3) (= max2 max1))), 2890#(and (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (= (select A i) max3)) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= (select A i) max3)) (or (not (< k N)) (< j M) (<= (select A i) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1))), 2874#(and (or (< k N) (<= (+ i 1) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< k N) (<= (+ i 1) N) (= max3 max1) (<= max3 max2))), 2882#(and (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (< i N) (= max2 max1)) (or (not (< k N)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N)) (or (not (< k N)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2) (< i N))), 2885#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (< i N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2) (< i N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N))), 2893#(and (or (< j M) (= max2 max1)) (or (< j M) (= k 0)) (or (< j M) (= max3 max1)) (or (< j M) (= max3 0)) (or (< j M) (= i max2))), 2877#(and (or (< k N) (<= (+ 2 i) N) (= max3 max1) (= (select A i) max3)) (or (< k N) (<= (+ 2 i) N) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< k N) (<= (+ 2 i) N) (<= (select A i) max3)) (or (< k N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (= max2 max1))), 2881#(and (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k))) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1)) (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (select A k) max2))), 2879#(and (or (< (+ 2 i) N) (< j M) (= i max1)) (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (select A i) 0) (<= (select A (+ (- 1) N)) (select A i))) (or (< j M) (<= (+ 2 i) N)) (or (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) 0) (= (select A i) max3)) (or (< (+ 2 i) N) (< j M) (= max1 0)) (or (< (+ 2 i) N) (< j M) (= (+ i (* (- 1) max2)) 0)) (or (<= (select A (+ (- 1) N)) max3) (< (+ 2 i) N) (< j M)) (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (= max3 max1) (<= 1 (select A i))) (or (< (+ 2 i) N) (< j M) (= max3 max1) (<= (+ i 1) (select A (+ (- 1) N))) (<= 1 (select A i)))), 2878#(and (or (< j M) (< k N) (<= (+ 2 i) N) (<= (select A i) max3)) (or (< j M) (< k N) (<= (+ 2 i) N) (= max3 max1) (= (select A i) max3)) (or (< j M) (< k N) (<= (+ 2 i) N) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< j M) (< k N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (= max2 max1))), 2883#(and (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N)) (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (select A k) max2) (< i N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (< i N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1))), 2886#(and (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (select A k) max2)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k))) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (= max2 max1)))] [2022-03-15 22:02:21,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:02:21,794 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:21,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:02:21,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:02:21,795 INFO L87 Difference]: Start difference. First operand 210 states and 720 transitions. Second operand has 33 states, 32 states have (on average 2.90625) internal successors, (93), 32 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 22:02:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:40,557 INFO L93 Difference]: Finished difference Result 440 states and 1390 transitions. [2022-03-15 22:02:40,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-03-15 22:02:40,557 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.90625) internal successors, (93), 32 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 15 [2022-03-15 22:02:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:40,568 INFO L225 Difference]: With dead ends: 440 [2022-03-15 22:02:40,569 INFO L226 Difference]: Without dead ends: 429 [2022-03-15 22:02:40,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3621 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=2066, Invalid=10144, Unknown=0, NotChecked=0, Total=12210 [2022-03-15 22:02:40,571 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 424 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:40,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 0 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 22:02:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-03-15 22:02:40,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 256. [2022-03-15 22:02:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 3.5686274509803924) internal successors, (910), 255 states have internal predecessors, (910), 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 22:02:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 910 transitions. [2022-03-15 22:02:40,579 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 910 transitions. Word has length 15 [2022-03-15 22:02:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:40,579 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 910 transitions. [2022-03-15 22:02:40,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.90625) internal successors, (93), 32 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 22:02:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 910 transitions. [2022-03-15 22:02:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:02:40,591 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:40,591 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:40,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 22:02:40,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:40,808 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:02:40,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:40,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1005306136, now seen corresponding path program 5 times [2022-03-15 22:02:40,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:40,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692509660] [2022-03-15 22:02:40,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:40,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:40,871 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 22:02:40,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:40,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692509660] [2022-03-15 22:02:40,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692509660] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:40,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373892522] [2022-03-15 22:02:40,871 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:02:40,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:40,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:40,872 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 22:02:40,891 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 22:02:40,919 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:02:40,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:40,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:02:40,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:41,006 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 22:02:41,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:41,045 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 22:02:41,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373892522] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:41,045 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:41,045 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-03-15 22:02:41,045 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1284989707] [2022-03-15 22:02:41,045 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:41,047 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:41,050 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:02:41,051 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:41,459 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [4086#(or (<= N i) (< (+ i 1) N) (<= N k)), 4084#(or (<= N i) (< (+ i 1) N)), 4081#(< i N), 4082#(or (<= (+ N 1) k) (< i N)), 4085#(or (<= N i) (< (+ i 1) N) (<= (+ N 1) k)), 4083#(or (<= N k) (< i N))] [2022-03-15 22:02:41,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 22:02:41,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:41,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 22:02:41,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:02:41,460 INFO L87 Difference]: Start difference. First operand 256 states and 910 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 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 22:02:41,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:41,789 INFO L93 Difference]: Finished difference Result 385 states and 1236 transitions. [2022-03-15 22:02:41,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 22:02:41,789 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 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 22:02:41,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:41,791 INFO L225 Difference]: With dead ends: 385 [2022-03-15 22:02:41,791 INFO L226 Difference]: Without dead ends: 364 [2022-03-15 22:02:41,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=372, Invalid=1110, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:02:41,792 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:41,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:02:41,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-03-15 22:02:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 251. [2022-03-15 22:02:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 3.504) internal successors, (876), 250 states have internal predecessors, (876), 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 22:02:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 876 transitions. [2022-03-15 22:02:41,801 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 876 transitions. Word has length 15 [2022-03-15 22:02:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:41,801 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 876 transitions. [2022-03-15 22:02:41,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 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 22:02:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 876 transitions. [2022-03-15 22:02:41,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:02:41,802 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:41,802 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:41,821 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 22:02:42,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:42,018 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:02:42,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1442998130, now seen corresponding path program 2 times [2022-03-15 22:02:42,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:42,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065039093] [2022-03-15 22:02:42,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:42,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:42,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:42,380 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:42,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065039093] [2022-03-15 22:02:42,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065039093] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:42,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976160640] [2022-03-15 22:02:42,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:02:42,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:42,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:42,383 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 22:02:42,383 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 22:02:42,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:02:42,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:42,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:02:42,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:42,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:42,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:42,742 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 65 [2022-03-15 22:02:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:43,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:43,870 INFO L353 Elim1Store]: treesize reduction 10, result has 81.8 percent of original size [2022-03-15 22:02:43,870 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 347 treesize of output 269 [2022-03-15 22:02:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:55,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976160640] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:55,719 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:55,719 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-03-15 22:02:55,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [688893517] [2022-03-15 22:02:55,720 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:55,720 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:55,724 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 141 transitions. [2022-03-15 22:02:55,725 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:10,321 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [5128#(and (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (<= (+ (select A j) 1) max3) (= (select A j) max1)) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (= max3 max1) (<= max3 max2)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= max3 max1) (<= max3 (select A j))) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (<= (+ max2 1) max3) (= max2 max1))), 5126#(and (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1)) (or (not (< k N)) (= max1 0) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (<= (+ (select A k) 1) max1) (= max1 0) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (<= (+ (select A i) 1) max1) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= (select A i) max3)) (or (not (< k N)) (<= (+ (select A k) 1) max1) (= max2 (select A k)) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (= max3 max2) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (<= (select A i) (select A k)) (not (< max3 (select A k))) (<= (+ (select A i) 1) max1) (< (+ k 1) N) (<= (+ 2 i) N))), 5136#(and (or (not (< k N)) (<= (+ (select A k) 1) max1) (< (+ j 1) M) (= max1 0) (not (< max3 (select A k))) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ j 1) M) (= max1 0) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1)) (or (not (< k N)) (< (+ j 1) M) (<= (+ (select A i) 1) max1) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= (select A i) max3)) (or (not (< k N)) (<= (+ (select A k) 1) max1) (< (+ j 1) M) (not (< max2 (select A j))) (= (select A j) (select A k)) (not (< max3 (select A k))) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max3) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (< (+ j 1) M) (= max3 max2) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (<= (+ (select A k) 1) max1) (< (+ j 1) M) (= max2 (select A k)) (not (< max3 (select A k))) (not (< j M)) (< max2 (select A j)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (= (select A j) max1)) (or (not (< k N)) (< (+ j 1) M) (<= (select A i) (select A k)) (not (< max3 (select A k))) (<= (+ (select A i) 1) max1) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N))), 5137#(and (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= i max3)) (or (< (+ 2 i) N) (< j M) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (= max3 max2) (< (+ 2 i) N) (< j M) (<= (+ max1 1) (select A i)) (<= 1 max3)) (or (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= (select A i) max2)) (or (< j M) (<= (+ 2 i) N)) (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (= max3 max1) (<= (+ i 1) (select A i))) (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< (+ 2 i) N) (< j M) (= max1 0) (<= (+ max1 1) (select A i))) (or (<= (select A (+ (- 1) N)) max3) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ 2 i) N) (< j M))), 5115#(and (or (< j M) (<= (+ (select A i) 1) max1) (<= (+ 2 i) N) (<= (select A i) max3)) (or (< j M) (<= (+ 2 i) N) (= max2 max1)) (or (= max3 max2) (< j M) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (< j M) (= max1 0) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3))), 5131#(and (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (<= (+ (select A j) 1) max3) (= (select A j) max1) (< i N)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (= max3 max1) (< i N) (<= max3 (select A j))) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< k N) (<= (+ max2 1) max3) (< i N) (= max2 max1)) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< k N) (= max3 max1) (<= max3 max2) (< i N))), 5133#(and (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N) (= (select A j) max1) (<= (+ (select A j) 1) (select A k)) (< i N)) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N)) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< (+ k 1) N) (<= (+ (select A j) 1) max3) (= (select A j) max1) (< max3 (select A k)) (< i N)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (< i N) (<= max3 (select A j))) (or (not (< k N)) (< (+ j 1) M) (= max1 (select A k)) (not (< max3 (select A k))) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (select A k) max2) (< i N)) (or (not (< k N)) (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N) (< i N) (<= (select A k) (select A j))) (or (not (< k N)) (< (+ j 1) M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (< i N) (= max2 max1))), 5138#(and (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A i) (select A j)) (not (< max1 (select A i)))) (or (< (+ j 1) M) (= max3 max2) (< (+ 2 i) N) (not (< j M)) (< max2 (select A j)) (<= (+ max1 1) (select A i)) (<= 1 max3)) (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (= max3 max2) (= max3 (select A (+ i 1))) (< max2 (select A j)) (< max1 (select A i)) (<= M j)) (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A (+ i 1)) 1) (select A i)) (<= (select A (+ i 1)) max3) (<= M j)) (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max1) (< max1 (select A i))) (or (< (+ j 1) M) (not (< max2 (select A j))) (< (+ 2 i) N) (not (< j M)) (= (select A j) max3) (<= (+ max1 1) (select A i)) (<= 1 max3)) (or (< (+ j 1) M) (< (+ 2 i) N) (= max1 0) (not (< j M)) (<= (+ max1 1) (select A i))) (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< max1 (select A i)) (= max2 max1)) (or (<= (select A j) max2) (<= (+ 3 i) N) (< (+ j 1) M) (= max3 (select A (+ i 1))) (= (select A j) max3) (< max1 (select A i)) (<= M j)) (or (= max3 (select A (+ (- 1) N))) (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (not (< j M)) (= i max3)) (or (= max3 (select A (+ (- 1) N))) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (= max3 max1) (<= (+ i 1) (select A i)))), 5118#(and (or (< k N) (<= (+ max2 1) max3) (< i N) (= max2 max1)) (or (< k N) (= max3 max1) (<= max3 max2) (< i N))), 5114#(and (or (< j M) (<= (+ i 1) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (<= (+ i 1) N) (= max3 max1) (<= max3 max2))), 5124#(and (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (< i N) (= max2 max1)) (or (not (< k N)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N)) (or (not (< k N)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2) (< i N))), 5123#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< j M) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2)) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1))), 5117#(and (or (< j M) (< k N) (= max3 max1) (<= max3 max2)) (or (< j M) (< k N) (<= (+ max2 1) max3) (= max2 max1))), 5120#(and (or (< k N) (<= (+ 2 i) N) (= max2 max1)) (or (= max3 max2) (< k N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (= max1 0) (< k N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (<= (+ (select A i) 1) max1) (< k N) (<= (+ 2 i) N) (<= (select A i) max3))), 5121#(and (or (< j M) (< k N) (<= (+ 2 i) N) (= max2 max1)) (or (= max3 max2) (< j M) (< k N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (< j M) (= max1 0) (< k N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (< j M) (<= (+ (select A i) 1) max1) (< k N) (<= (+ 2 i) N) (<= (select A i) max3))), 5129#(and (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< k N) (= max3 max1) (<= max3 max2)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (= max3 max1) (<= max3 (select A j))) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< k N) (<= (+ max2 1) max3) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (<= (+ (select A j) 1) max3) (= (select A j) max1))), 5116#(and (or (< k N) (= max3 max1) (<= max3 max2)) (or (< k N) (<= (+ max2 1) max3) (= max2 max1))), 5132#(and (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N) (= (select A j) max1) (<= (+ (select A j) 1) (select A k))) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 (select A j))) (or (not (< k N)) (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N) (<= (select A k) (select A j))) (or (not (< k N)) (< (+ j 1) M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (= max2 max1)) (or (not (< k N)) (< (+ j 1) M) (= max1 (select A k)) (not (< max3 (select A k))) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (select A k) max2)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< (+ k 1) N) (<= (+ (select A j) 1) max3) (= (select A j) max1) (< max3 (select A k)))), 5135#(and (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< k N) (<= (+ 2 i) N) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (<= (+ 2 i) N) (= (select A j) max1)) (or (< (+ j 1) M) (<= (+ (select A i) 1) max1) (not (< j M)) (< k N) (<= (+ 2 i) N) (<= (select A i) max3)) (or (< (+ j 1) M) (= max1 0) (not (< j M)) (< k N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (< (+ j 1) M) (= max3 max2) (not (< j M)) (< max2 (select A j)) (< k N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (= (select A j) max3) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3))), 5134#(and (or (< (+ j 1) M) (= max1 0) (not (< j M)) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max3) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (<= (+ 2 i) N) (= max2 max1)) (or (< (+ j 1) M) (<= (+ (select A i) 1) max1) (not (< j M)) (<= (+ 2 i) N) (<= (select A i) max3)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (<= (+ 2 i) N) (= (select A j) max1)) (or (< (+ j 1) M) (= max3 max2) (not (< j M)) (< max2 (select A j)) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3))), 5127#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1)) (or (not (< k N)) (< j M) (<= (select A i) (select A k)) (not (< max3 (select A k))) (<= (+ (select A i) 1) max1) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (= max3 max2) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (<= (+ (select A k) 1) max1) (< j M) (= max1 0) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (<= (+ (select A k) 1) max1) (< j M) (= max2 (select A k)) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (<= (+ (select A i) 1) max1) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= (select A i) max3)) (or (not (< k N)) (< j M) (= max1 0) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (< max3 (select A k)) (= (select A i) max3))), 5119#(and (or (< j M) (< k N) (= max3 max1) (<= max3 max2) (< i N)) (or (< j M) (< k N) (<= (+ max2 1) max3) (< i N) (= max2 max1))), 5122#(and (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1)) (or (not (< k N)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2)) (or (not (< k N)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2))), 5125#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (< i N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2) (< i N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N))), 5113#(and (or (< j M) (= max3 max1) (<= max3 max2)) (or (< j M) (<= (+ max2 1) max3) (= max2 max1))), 5130#(and (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= max3 max1) (< i N) (<= max3 (select A j))) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (= max3 max1) (<= max3 max2) (< i N)) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (<= (+ max2 1) max3) (< i N) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (<= (+ (select A j) 1) max3) (= (select A j) max1) (< i N)))] [2022-03-15 22:03:10,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:03:10,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:10,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:03:10,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1740, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:03:10,322 INFO L87 Difference]: Start difference. First operand 251 states and 876 transitions. Second operand has 34 states, 33 states have (on average 3.1515151515151514) internal successors, (104), 33 states have internal predecessors, (104), 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 22:03:44,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:44,080 INFO L93 Difference]: Finished difference Result 1094 states and 3040 transitions. [2022-03-15 22:03:44,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-03-15 22:03:44,080 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.1515151515151514) internal successors, (104), 33 states have internal predecessors, (104), 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 22:03:44,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:44,084 INFO L225 Difference]: With dead ends: 1094 [2022-03-15 22:03:44,084 INFO L226 Difference]: Without dead ends: 1049 [2022-03-15 22:03:44,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8678 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=4495, Invalid=22565, Unknown=0, NotChecked=0, Total=27060 [2022-03-15 22:03:44,089 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 530 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:44,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [530 Valid, 0 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 22:03:44,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2022-03-15 22:03:44,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 298. [2022-03-15 22:03:44,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.6026936026936025) internal successors, (1070), 297 states have internal predecessors, (1070), 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 22:03:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 1070 transitions. [2022-03-15 22:03:44,101 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 1070 transitions. Word has length 15 [2022-03-15 22:03:44,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:44,101 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 1070 transitions. [2022-03-15 22:03:44,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.1515151515151514) internal successors, (104), 33 states have internal predecessors, (104), 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 22:03:44,101 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 1070 transitions. [2022-03-15 22:03:44,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:03:44,102 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:44,102 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:44,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 22:03:44,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:44,316 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:03:44,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:44,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1848560448, now seen corresponding path program 3 times [2022-03-15 22:03:44,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:44,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650812356] [2022-03-15 22:03:44,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:44,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:03:44,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:44,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650812356] [2022-03-15 22:03:44,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650812356] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:44,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77326560] [2022-03-15 22:03:44,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:03:44,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:44,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:44,345 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 22:03:44,346 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 22:03:44,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:03:44,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:44,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:03:44,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:44,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:03:44,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:44,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:03:44,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77326560] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:44,478 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:44,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-03-15 22:03:44,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1103941471] [2022-03-15 22:03:44,478 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:44,479 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:44,483 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 147 transitions. [2022-03-15 22:03:44,483 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:44,808 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [7162#(< i N), 7163#(or (<= N i) (< (+ i 1) N))] [2022-03-15 22:03:44,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 22:03:44,808 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:44,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 22:03:44,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-03-15 22:03:44,808 INFO L87 Difference]: Start difference. First operand 298 states and 1070 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 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 22:03:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:44,958 INFO L93 Difference]: Finished difference Result 436 states and 1461 transitions. [2022-03-15 22:03:44,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:03:44,958 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 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 22:03:44,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:44,964 INFO L225 Difference]: With dead ends: 436 [2022-03-15 22:03:44,964 INFO L226 Difference]: Without dead ends: 428 [2022-03-15 22:03:44,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:03:44,965 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:44,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:03:44,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-03-15 22:03:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 277. [2022-03-15 22:03:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 3.601449275362319) internal successors, (994), 276 states have internal predecessors, (994), 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 22:03:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 994 transitions. [2022-03-15 22:03:44,973 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 994 transitions. Word has length 15 [2022-03-15 22:03:44,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:44,974 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 994 transitions. [2022-03-15 22:03:44,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 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 22:03:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 994 transitions. [2022-03-15 22:03:44,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:03:44,975 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:44,975 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:44,992 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 22:03:45,192 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,SelfDestructingSolverStorable10 [2022-03-15 22:03:45,192 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:03:45,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:45,193 INFO L85 PathProgramCache]: Analyzing trace with hash 40241449, now seen corresponding path program 6 times [2022-03-15 22:03:45,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:45,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117736638] [2022-03-15 22:03:45,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:45,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:45,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:45,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117736638] [2022-03-15 22:03:45,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117736638] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:45,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449758827] [2022-03-15 22:03:45,270 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:03:45,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:45,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:45,271 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 22:03:45,272 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 22:03:45,294 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:03:45,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:45,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:03:45,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:45,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:45,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449758827] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:45,389 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:45,389 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-03-15 22:03:45,390 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [235541000] [2022-03-15 22:03:45,390 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:45,390 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:45,395 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:03:45,395 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:46,284 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [8282#(or (< j M) (<= N k) (< (+ k 1) N)), 8287#(or (<= N (+ i 1)) (< j M) (< k N)), 8289#(or (<= N (+ 2 i)) (< j M)), 8285#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 8275#(or (<= N k) (< (+ k 1) N)), 8290#(or (< j M) (<= k (+ 2 i))), 8273#(< j M), 8286#(or (<= N (+ i 1)) (< j M)), 8277#(or (<= N i) (< k N)), 8291#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 8283#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 8293#(or (<= N (+ k 1)) (<= N i) (< j M) (< (+ 2 k) N)), 8274#(< k N), 8288#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 8294#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N)), 8296#(or (< j M) (<= k (+ i 1))), 8292#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N)), 8278#(or (<= N i) (< j M)), 8284#(or (<= N (+ i 1)) (< k N)), 8295#(or (<= N (+ k 1)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N)), 8266#(or (<= k i) (< j M)), 8279#(or (< j M) (< k N)), 8281#(or (<= N i) (<= N k) (< (+ k 1) N)), 8276#(or (<= N (+ k 1)) (< (+ 2 k) N)), 8280#(or (<= N i) (< j M) (< k N))] [2022-03-15 22:03:46,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:03:46,285 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:46,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:03:46,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:03:46,286 INFO L87 Difference]: Start difference. First operand 277 states and 994 transitions. Second operand has 34 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 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 22:03:48,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:48,211 INFO L93 Difference]: Finished difference Result 649 states and 2165 transitions. [2022-03-15 22:03:48,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 22:03:48,211 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 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 22:03:48,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:48,214 INFO L225 Difference]: With dead ends: 649 [2022-03-15 22:03:48,214 INFO L226 Difference]: Without dead ends: 642 [2022-03-15 22:03:48,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3308 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2726, Invalid=9264, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 22:03:48,218 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 363 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:48,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 0 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:03:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-03-15 22:03:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 354. [2022-03-15 22:03:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 3.7535410764872523) internal successors, (1325), 353 states have internal predecessors, (1325), 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 22:03:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1325 transitions. [2022-03-15 22:03:48,229 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1325 transitions. Word has length 16 [2022-03-15 22:03:48,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:48,229 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 1325 transitions. [2022-03-15 22:03:48,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 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 22:03:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1325 transitions. [2022-03-15 22:03:48,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:03:48,230 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:48,230 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:48,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-15 22:03:48,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:48,432 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:03:48,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:48,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2020943604, now seen corresponding path program 7 times [2022-03-15 22:03:48,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:48,433 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649057974] [2022-03-15 22:03:48,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:48,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:48,506 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 22:03:48,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:48,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649057974] [2022-03-15 22:03:48,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649057974] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:48,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59822576] [2022-03-15 22:03:48,507 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:03:48,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:48,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:48,508 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 22:03:48,515 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 22:03:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:48,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:03:48,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:48,631 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 22:03:48,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:48,663 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 22:03:48,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59822576] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:48,663 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:48,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-15 22:03:48,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1616791645] [2022-03-15 22:03:48,664 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:48,664 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:48,669 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:03:48,670 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:49,178 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [9917#(or (< k N) (<= (+ 2 i) N)), 9909#(< k N), 9920#(or (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)), 9912#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 9915#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 9918#(or (<= N k) (< (+ k 1) N) (<= (+ 2 i) N)), 9916#(or (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)), 9914#(or (<= N k) (< (+ k 1) N) (< i N)), 9913#(or (< k N) (< i N)), 9910#(or (<= N k) (< (+ k 1) N)), 9911#(or (<= N (+ k 1)) (< (+ 2 k) N)), 9919#(or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ 2 i) N))] [2022-03-15 22:03:49,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:03:49,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:49,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:03:49,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2022-03-15 22:03:49,179 INFO L87 Difference]: Start difference. First operand 354 states and 1325 transitions. Second operand has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 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 22:03:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:49,744 INFO L93 Difference]: Finished difference Result 745 states and 2539 transitions. [2022-03-15 22:03:49,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 22:03:49,744 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 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 22:03:49,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:49,747 INFO L225 Difference]: With dead ends: 745 [2022-03-15 22:03:49,747 INFO L226 Difference]: Without dead ends: 745 [2022-03-15 22:03:49,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=850, Invalid=2572, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:03:49,749 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 228 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:49,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 0 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:03:49,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-03-15 22:03:49,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 469. [2022-03-15 22:03:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 3.7371794871794872) internal successors, (1749), 468 states have internal predecessors, (1749), 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 22:03:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1749 transitions. [2022-03-15 22:03:49,765 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1749 transitions. Word has length 16 [2022-03-15 22:03:49,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:49,765 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 1749 transitions. [2022-03-15 22:03:49,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 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 22:03:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1749 transitions. [2022-03-15 22:03:49,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:03:49,767 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:49,767 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:49,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-15 22:03:49,992 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,SelfDestructingSolverStorable12 [2022-03-15 22:03:49,992 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:03:49,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:49,993 INFO L85 PathProgramCache]: Analyzing trace with hash -578126427, now seen corresponding path program 4 times [2022-03-15 22:03:49,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:49,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056636138] [2022-03-15 22:03:49,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:49,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:50,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:50,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056636138] [2022-03-15 22:03:50,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056636138] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:50,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930598052] [2022-03-15 22:03:50,036 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:03:50,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:50,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:50,037 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 22:03:50,038 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 22:03:50,061 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:03:50,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:50,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:03:50,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:50,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:50,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930598052] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:50,122 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:50,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 22:03:50,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1658501992] [2022-03-15 22:03:50,123 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:50,123 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:50,129 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 180 transitions. [2022-03-15 22:03:50,129 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:51,729 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [11787#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 11789#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (< i N) (<= M j)), 11788#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (< i N)), 11775#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 11783#(or (< j M) (<= N k) (< (+ k 1) N) (< i N)), 11780#(or (< j M) (< i N)), 11792#(or (< k N) (<= (+ 2 i) N)), 11799#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= (+ 2 i) N) (<= M j)), 11800#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= (+ 2 i) N) (<= M j)), 11774#(or (< j M) (<= N k) (< (+ k 1) N)), 11795#(or (<= N k) (< (+ k 1) N) (<= (+ 2 i) N)), 11804#(or (< (+ j 1) M) (<= (+ 2 i) k) (<= M j)), 11776#(or (<= N (+ k 1)) (< (+ 2 k) N)), 11778#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= M j)), 11777#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 11769#(< j M), 11773#(or (<= N k) (< (+ k 1) N)), 11772#(or (< (+ j 1) M) (< k N) (<= M j)), 11781#(or (< j M) (< k N) (< i N)), 11770#(or (< j M) (< k N)), 11771#(or (< (+ j 1) M) (<= M j)), 11790#(or (< j M) (<= (+ 2 i) N)), 11793#(or (< j M) (< k N) (<= (+ 2 i) N)), 11784#(or (< (+ j 1) M) (< i N) (<= M j)), 11801#(or (<= (+ 3 i) N) (< j M)), 11797#(or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ 2 i) N)), 11779#(or (< k N) (< i N)), 11782#(or (<= N k) (< (+ k 1) N) (< i N)), 11791#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 11794#(or (< (+ j 1) M) (< k N) (<= (+ 2 i) N) (<= M j)), 11802#(or (<= (+ 3 i) N) (< (+ j 1) M) (<= M j)), 11785#(or (< (+ j 1) M) (< k N) (< i N) (<= M j)), 11786#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (< i N) (<= M j)), 11798#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N)), 11768#(< k N), 11796#(or (< j M) (<= N k) (< (+ k 1) N) (<= (+ 2 i) N)), 11803#(or (< j M) (<= (+ 2 i) k))] [2022-03-15 22:03:51,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 22:03:51,730 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:51,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 22:03:51,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 22:03:51,730 INFO L87 Difference]: Start difference. First operand 469 states and 1749 transitions. Second operand has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 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 22:03:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:56,364 INFO L93 Difference]: Finished difference Result 1012 states and 3592 transitions. [2022-03-15 22:03:56,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2022-03-15 22:03:56,364 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 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 22:03:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:56,368 INFO L225 Difference]: With dead ends: 1012 [2022-03-15 22:03:56,368 INFO L226 Difference]: Without dead ends: 1000 [2022-03-15 22:03:56,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14180 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=7971, Invalid=32229, Unknown=0, NotChecked=0, Total=40200 [2022-03-15 22:03:56,372 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 749 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:56,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [749 Valid, 0 Invalid, 2343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 22:03:56,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-03-15 22:03:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 576. [2022-03-15 22:03:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 3.7704347826086955) internal successors, (2168), 575 states have internal predecessors, (2168), 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 22:03:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 2168 transitions. [2022-03-15 22:03:56,388 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 2168 transitions. Word has length 16 [2022-03-15 22:03:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:56,389 INFO L470 AbstractCegarLoop]: Abstraction has 576 states and 2168 transitions. [2022-03-15 22:03:56,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 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 22:03:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 2168 transitions. [2022-03-15 22:03:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:03:56,391 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:56,391 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:56,409 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 22:03:56,607 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,SelfDestructingSolverStorable13 [2022-03-15 22:03:56,607 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:03:56,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:56,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1676567846, now seen corresponding path program 5 times [2022-03-15 22:03:56,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:56,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604776240] [2022-03-15 22:03:56,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:56,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:56,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:56,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604776240] [2022-03-15 22:03:56,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604776240] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:56,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229141292] [2022-03-15 22:03:56,660 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:03:56,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:56,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:56,661 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 22:03:56,662 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 22:03:56,691 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:03:56,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:56,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:03:56,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:56,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:56,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229141292] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:56,831 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:56,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-03-15 22:03:56,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1209142856] [2022-03-15 22:03:56,831 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:56,832 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:56,858 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 172 transitions. [2022-03-15 22:03:56,859 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:57,871 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [14410#(or (<= N (+ i 1)) (< (+ j 1) M) (< k N) (<= M j)), 14401#(or (<= N (+ 2 i)) (<= N k) (< (+ k 1) N)), 14400#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 14402#(or (<= (+ N j) (+ 2 M i)) (<= N k) (< (+ k 1) N)), 14407#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 14409#(or (<= N (+ i 1)) (< (+ j 1) M) (<= M j)), 14391#(or (<= N (+ i 1)) (< j M)), 14394#(or (<= (+ N j) (+ 2 M i)) (< k N)), 14389#(or (<= N i) (< j M) (< k N)), 14390#(or (<= N (+ i 1)) (< k N)), 14386#(< j M), 14387#(or (<= N i) (< j M)), 14397#(or (< j M) (<= N k) (< (+ k 1) N)), 14405#(or (< (+ j 1) M) (< k N) (<= M j)), 14396#(or (<= N i) (<= N k) (< (+ k 1) N)), 14406#(or (< (+ j 1) M) (<= N i) (< k N) (<= M j)), 14385#(or (<= N i) (< k N)), 14408#(or (< (+ j 1) M) (<= N i) (<= N k) (< (+ k 1) N) (<= M j)), 14411#(or (<= N (+ i 1)) (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 14393#(or (<= N (+ 2 i)) (< k N)), 14384#(< k N), 14395#(or (<= N k) (< (+ k 1) N)), 14392#(or (<= N (+ i 1)) (< j M) (< k N)), 14398#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 14404#(or (< (+ j 1) M) (<= N i) (<= M j)), 14399#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 14403#(or (< (+ j 1) M) (<= M j)), 14388#(or (< j M) (< k N))] [2022-03-15 22:03:57,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 22:03:57,871 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:57,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 22:03:57,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1712, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:03:57,872 INFO L87 Difference]: Start difference. First operand 576 states and 2168 transitions. Second operand has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 36 states have internal predecessors, (116), 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 22:03:59,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:59,685 INFO L93 Difference]: Finished difference Result 934 states and 3191 transitions. [2022-03-15 22:03:59,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-03-15 22:03:59,685 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 36 states have internal predecessors, (116), 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 22:03:59,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:59,689 INFO L225 Difference]: With dead ends: 934 [2022-03-15 22:03:59,689 INFO L226 Difference]: Without dead ends: 929 [2022-03-15 22:03:59,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5044 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3474, Invalid=13818, Unknown=0, NotChecked=0, Total=17292 [2022-03-15 22:03:59,692 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 477 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:59,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 0 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:03:59,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-03-15 22:03:59,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 609. [2022-03-15 22:03:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 608 states have (on average 3.7878289473684212) internal successors, (2303), 608 states have internal predecessors, (2303), 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 22:03:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 2303 transitions. [2022-03-15 22:03:59,709 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 2303 transitions. Word has length 16 [2022-03-15 22:03:59,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:59,710 INFO L470 AbstractCegarLoop]: Abstraction has 609 states and 2303 transitions. [2022-03-15 22:03:59,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 36 states have internal predecessors, (116), 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 22:03:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 2303 transitions. [2022-03-15 22:03:59,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:03:59,711 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:59,711 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:59,727 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 22:03:59,916 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,SelfDestructingSolverStorable14 [2022-03-15 22:03:59,916 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:03:59,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:59,917 INFO L85 PathProgramCache]: Analyzing trace with hash -975824784, now seen corresponding path program 6 times [2022-03-15 22:03:59,917 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:59,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911173341] [2022-03-15 22:03:59,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:59,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:03:59,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:59,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911173341] [2022-03-15 22:03:59,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911173341] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:59,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219435615] [2022-03-15 22:03:59,947 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:03:59,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:59,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:59,948 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 22:03:59,949 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 22:03:59,969 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 22:03:59,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:59,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:03:59,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:00,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:04:00,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:04:00,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219435615] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:00,074 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:00,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-03-15 22:04:00,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1007180372] [2022-03-15 22:04:00,074 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:00,075 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:00,081 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 189 transitions. [2022-03-15 22:04:00,081 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:00,798 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [16841#(or (< (+ 2 j) M) (<= M (+ j 1))), 16840#(or (< (+ j 1) M) (<= M j)), 16847#(or (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 16843#(or (< (+ j 1) M) (< i N) (<= M j)), 16845#(or (< j M) (<= (+ 2 i) N)), 16839#(< j M), 16846#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 16842#(or (< j M) (< i N)), 16844#(or (< (+ 2 j) M) (<= M (+ j 1)) (< i N))] [2022-03-15 22:04:00,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:04:00,798 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:00,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:04:00,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:04:00,799 INFO L87 Difference]: Start difference. First operand 609 states and 2303 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 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 22:04:01,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:01,225 INFO L93 Difference]: Finished difference Result 1081 states and 4109 transitions. [2022-03-15 22:04:01,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 22:04:01,225 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 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 22:04:01,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:01,229 INFO L225 Difference]: With dead ends: 1081 [2022-03-15 22:04:01,230 INFO L226 Difference]: Without dead ends: 1081 [2022-03-15 22:04:01,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=369, Invalid=963, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 22:04:01,230 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:01,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:04:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2022-03-15 22:04:01,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 727. [2022-03-15 22:04:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 3.84297520661157) internal successors, (2790), 726 states have internal predecessors, (2790), 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 22:04:01,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 2790 transitions. [2022-03-15 22:04:01,244 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 2790 transitions. Word has length 16 [2022-03-15 22:04:01,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:01,244 INFO L470 AbstractCegarLoop]: Abstraction has 727 states and 2790 transitions. [2022-03-15 22:04:01,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 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 22:04:01,244 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 2790 transitions. [2022-03-15 22:04:01,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:04:01,246 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:01,246 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:01,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-15 22:04:01,471 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,SelfDestructingSolverStorable15 [2022-03-15 22:04:01,472 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:04:01,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:01,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1822388072, now seen corresponding path program 8 times [2022-03-15 22:04:01,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:01,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554556923] [2022-03-15 22:04:01,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:01,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:02,230 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 22:04:02,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:02,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554556923] [2022-03-15 22:04:02,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554556923] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:02,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548717107] [2022-03-15 22:04:02,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:04:02,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:02,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:02,232 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 22:04:02,233 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 22:04:02,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:04:02,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:02,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 22:04:02,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:02,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:04:02,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:04:02,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:04:02,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:04:02,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:04:02,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:04:02,909 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 153 [2022-03-15 22:04:03,135 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 22:04:03,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:05,331 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:04:05,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1647 treesize of output 893 [2022-03-15 22:04:36,098 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 22:04:36,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548717107] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:36,098 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:36,098 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-03-15 22:04:36,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1908522860] [2022-03-15 22:04:36,098 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:36,099 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:36,107 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 173 transitions. [2022-03-15 22:04:36,107 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:30,067 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [19573#(and (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< max3 (select A (+ k 1))) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (= max3 0) (<= (+ max2 1) max1) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< (+ 2 i) N) (< j M) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N)) (or (= max3 (select A (+ (- 1) N))) (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i))) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) max1) (<= (select A k) max3) (= (select A (+ k 1)) 0)) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (<= (+ max2 1) max1) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (<= (+ max2 1) max1) (= (select A (+ k 1)) 0) (< max3 (select A k))) (or (<= N (+ k 1)) (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (< (+ 2 k) N) (< max3 (select A k)) (= (select A i) max3)) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< (+ 2 i) N) (< j M) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (+ max2 1) max1) (<= (select A k) max3) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (<= (+ max2 1) max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< (+ 2 i) N) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< max3 (select A (+ k 1))) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (= max2 max1))), 19578#(and (or (< j M) (= max2 max1)) (or (< j M) (= i 0)) (or (< j M) (= k 0)) (or (< j M) (= max3 max1)) (or (< j M) (= i max2))), 19566#(and (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i))) (or (< (+ 2 i) N) (< j M) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1)) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (+ max2 1) max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (= (select A i) max3)) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (< j M) (<= (+ 2 i) N)) (or (< (+ 2 i) N) (< j M) (<= (select A i) max1) (<= (+ max2 1) max3)) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= 0 max2) (= max3 max1) (<= (+ max1 1) (select A i))) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (= max3 0) (<= (+ max2 1) max1) (<= (+ max1 1) (select A i)))), 19554#(and (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (= max3 0) (<= (+ max2 1) max3) (< max3 (select A k))) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= 0 max2)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= 0 max2)) (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (< max3 (select A k))) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (= max3 0) (< max3 (select A k)) (= max3 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (< max3 (select A k))) (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= 0 max2) (< max3 (select A k))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3))), 19572#(and (or (not (< k N)) (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (< (+ k 1) N) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (= (select A k) 0) (not (< max3 (select A k))) (<= (+ max2 1) max1) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 i) N) (< j M) (< (+ k 1) N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (= max3 0) (<= (+ max2 1) max1) (< (+ k 1) N) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (+ max2 1) max1) (< (+ k 1) N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (+ max2 1) max1) (< (+ k 1) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (= max1 (select A k)) (< (+ 2 i) N) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ 2 i) N) (< j M) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (not (< max3 (select A k))) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k))) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (= max3 (select A (+ (- 1) N))) (not (< k N)) (< (+ 2 i) N) (< j M) (< (+ k 1) N) (<= (select A (+ (- 1) N)) max1) (< max3 (select A k)) (<= (select A (+ (- 1) N)) (select A i)))), 19571#(and (or (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< k N) (<= (+ max2 1) max3)) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< k N) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< k N) (<= 0 max2) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (< k N) (= (select A i) max3)) (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< k N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i))) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (= max3 0) (< k N) (<= (+ max2 1) max1) (<= (+ max1 1) (select A i))) (or (< (+ 2 i) N) (< j M) (< k N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1)) (or (< j M) (< k N) (<= (+ 2 i) N)) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< k N) (<= (+ max2 1) max1) (<= (+ max1 1) (select A i)) (= max2 max1))), 19569#(and (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 i) N) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (+ max2 1) max1) (<= (select A k) max3) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< max3 (select A (+ k 1))) (< (+ 2 i) N) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 i) N) (< (+ 2 k) N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1)) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (<= (+ max2 1) max1) (= (select A (+ k 1)) 0) (< max3 (select A k))) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< (+ 2 k) N) (<= (+ max2 1) max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) max1) (<= (select A k) max3) (= (select A (+ k 1)) 0)) (or (<= N (+ k 1)) (< (+ 2 i) N) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (< (+ 2 k) N) (< max3 (select A k)) (= (select A i) max3)) (or (= max3 (select A (+ (- 1) N))) (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 i) N) (< (+ 2 k) N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i))) (or (<= N (+ k 1)) (< (+ 2 i) N) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N)) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< (+ 2 k) N) (<= (+ max2 1) max1) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< max3 (select A (+ k 1))) (< (+ 2 i) N) (< (+ 2 k) N) (= max3 0) (<= (+ max2 1) max1) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (= max1 (select A k)) (< (+ 2 i) N) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ 2 i) N))), 19555#(and (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= 0 max2) (< i N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (< i N)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= 0 max2) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (= max3 0) (< max3 (select A k)) (= max3 max1) (< i N)) (or (<= N (+ k 1)) (= max1 (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< i N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (< i N)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= 0 max2) (< i N)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (= max3 0) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N))), 19557#(and (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= 0 max2) (< max3 (select A k))) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= 0 max2)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= max3 0) (<= (+ max2 1) max3) (< max3 (select A k))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= max3 0) (< max3 (select A k)) (= max3 max1)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (< max3 (select A k))) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (< max3 (select A k))) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= 0 max2)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3))), 19562#(and (or (< max3 (select A (+ k 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< max3 (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= (+ max1 1) (select A i))) (or (< (select A k) (select A (+ 2 k))) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (< max3 (select A (+ k 1))) (= max3 0) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (< max3 (select A (+ 2 k)))) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< (select A k) (select A (+ 2 k))) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k))) (or (= (select A i) (select A (+ 2 k))) (<= (select A (+ 2 k)) (select A k)) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< max3 (select A (+ k 1))) (<= (select A i) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (< max3 (select A (+ 2 k))) (= (select A i) max3)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (= (select A i) (select A (+ 2 k))) (<= (select A i) max1) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k))) (or (< max3 (select A (+ k 1))) (= (select A i) (select A (+ 2 k))) (<= (select A i) max1) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (< max3 (select A (+ k 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (< (select A k) (select A (+ 2 k))) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (= (select A i) (select A k)) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A i) max1) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k))) (or (< max3 (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1) (< max3 (select A (+ 2 k)))) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= (+ max1 1) (select A i))) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (= (select A i) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (< max3 (select A (+ k 1))) (= max3 0) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< max3 (select A (+ 2 k)))) (or (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (< max3 (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (< max3 (select A (+ 2 k)))) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1))), 19556#(and (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (<= (select A i) max1) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (= max3 0) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ 2 i) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= 0 max2) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (= max1 (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (select A i) max1) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (< max3 (select A k))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (= max3 0) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k))) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (< (+ 2 k) N) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= (+ 2 i) N) (< max3 (select A k)))), 19550#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< i N)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (< i N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= 0 max2) (< i N)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< j M) (= max3 0) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N)) (or (not (< k N)) (= max1 (select A k)) (< j M) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< j M) (= max3 0) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (< i N))), 19576#(and (or (< j M) (<= (+ 2 i) k)) (or (< (+ 2 i) k) (< j M) (= i max3) (<= max3 (select A i)) (<= (+ (select A i) 1) (select A (+ (- 1) k)))) (or (< j M) (= (+ i (* (- 1) max2)) 0)) (or (< (+ 2 i) k) (< j M) (= max3 0) (not (= i max3))) (or (< (+ 2 i) k) (< j M) (<= (select A (+ (- 1) k)) i) (not (= i max3))) (or (< (+ 2 i) k) (< j M) (= i max1)) (or (< (+ 2 i) k) (<= (select A (+ (- 1) k)) (select A i)) (< j M) (= (select A (+ (- 1) k)) max3) (= i max3)) (or (< (+ 2 i) k) (< j M) (<= (+ i 1) max3) (= i max3)) (or (< (+ 2 i) k) (< j M) (<= (+ (select A i) i) (+ max3 max1)))), 19548#(and (or (< j M) (< k N) (<= (+ i 1) N) (<= 0 max2) (= max3 max1)) (or (< j M) (= max3 0) (< k N) (<= (+ i 1) N) (= max3 max1)) (or (< j M) (= max3 0) (< k N) (<= (+ i 1) N) (<= (+ max2 1) max3)) (or (< j M) (< k N) (<= (+ i 1) N) (<= (+ max2 1) max3) (= max2 max1))), 19568#(and (or (not (< k N)) (< (+ 2 i) N) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (<= (+ max2 1) max1) (< (+ k 1) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (= max3 0) (<= (+ max2 1) max1) (< (+ k 1) N) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< (+ 2 i) N) (< (+ k 1) N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1)) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (= max3 (select A (+ (- 1) N))) (not (< k N)) (< (+ 2 i) N) (< (+ k 1) N) (<= (select A (+ (- 1) N)) max1) (< max3 (select A k)) (<= (select A (+ (- 1) N)) (select A i))) (or (not (< k N)) (< (+ 2 i) N) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (not (< max3 (select A k))) (< (+ k 1) N)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (<= (+ max2 1) max1) (< (+ k 1) N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (= max1 (select A k)) (< (+ 2 i) N) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (= (select A k) 0) (not (< max3 (select A k))) (<= (+ max2 1) max1) (< (+ k 1) N)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (not (< k N)) (< (+ 2 i) N) (<= (select A i) max1) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k))) (or (not (< k N)) (< (+ 2 i) N) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (< (+ k 1) N) (< max3 (select A k)) (= (select A i) max3))), 19565#(and (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (< j M) (= max3 0) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (< max3 (select A (+ 2 k)))) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (< (select A k) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (< max3 (select A (+ k 1))) (< j M) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (= (select A i) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (< j M) (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (< (select A k) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (< max3 (select A (+ k 1))) (< j M) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1) (< max3 (select A (+ 2 k)))) (or (< (select A k) (select A (+ 2 k))) (< j M) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (= (select A i) (select A k)) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (= (select A i) (select A (+ 2 k))) (<= (select A (+ 2 k)) (select A k)) (< j M) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (= (select A i) (select A (+ 2 k))) (< j M) (<= (select A i) max1) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k))) (or (< max3 (select A (+ k 1))) (= (select A i) (select A (+ 2 k))) (< j M) (<= (select A i) max1) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< max3 (select A (+ k 1))) (< j M) (= max3 0) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< max3 (select A (+ 2 k)))) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (< max3 (select A (+ k 1))) (< j M) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A i) max1) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k))) (or (< max3 (select A (+ k 1))) (< j M) (<= (select A i) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (< max3 (select A (+ 2 k))) (= (select A i) max3)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< j M) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= (+ max1 1) (select A i))) (or (< max3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (< max3 (select A (+ 2 k)))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= (+ max1 1) (select A i))) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0))), 19558#(and (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= max3 0) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= 0 max2) (< i N)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= 0 max2) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (< i N)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= 0 max2) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (< i N)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= max3 0) (< max3 (select A k)) (= max3 max1) (< i N))), 19577#(and (or (< j M) (= i max1)) (or (< j M) (<= (select A i) max1) (= (select A i) max3)) (or (< j M) (= i max3) (<= (+ max1 1) (select A i))) (or (<= (+ i 1) k) (< j M)) (or (< j M) (= i max2)) (or (< j M) (= max3 0) (<= (+ max1 1) (select A i)))), 19560#(and (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2)) (or (< max3 (select A (+ k 1))) (= max3 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max3 max1) (< max3 (select A (+ 2 k)))) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (= (select A (+ 2 k)) max1)) (or (< (select A k) (select A (+ 2 k))) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (= max3 0) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< max3 (select A (+ 2 k)))) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< max3 (select A (+ k 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (< (select A k) (select A (+ 2 k))) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k))) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< max3 (select A (+ k 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< max3 (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1) (< max3 (select A (+ 2 k)))) (or (< max3 (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< max3 (select A (+ 2 k)))) (or (< max3 (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2))), 19574#(and (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (<= (+ max1 1) (select A (+ i 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< j M) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max1 1) (select A (+ i 1))) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (<= (+ (select A i) 1) (select A (+ i 1))) (<= (select A i) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A i) max3)) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ i 1))) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (= (select A i) (select A k)) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (< (+ 2 i) N) (< j M) (<= N (+ 2 k)) (<= (select A (+ (- 1) N)) max1) (< (+ 3 k) N) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (= (select A k) (select A (+ i 1))) (< j M) (<= (select A (+ i 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (<= (+ max1 1) (select A (+ i 1))) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (= (select A (+ 2 k)) max1)) (or (< j M) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (= (select A k) (select A (+ i 1))) (< j M) (<= (select A i) max1) (<= (select A (+ i 1)) (select A i)) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< j M) (<= (select A i) max1) (= max3 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (= max3 0) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (<= 0 max2)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k))) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (< max3 (select A k))) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max3 (select A (+ i 1))) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max1 1) (select A (+ i 1))) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (<= (+ max1 1) (select A (+ i 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (<= 0 max2)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (= max3 0) (<= (+ max1 1) (select A (+ i 1))) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (< max3 (select A k)) (= max3 max1) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k))) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (= (select A (+ 2 k)) max1))), 19567#(and (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< k N) (<= (+ max2 1) max1) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (< (+ 2 i) N) (<= (select A i) max1) (< k N) (<= (+ max2 1) max3)) (or (< k N) (<= (+ 2 i) N)) (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< k N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i))) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< k N) (<= (+ max2 1) max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (< (+ 2 i) N) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (< k N) (= (select A i) max3)) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< k N) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (= max3 0) (< k N) (<= (+ max2 1) max1) (<= (+ max1 1) (select A i))) (or (< (+ 2 i) N) (< k N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1))), 19559#(and (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= 0 max2) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (< (+ 2 k) N) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= (+ 2 i) N) (< max3 (select A k))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= max3 0) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (<= (select A i) max1) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= max3 0) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< j M) (<= (select A i) max1) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (< max3 (select A k))) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= (+ max1 1) (select A i)))), 19551#(and (or (< j M) (= max3 0) (<= (+ 2 i) N) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< j M) (<= (+ 2 i) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (= max3 0) (<= (+ 2 i) N) (<= (+ max2 1) max3)) (or (< j M) (<= (select A i) max1) (<= (+ 2 i) N) (= (select A i) max3)) (or (< j M) (<= (+ 2 i) N) (<= 0 max2) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< j M) (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (<= (+ 2 i) N) (= max2 max1))), 19546#(and (or (< j M) (= max3 0) (< k N) (<= (+ max2 1) max3)) (or (< j M) (= max3 0) (< k N) (= max3 max1)) (or (< j M) (< k N) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (< k N) (<= 0 max2) (= max3 max1))), 19547#(and (or (< j M) (<= (+ i 1) N) (<= 0 max2) (= max3 max1)) (or (< j M) (= max3 0) (<= (+ i 1) N) (= max3 max1)) (or (< j M) (<= (+ i 1) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (= max3 0) (<= (+ i 1) N) (<= (+ max2 1) max3))), 19543#(and (or (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (< k N) (<= (+ 2 i) N) (= max2 max1)) (or (<= (select A i) max1) (< k N) (<= (+ 2 i) N) (= (select A i) max3)) (or (= max3 0) (< k N) (<= (+ 2 i) N) (<= (+ max2 1) max3)) (or (= max3 0) (< k N) (<= (+ 2 i) N) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< k N) (<= (+ 2 i) N) (<= 0 max2) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< k N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (= max2 max1))), 19552#(and (or (< j M) (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (< k N) (<= (+ 2 i) N) (= max2 max1)) (or (< j M) (<= (select A i) max1) (< k N) (<= (+ 2 i) N) (= (select A i) max3)) (or (< j M) (= max3 0) (< k N) (<= (+ 2 i) N) (<= (+ max2 1) max3)) (or (< j M) (= max3 0) (< k N) (<= (+ 2 i) N) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< j M) (< k N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (< k N) (<= (+ 2 i) N) (<= 0 max2) (= max3 max1) (<= (+ max1 1) (select A i)))), 19575#(and (or (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (< (+ 3 i) N) (<= (+ (select A i) 1) (select A (+ (- 2) N))) (= (select A i) max3)) (or (< j M) (< (+ 3 i) N) (= i max2)) (or (< j M) (= i max1) (< (+ 3 i) N)) (or (< j M) (<= (+ max1 1) (select A (+ (- 2) N))) (< (+ 3 i) N) (= max3 0) (<= (+ max1 1) (select A i)) (<= (+ i 1) (select A (+ (- 1) N)))) (or (<= 0 i) (< j M) (<= (+ max1 1) (select A (+ (- 2) N))) (< (+ 3 i) N) (<= (+ max1 1) (select A i)) (<= (+ i 1) (select A (+ (- 1) N)))) (or (<= (+ 3 i) N) (< j M)) (or (<= (+ (select A (+ (- 2) N)) 1) (select A (+ (- 1) N))) (= (select A (+ (- 2) N)) max3) (<= (select A (+ (- 2) N)) (select A i)) (< j M) (< (+ 3 i) N) (<= (select A (+ (- 2) N)) i)) (or (= max3 (select A (+ (- 1) N))) (< j M) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (< (+ 3 i) N) (<= (select A (+ (- 1) N)) (select A i)) (<= (select A (+ (- 1) N)) i))), 19545#(and (or (< j M) (= max3 0) (= max3 max1)) (or (< j M) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (= max3 0) (<= (+ max2 1) max3)) (or (< j M) (<= 0 max2) (= max3 max1))), 19563#(and (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (= (select A (+ 2 k)) max1)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< j M) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< max3 (select A (+ k 1))) (< j M) (= max3 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max3 max1) (< max3 (select A (+ 2 k)))) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k))) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1) (< max3 (select A (+ 2 k)))) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2)) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (< max3 (select A (+ k 1))) (< j M) (= max3 0) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< max3 (select A (+ 2 k)))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k))) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< max3 (select A (+ 2 k)))) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2)) (or (< max3 (select A (+ k 1))) (< j M) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< (select A k) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (< (select A k) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)))), 19564#(and (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< j M) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (< i N) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< i N) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (< j M) (= max3 0) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (< max3 (select A (+ 2 k)))) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (= max2 max1)) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< i N) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (= max2 max1) (< max3 (select A (+ 2 k)))) (or (< max3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< i N) (< max3 (select A (+ 2 k)))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< i N) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (< j M) (= max3 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max3 max1) (< i N) (< max3 (select A (+ 2 k)))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (= max2 max1)) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< i N)) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (< i N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< i N)) (or (< max3 (select A (+ k 1))) (< j M) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (< i N)) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (= max2 max1)) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< i N)) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (= max2 max1)) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (< i N) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< i N)) (or (< (select A k) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (< max3 (select A (+ k 1))) (< j M) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (< i N) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (< i N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N)) (or (< max3 (select A (+ k 1))) (< j M) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (< i N) (= (select A (+ 2 k)) max1)) (or (< (select A k) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (= max2 max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< i N) (= (select A (+ 2 k)) max1))), 19541#(and (or (not (< k N)) (= max3 0) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k))) (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= 0 max2)) (or (not (< k N)) (= max1 (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N)) (or (not (< k N)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (= max3 0) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1)) (or (not (< k N)) (<= (+ max2 1) (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N)) (or (not (< k N)) (< (+ k 1) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1))), 19570#(and (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (= max3 0) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (= (select A k) (select A (+ i 1))) (<= (select A (+ i 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N)) (or (< (+ 2 i) N) (<= N (+ 2 k)) (<= (select A (+ (- 1) N)) max1) (< (+ 3 k) N) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1)) (or (<= (+ 3 i) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (< max3 (select A k))) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max1 1) (select A (+ i 1))) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (<= (+ (select A i) 1) (select A (+ i 1))) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (= (select A i) (select A k)) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k))) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (= max3 0) (<= (+ max1 1) (select A (+ i 1))) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (< max3 (select A k)) (= max3 max1) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k))) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (<= (select A i) max1) (= max3 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (<= 0 max2)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (= (select A k) (select A (+ i 1))) (<= (select A i) max1) (<= (select A (+ i 1)) (select A i)) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (<= (+ (select A i) 1) (select A (+ i 1))) (<= (select A i) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A i) max3)) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (+ 3 i) N) (<= (select A (+ i 1)) max1) (= max3 (select A (+ i 1))) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (<= 0 max2)) (or (<= (+ 3 i) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max1 1) (select A (+ i 1))) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1))), 19549#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< j M) (= max3 0) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k))) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1)) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= 0 max2)) (or (not (< k N)) (= max1 (select A k)) (< j M) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N)) (or (not (< k N)) (< j M) (= max3 0) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1))), 19561#(and (or (< max3 (select A (+ k 1))) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< i N) (< max3 (select A (+ 2 k)))) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< i N)) (or (< max3 (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (< max3 (select A (+ k 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (< i N) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (< (select A k) (select A (+ 2 k))) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< i N) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (= max2 max1) (< max3 (select A (+ 2 k)))) (or (< max3 (select A (+ k 1))) (= max3 0) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (< max3 (select A (+ 2 k)))) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (= max2 max1)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< i N)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< i N) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (= max3 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max3 max1) (< i N) (< max3 (select A (+ 2 k)))) (or (< max3 (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (< i N)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (< i N) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (< i N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< i N) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (= max2 max1)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< i N)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (< i N)) (or (< max3 (select A (+ k 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (< i N) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< i N) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< i N)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (< i N) (= (select A (+ 2 k)) max1)) (or (< (select A k) (select A (+ 2 k))) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (= max2 max1))), 19539#(and (or (< k N) (<= 0 max2) (= max3 max1)) (or (= max3 0) (< k N) (<= (+ max2 1) max3)) (or (< k N) (<= (+ max2 1) max3) (= max2 max1)) (or (= max3 0) (< k N) (= max3 max1))), 19553#(and (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< j M) (= max3 0) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k))) (or (not (< k N)) (< j M) (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (<= (select A i) max1) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (= max3 0) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< j M) (<= (select A i) max1) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (= max1 (select A k)) (< j M) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1))), 19544#(and (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (not (< k N)) (= max1 (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (<= (select A i) max1) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1)) (or (not (< k N)) (<= (select A i) max1) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (not (< k N)) (= max3 0) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (not (< k N)) (= max3 0) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k))) (or (not (< k N)) (<= (+ max2 1) (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N))), 19540#(and (or (< k N) (<= (+ max2 1) max3) (< i N) (= max2 max1)) (or (= max3 0) (< k N) (= max3 max1) (< i N)) (or (= max3 0) (< k N) (<= (+ max2 1) max3) (< i N)) (or (< k N) (<= 0 max2) (= max3 max1) (< i N))), 19542#(and (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (< i N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= 0 max2) (< i N)) (or (not (< k N)) (= max3 0) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N)) (or (not (< k N)) (< (+ k 1) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< i N)) (or (not (< k N)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (not (< k N)) (= max3 0) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (< i N)) (or (not (< k N)) (<= (+ max2 1) (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N) (< i N)) (or (not (< k N)) (= max1 (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N) (< i N)))] [2022-03-15 22:06:30,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 22:06:30,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:30,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 22:06:30,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=3779, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 22:06:30,078 INFO L87 Difference]: Start difference. First operand 727 states and 2790 transitions. Second operand has 51 states, 50 states have (on average 2.8) internal successors, (140), 50 states have internal predecessors, (140), 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 22:06:37,728 WARN L228 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 281 DAG size of output: 240 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 22:07:18,570 WARN L228 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 340 DAG size of output: 153 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 22:07:27,216 WARN L228 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 198 DAG size of output: 189 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 22:10:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:10:07,786 INFO L93 Difference]: Finished difference Result 1304 states and 4500 transitions. [2022-03-15 22:10:07,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2022-03-15 22:10:07,786 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.8) internal successors, (140), 50 states have internal predecessors, (140), 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 22:10:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:10:07,791 INFO L225 Difference]: With dead ends: 1304 [2022-03-15 22:10:07,791 INFO L226 Difference]: Without dead ends: 1277 [2022-03-15 22:10:07,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16729 ImplicationChecksByTransitivity, 224.3s TimeCoverageRelationStatistics Valid=7145, Invalid=41475, Unknown=0, NotChecked=0, Total=48620 [2022-03-15 22:10:07,794 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 761 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 2970 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:10:07,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 0 Invalid, 3111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2970 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 22:10:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2022-03-15 22:10:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 814. [2022-03-15 22:10:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 3.896678966789668) internal successors, (3168), 813 states have internal predecessors, (3168), 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 22:10:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 3168 transitions. [2022-03-15 22:10:07,810 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 3168 transitions. Word has length 17 [2022-03-15 22:10:07,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:10:07,810 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 3168 transitions. [2022-03-15 22:10:07,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.8) internal successors, (140), 50 states have internal predecessors, (140), 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 22:10:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 3168 transitions. [2022-03-15 22:10:07,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:10:07,814 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:10:07,814 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:10:07,830 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 22:10:08,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:10:08,030 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:10:08,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:10:08,030 INFO L85 PathProgramCache]: Analyzing trace with hash -633677775, now seen corresponding path program 9 times [2022-03-15 22:10:08,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:10:08,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129146583] [2022-03-15 22:10:08,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:10:08,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:10:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:10:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:10:08,085 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:10:08,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129146583] [2022-03-15 22:10:08,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129146583] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:10:08,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597681484] [2022-03-15 22:10:08,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:10:08,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:10:08,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:10:08,112 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 22:10:08,113 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 22:10:08,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:10:08,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:10:08,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:10:08,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:10:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:10:08,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:10:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:10:08,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597681484] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:10:08,226 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:10:08,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-03-15 22:10:08,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1484722013] [2022-03-15 22:10:08,226 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:10:08,227 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:10:08,233 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:10:08,233 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:10:08,667 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [22938#(or (<= N (+ i 1)) (< (+ 2 i) N)), 22946#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 22947#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 22936#(< i N), 22945#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N 1) k)), 22939#(or (<= (+ N 1) k) (< i N)), 22943#(or (<= N i) (< (+ i 1) N) (<= N k)), 22937#(or (<= N i) (< (+ i 1) N)), 22940#(or (<= N k) (< i N)), 22941#(or (<= N (+ k 1)) (< i N)), 22944#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 22942#(or (<= N i) (< (+ i 1) N) (<= (+ N 1) k))] [2022-03-15 22:10:08,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:10:08,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:10:08,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:10:08,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:10:08,668 INFO L87 Difference]: Start difference. First operand 814 states and 3168 transitions. Second operand has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 21 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 22:10:09,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:10:09,224 INFO L93 Difference]: Finished difference Result 1409 states and 5086 transitions. [2022-03-15 22:10:09,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:10:09,224 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 21 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) Word has length 17 [2022-03-15 22:10:09,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:10:09,229 INFO L225 Difference]: With dead ends: 1409 [2022-03-15 22:10:09,229 INFO L226 Difference]: Without dead ends: 1345 [2022-03-15 22:10:09,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1114, Invalid=3442, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 22:10:09,230 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:10:09,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:10:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2022-03-15 22:10:09,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 740. [2022-03-15 22:10:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 3.8403247631935047) internal successors, (2838), 739 states have internal predecessors, (2838), 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 22:10:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 2838 transitions. [2022-03-15 22:10:09,246 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 2838 transitions. Word has length 17 [2022-03-15 22:10:09,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:10:09,246 INFO L470 AbstractCegarLoop]: Abstraction has 740 states and 2838 transitions. [2022-03-15 22:10:09,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 21 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 22:10:09,246 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 2838 transitions. [2022-03-15 22:10:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:10:09,248 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:10:09,248 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:10:09,263 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 22:10:09,462 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,SelfDestructingSolverStorable17 [2022-03-15 22:10:09,463 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:10:09,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:10:09,463 INFO L85 PathProgramCache]: Analyzing trace with hash -789180409, now seen corresponding path program 7 times [2022-03-15 22:10:09,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:10:09,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218011562] [2022-03-15 22:10:09,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:10:09,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:10:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:10:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:10:10,410 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:10:10,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218011562] [2022-03-15 22:10:10,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218011562] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:10:10,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120552673] [2022-03-15 22:10:10,410 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:10:10,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:10:10,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:10:10,411 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 22:10:10,412 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 22:10:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:10:10,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 22:10:10,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:10:11,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:10:11,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:10:11,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:10:11,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:10:11,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:10:11,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:10:11,336 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 117 [2022-03-15 22:10:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:10:11,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:10:15,303 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 22:10:15,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1655 treesize of output 975 [2022-03-15 22:14:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:18,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120552673] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:18,360 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:18,360 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-03-15 22:14:18,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [845734838] [2022-03-15 22:14:18,360 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:18,361 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:18,369 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 219 transitions. [2022-03-15 22:14:18,369 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:00,850 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 48 new interpolants: [26063#(and (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (= max1 0) (< (+ 2 k) N) (<= (+ (select A i) max2) (+ (select A (+ k 1)) max1)) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (= (select A i) max3)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (= max1 0) (< (+ 2 k) N) (<= (+ (select A i) max2) (+ (select A (+ k 1)) max1)) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (< max3 (select A k))) (or (<= N (+ k 1)) (< j M) (< (select A k) (select A (+ k 1))) (= max1 0) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N) (<= (+ (select A i) max2) (+ max1 (select A k)))) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N) (<= (select A k) max2)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (<= (select A i) max1) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N) (not (= (select A i) max1))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (<= (+ 2 max2) max3) (< j M) (<= (select A i) max1) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (<= (+ (select A i) max2) (+ max3 max1)) (< j M) (= max1 0) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (< (+ 2 k) N) (<= (+ 2 max2) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (not (= (select A i) max1))) (or (<= N (+ k 1)) (< j M) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= (+ 2 max2) (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (not (= (select A i) max1)) (= (select A i) max3)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k))) (or (<= N (+ k 1)) (< j M) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (< max3 (select A k)) (not (= (select A i) max1))) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< j M) (<= (select A i) max1) (< (+ 2 k) N) (<= (+ 2 max2) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (select A i) max1) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (< max3 (select A k))) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1))), 26067#(and (or (<= (+ max2 (select A (+ (- 1) N))) (+ max3 max1)) (< (+ 2 i) N) (< j M) (< k N) (not (= max1 (select A (+ (- 1) N))))) (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< k N) (<= (select A (+ (- 1) N)) (select A i))) (or (<= (+ (select A i) max2 1) (+ max3 max1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< k N) (= (select A i) max3)) (or (< (+ 2 i) N) (< j M) (<= (+ max3 1) max2) (= max1 0) (< k N) (<= (+ max3 max1) (+ max2 (select A (+ (- 1) N)))) (<= (+ max3 max1) (+ (select A i) max2))) (or (<= (+ max2 (select A (+ (- 1) N))) (+ max3 max1)) (< (+ 2 i) N) (< j M) (= max1 0) (< k N)) (or (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (< k N) (= (select A i) max3)) (or (<= (+ (select A i) max2) (+ max3 max1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< k N)) (or (< (+ 2 i) N) (< j M) (< k N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (< j M) (< k N) (<= (+ 2 i) N)) (or (< (+ 2 i) N) (< j M) (<= (+ max3 1) max2) (< k N) (= max3 max1) (<= (+ max1 1) (select A i)) (<= (+ max3 max1) (+ max2 (select A (+ (- 1) N))))) (or (<= (select A (+ (- 1) N)) 0) (<= (+ max2 (select A (+ (- 1) N))) (+ max3 max1)) (< (+ 2 i) N) (< j M) (< k N) (<= (+ max1 1) (select A i)))), 26033#(and (or (< j M) (<= (+ i 1) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (<= (+ i 1) N) (= max3 max1) (<= max3 max2))), 26071#(and (or (< j M) (< (+ 3 i) N) (<= (+ i (select A (+ (- 1) N))) max3) (not (= max1 (select A (+ (- 1) N)))) (<= (+ max1 1) (select A i))) (or (< j M) (= max1 0) (< (+ 3 i) N) (<= (+ max1 1) (select A i))) (or (= max3 (select A (+ (- 1) N))) (<= max3 (select A (+ (- 2) N))) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (= i max3)) (or (< j M) (< (+ 3 i) N) (<= (+ max1 1) (select A i)) (= i max2)) (or (<= (select A (+ (- 1) N)) max3) (< j M) (<= (select A i) max1) (< (+ 3 i) N)) (or (= (select A (+ (- 2) N)) max3) (< j M) (< (+ 3 i) N) (<= (select A (+ (- 2) N)) i) (<= (+ (select A (+ (- 2) N)) 1) max3)) (or (< j M) (< (+ 3 i) N) (<= max3 (+ i (select A (+ (- 1) N)))) (= max3 max1) (<= (+ i 1) (select A (+ (- 2) N))) (<= (+ max1 1) (select A i))) (or (< j M) (= i max1) (< (+ 3 i) N)) (or (<= (select A (+ (- 1) N)) 0) (< j M) (< (+ 3 i) N) (<= (+ i (select A (+ (- 1) N))) max3) (<= (+ max1 1) (select A i))) (or (<= (+ 3 i) N) (< j M)) (or (< j M) (<= (select A i) max1) (< (+ 3 i) N) (= (select A i) max2)) (or (< j M) (< (+ 3 i) N) (<= (select A (+ (- 2) N)) (+ i max3)) (<= (select A (+ (- 2) N)) i) (not (= max2 0)) (<= (+ (select A (+ (- 2) N)) 1) max3)) (or (= max3 (select A (+ (- 1) N))) (= (select A (+ (- 2) N)) max3) (< j M) (< (+ 3 i) N) (<= (select A (+ (- 2) N)) i))), 26032#(and (or (< j M) (= max3 max1) (<= max3 max2)) (or (< j M) (<= (+ max2 1) max3) (= max2 max1))), 26037#(and (or (< k N) (= max3 max1) (<= max3 max2)) (or (< k N) (<= (+ max2 1) max3) (= max2 max1))), 26075#(and (or (<= N (+ k 1)) (< (+ 2 i) N) (< j M) (<= (+ max3 1) max2) (= max1 0) (< (+ 2 k) N) (<= (+ max3 max1) (+ max2 (select A (+ (- 1) N)))) (<= (+ max3 max1) (+ (select A i) max2))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= max3 (select A (+ i 1))) (not (< max1 (select A i))) (< max3 (select A k)) (= (select A i) max3)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= max3 (select A (+ i 1))) (< max1 (select A i)) (<= max3 max2)) (or (<= N (+ k 1)) (<= (+ max2 (select A (+ (- 1) N))) (+ (select A (+ k 1)) max1)) (< (+ 2 i) N) (< j M) (= max1 0) (< (+ 2 k) N)) (or (<= N (+ k 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (+ (select A i) max2 1) (+ (select A (+ k 1)) max1)) (< (+ 2 k) N)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (+ (select A (+ k 1)) max1) (+ max2 (select A (+ (- 1) N)))) (< (+ 2 i) N) (< j M) (= max1 0) (< (+ 2 k) N)) (or (<= N (+ k 1)) (< (+ 2 i) N) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (+ (select A i) max2) (+ max1 (select A k)))) (or (<= N (+ k 1)) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (<= (+ max1 1) (select A i)) (= max2 max1))), 26059#(and (or (< (+ j 1) M) (<= (select A i) max1) (not (< j M)) (<= (+ 2 i) N) (= (select A i) max3)) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (<= (+ 2 i) N) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (<= (+ 2 i) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< (+ j 1) M) (<= (+ (select A i) (select A j)) (+ max3 max1)) (= max1 0) (not (< j M)) (<= (+ 2 i) N) (= (select A i) max3)) (or (< (+ j 1) M) (<= (+ (select A j) 2) max3) (<= (select A i) max1) (not (< j M)) (<= (+ 2 i) N) (= (select A j) max1)) (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N) (not (= (select A i) max1)) (= (select A i) max3)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (<= (+ 2 i) N) (= (select A j) max1) (= max3 max1) (<= (+ max1 1) (select A i))) (or (<= (+ (select A i) max2) (+ max3 max1)) (< (+ j 1) M) (= max1 0) (not (< j M)) (<= (+ 2 i) N) (= (select A i) max3)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (<= (+ 2 i) N) (= max3 max1) (<= max3 (select A j)) (= (select A i) max3)) (or (< (+ j 1) M) (<= (+ 2 max2) max3) (<= (select A i) max1) (not (< j M)) (<= (+ 2 i) N) (= max2 max1)) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (<= (+ 2 i) N) (= max3 max1) (<= max3 max2) (= (select A i) max3)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (<= (+ 2 i) N) (<= (+ (select A j) 1) max3) (= (select A j) max1))), 26046#(and (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (< i N) (= max2 max1)) (or (not (< k N)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N)) (or (not (< k N)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2) (< i N))), 26074#(and (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) 1) (select A (+ i 1))) (<= (select A i) max1) (< k N) (<= M j) (= (select A i) max3)) (or (< (+ j 1) M) (< (+ 2 i) N) (= max1 0) (not (< j M)) (< k N) (<= (+ (select A j) (select A (+ (- 1) N))) (+ max3 max1))) (or (<= (+ 3 i) N) (< (+ j 1) M) (= max3 (select A (+ i 1))) (not (< j M)) (< k N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (< (+ j 1) M) (not (< max2 (select A j))) (< (+ 2 i) N) (not (< j M)) (< k N) (= (select A j) max1) (<= (+ max1 1) (select A i))) (or (<= (+ (select A i) max2) (+ max3 max1)) (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (not (< j M)) (< k N)) (or (< (+ j 1) M) (< (+ 2 i) N) (<= (+ max3 1) max2) (= max1 0) (not (< j M)) (< max2 (select A j)) (< k N) (<= (+ max3 max1) (+ max2 (select A (+ (- 1) N)))) (<= (+ max3 max1) (+ (select A i) max2))) (or (<= (+ 3 i) N) (< (+ j 1) M) (not (= max1 (select A (+ i 1)))) (= max3 (select A (+ i 1))) (not (< j M)) (< k N) (< max1 (select A i))) (or (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (< max2 (select A j)) (< k N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= (select A j) max2) (<= (+ 3 i) N) (< (+ j 1) M) (= max3 (select A (+ i 1))) (< k N) (< max1 (select A i)) (<= max3 (select A j)) (<= M j)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (select A (+ i 1)) max1) (= max3 (select A (+ i 1))) (not (< j M)) (< k N) (< max1 (select A i))) (or (<= (+ max3 max1) (+ (select A j) (select A (+ (- 1) N)))) (< (+ j 1) M) (<= (+ max3 max1) (+ (select A i) (select A j))) (not (< max2 (select A j))) (< (+ 2 i) N) (= max1 0) (not (< j M)) (<= (+ max3 1) (select A j)) (< k N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (= max3 (select A (+ i 1))) (< max2 (select A j)) (< k N) (< max1 (select A i)) (<= max3 max2) (<= M j)) (or (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (<= (+ (select A i) (select A j)) (+ max3 max1)) (not (< j M)) (< k N)) (or (<= (+ max2 (select A (+ (- 1) N))) (+ max3 max1)) (< (+ j 1) M) (< (+ 2 i) N) (= max1 0) (not (< j M)) (< k N)) (or (< (+ j 1) M) (not (< j M)) (< k N) (<= (+ 2 i) N)) (or (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (<= (+ (select A i) (select A j) 1) (+ max3 max1)) (not (< j M)) (< k N) (= (select A i) max3)) (or (<= (+ (select A i) max2 1) (+ max3 max1)) (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (not (< j M)) (< k N) (= (select A i) max3))), 26039#(and (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< k N) (= max3 max1) (<= max3 max2)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (= max3 max1) (<= max3 (select A j))) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< k N) (<= (+ max2 1) max3) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (<= (+ (select A j) 1) max3) (= (select A j) max1))), 26051#(and (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N)) (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (select A k) max2) (< i N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (< i N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1))), 26054#(and (or (<= N (+ k 1)) (< (+ j 1) M) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (< max2 (select A j)) (<= (select A k) max3) (<= (select A k) max2) (< i N) (<= M j)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ j 1) M) (< (+ 2 k) N) (< max2 (select A j)) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A (+ k 1)) max2) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (< max2 (select A j)) (= (select A (+ k 1)) max1) (< max3 (select A k)) (< i N) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (= (select A j) max1) (<= (+ (select A j) 1) (select A k)) (< i N) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< max3 (select A (+ k 1))) (< (+ j 1) M) (< (+ 2 k) N) (<= (+ (select A j) 1) max3) (= (select A j) max1) (< max3 (select A k)) (< i N) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A (+ k 1)) max2) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (< max2 (select A j)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (< i N) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (<= (+ (select A j) 1) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (= (select A j) max1) (< i N) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (<= (+ (select A j) 1) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A j) max1) (< max3 (select A k)) (< i N) (<= M j)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ j 1) M) (< (+ 2 k) N) (< max2 (select A j)) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max2 (select A j)) (< max3 (select A k)) (< i N) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (<= (select A (+ k 1)) (select A j)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k)) (< i N) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (< max2 (select A j)) (<= (select A k) max3) (< i N) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (< max2 (select A j)) (<= (select A k) max3) (< i N) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N) (<= M j) (<= (select A k) (select A j))) (or (<= N (+ k 1)) (<= (select A j) max2) (< max3 (select A (+ k 1))) (< (+ j 1) M) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (< i N) (<= max3 (select A j)) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (<= (select A (+ k 1)) (select A j)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (< i N) (<= M j))), 26066#(and (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (<= (select A (+ (- 1) N)) (select A i))) (or (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (= (select A i) max3)) (or (< (+ 2 i) N) (< j M) (<= (+ max3 1) max2) (= max3 max1) (<= (+ max1 1) (select A i)) (<= (+ max3 max1) (+ max2 (select A (+ (- 1) N))))) (or (<= (+ (select A i) max2) (+ max3 max1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1)) (or (< (+ 2 i) N) (< j M) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (< j M) (<= (+ 2 i) N)) (or (<= (select A (+ (- 1) N)) 0) (<= (+ max2 (select A (+ (- 1) N))) (+ max3 max1)) (< (+ 2 i) N) (< j M) (<= (+ max1 1) (select A i))) (or (< (+ 2 i) N) (< j M) (<= (+ max3 1) max2) (= max1 0) (<= (+ max3 max1) (+ max2 (select A (+ (- 1) N)))) (<= (+ max3 max1) (+ (select A i) max2))) (or (<= (+ max2 (select A (+ (- 1) N))) (+ max3 max1)) (< (+ 2 i) N) (< j M) (= max1 0)) (or (<= (+ max2 (select A (+ (- 1) N))) (+ max3 max1)) (< (+ 2 i) N) (< j M) (not (= max1 (select A (+ (- 1) N))))) (or (<= (+ (select A i) max2 1) (+ max3 max1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= (select A i) max3))), 26064#(and (or (<= N (+ k 1)) (< (+ j 1) M) (= max1 0) (< (+ 2 k) N) (<= (+ (select A i) max2) (+ (select A (+ k 1)) max1)) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (< max3 (select A k)) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (< max2 (select A j)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= (+ max1 1) (select A i)) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (< max2 (select A j)) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ (select A i) (select A j)) (+ max1 (select A k))) (< (select A k) (select A (+ k 1))) (= max1 0) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (<= (select A (+ k 1)) (select A j)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (<= (+ (select A j) 2) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (= (select A j) max1) (<= M j)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ j 1) M) (<= (+ 2 max2) max3) (<= (select A i) max1) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< max3 (select A (+ k 1))) (< (+ j 1) M) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (+ (select A j) 1) max3) (= (select A j) max1) (< max3 (select A k)) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A i) max1) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (= (select A j) max1) (< max3 (select A k)) (<= (+ (select A j) 2) (select A (+ k 1))) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max2 (select A j)) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (= (select A j) max1) (<= (+ (select A j) 2) (select A (+ k 1))) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (= (select A j) max1) (<= (+ max1 1) (select A i)) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N) (<= M j) (not (= (select A i) max1))) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (< max2 (select A j)) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< max3 (select A (+ k 1))) (< (+ j 1) M) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= max3 (select A j)) (<= M j) (= (select A i) max3)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (= max1 0) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (+ (select A i) (select A j)) (+ (select A (+ k 1)) max1)) (<= (select A k) max3) (<= (+ 2 i) N) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A i) max1) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (< max3 (select A k)) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (= (select A j) max1) (<= (+ max1 1) (select A i)) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (= max1 0) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= (+ (select A i) (select A j)) (+ (select A (+ k 1)) max1)) (<= (+ 2 i) N) (< max3 (select A k)) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A i) max1) (< (+ 2 k) N) (<= (+ 2 max2) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A (+ k 1)) max2) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (< max2 (select A j)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= M j)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ j 1) M) (< (+ 2 k) N) (< max2 (select A j)) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (< max2 (select A j)) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (< max2 (select A j)) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N) (<= (select A k) max2) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (<= (select A (+ k 1)) (select A j)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k)) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (<= (+ (select A j) 1) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (= (select A j) max1) (<= M j)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ j 1) M) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= M j) (not (= (select A i) max1)) (= (select A i) max3)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (<= M j) (not (= (select A i) max1))) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N) (<= M j) (<= (select A k) (select A j))) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (= (select A j) max1) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (<= (+ (select A j) 1) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (= (select A j) max1) (< max3 (select A k)) (<= M j)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (<= (+ (select A i) max2) (+ max3 max1)) (< (+ j 1) M) (= max1 0) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= M j) (= (select A i) max3)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A (+ k 1)) max2) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (< max2 (select A j)) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k)) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< max3 (select A (+ k 1))) (< (+ j 1) M) (< (+ 2 k) N) (<= (+ 2 i) N) (= (select A j) max1) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (<= M j)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ j 1) M) (<= (+ (select A i) (select A j)) (+ max3 max1)) (= max1 0) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= M j) (= (select A i) max3)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= (+ 2 max2) (select A k)) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (= (select A j) max1) (<= (+ (select A j) 1) (select A k)) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (< max3 (select A k)) (<= M j) (not (= (select A i) max1))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ j 1) M) (<= (+ (select A j) 2) max3) (<= (select A i) max1) (< (+ 2 k) N) (<= (+ 2 i) N) (= (select A j) max1) (< max3 (select A k)) (<= M j)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ j 1) M) (< (+ 2 k) N) (< max2 (select A j)) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (< max2 (select A j)) (<= (select A k) max3) (<= (+ 2 i) N) (<= (+ max1 1) (select A i)) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (< (+ 2 k) N) (<= (+ 2 max2) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ j 1) M) (<= (select A i) max1) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= M j) (= (select A i) max3)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ j 1) M) (< (+ 2 k) N) (< max2 (select A j)) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (<= M j) (= (select A i) max3)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (= max1 0) (< (+ 2 k) N) (<= (+ (select A i) max2) (+ (select A (+ k 1)) max1)) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (select A k) (select A (+ k 1))) (= max1 0) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N) (<= M j) (<= (+ (select A i) max2) (+ max1 (select A k))))), 26049#(and (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k))) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1)) (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (select A k) max2))), 26034#(and (or (< j M) (<= (+ 2 i) N) (not (= (select A i) max1)) (= (select A i) max3)) (or (< j M) (<= (+ 2 i) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (<= (+ 2 i) N) (= max3 max1) (<= max3 max2) (= (select A i) max3)) (or (<= (+ (select A i) max2) (+ max3 max1)) (< j M) (= max1 0) (<= (+ 2 i) N) (= (select A i) max3)) (or (< j M) (<= (+ 2 i) N) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (< j M) (<= (select A i) max1) (<= (+ 2 i) N) (= (select A i) max3)) (or (<= (+ 2 max2) max3) (< j M) (<= (select A i) max1) (<= (+ 2 i) N) (= max2 max1))), 26057#(and (or (<= (+ (select A i) max2) (+ max3 max1)) (< j M) (= max1 0) (< k N) (<= (+ 2 i) N) (= (select A i) max3)) (or (<= (+ 2 max2) max3) (< j M) (<= (select A i) max1) (< k N) (<= (+ 2 i) N) (= max2 max1)) (or (< j M) (<= (select A i) max1) (< k N) (<= (+ 2 i) N) (= (select A i) max3)) (or (< j M) (< k N) (<= (+ 2 i) N) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (< j M) (< k N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (< k N) (<= (+ 2 i) N) (= max3 max1) (<= max3 max2) (= (select A i) max3)) (or (< j M) (< k N) (<= (+ 2 i) N) (not (= (select A i) max1)) (= (select A i) max3))), 26047#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (< i N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2) (< i N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N))), 26076#(and (or (< (+ j 1) M) (= i max1) (not (< j M)) (< (+ 3 i) N)) (or (< (+ j 1) M) (<= (+ i 4) N) (<= (select A (+ i 1)) max1) (= max3 (select A (+ i 1))) (<= (+ (select A (+ i 1)) 1) (select A (+ 2 i))) (<= M j)) (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< j M))) (or (< (+ j 1) M) (not (< max2 (select A j))) (<= (select A i) max1) (not (< j M)) (< (+ 3 i) N) (= (select A i) (select A j))) (or (< (+ j 1) M) (not (< j M)) (< (+ 3 i) N) (<= (select A (+ (- 2) N)) (+ i max3)) (< max2 (select A j)) (<= (select A (+ (- 2) N)) i) (not (= max2 0)) (<= (+ (select A (+ (- 2) N)) 1) max3)) (or (< (+ j 1) M) (<= (+ i 4) N) (<= (select A (+ i 1)) max1) (= (select A (+ 2 i)) max3) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or (< (+ j 1) M) (not (< j M)) (< (+ 3 i) N) (<= max3 (+ i (select A (+ (- 1) N)))) (= max3 max1) (<= (+ i 1) (select A (+ (- 2) N))) (<= (+ max1 1) (select A i))) (or (< (+ j 1) M) (<= (+ i 4) N) (not (= (select A (+ 2 i)) max1)) (= (select A (+ 2 i)) max3) (< max1 (select A (+ i 1))) (<= M j)) (or (< (+ j 1) M) (not (< max2 (select A j))) (= (select A j) i) (not (< j M)) (< (+ 3 i) N) (<= (+ max1 1) (select A i))) (or (< (+ j 1) M) (= max1 0) (not (< j M)) (< (+ 3 i) N) (<= (+ max1 1) (select A i))) (or (= max3 (select A (+ (- 1) N))) (< (+ j 1) M) (<= max3 (select A (+ (- 2) N))) (<= (select A i) max1) (not (< j M)) (< (+ 3 i) N) (= i max3)) (or (< (+ j 1) M) (not (= (select A j) 0)) (not (< max2 (select A j))) (not (< j M)) (< (+ 3 i) N) (<= (select A (+ (- 2) N)) (+ i max3)) (<= (select A (+ (- 2) N)) i) (<= (+ (select A (+ (- 2) N)) 1) max3)) (or (< (+ j 1) M) (<= (+ i 4) N) (= (select A (+ 2 i)) max3) (< max1 (select A (+ i 1))) (<= (select A (+ 2 i)) max1) (<= M j)) (or (< (+ j 1) M) (not (< j M)) (< (+ 3 i) N) (< max2 (select A j)) (<= (+ max1 1) (select A i)) (= i max2)) (or (< (+ j 1) M) (<= (select A i) max1) (not (< j M)) (< (+ 3 i) N) (< max2 (select A j)) (= (select A i) max2)) (or (<= (select A (+ (- 1) N)) max3) (< (+ j 1) M) (<= (select A i) max1) (not (< j M)) (< (+ 3 i) N))), 26060#(and (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< k N) (<= (+ 2 i) N) (= max3 max1) (<= max3 max2) (= (select A i) max3)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (<= (+ 2 i) N) (= (select A j) max1) (= max3 max1) (<= (+ max1 1) (select A i))) (or (<= (+ (select A i) max2) (+ max3 max1)) (< (+ j 1) M) (= max1 0) (not (< j M)) (< k N) (<= (+ 2 i) N) (= (select A i) max3)) (or (< (+ j 1) M) (<= (+ 2 max2) max3) (<= (select A i) max1) (not (< j M)) (< k N) (<= (+ 2 i) N) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (<= (+ 2 i) N) (<= (+ (select A j) 1) max3) (= (select A j) max1)) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< k N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< (+ j 1) M) (not (< j M)) (< k N) (<= (+ 2 i) N) (not (= (select A i) max1)) (= (select A i) max3)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (<= (+ 2 i) N) (= max3 max1) (<= max3 (select A j)) (= (select A i) max3)) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< k N) (<= (+ 2 i) N) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (< (+ j 1) M) (<= (select A i) max1) (not (< j M)) (< k N) (<= (+ 2 i) N) (= (select A i) max3)) (or (< (+ j 1) M) (<= (+ (select A j) 2) max3) (<= (select A i) max1) (not (< j M)) (< k N) (<= (+ 2 i) N) (= (select A j) max1)) (or (< (+ j 1) M) (<= (+ (select A i) (select A j)) (+ max3 max1)) (= max1 0) (not (< j M)) (< k N) (<= (+ 2 i) N) (= (select A i) max3))), 26062#(and (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (not (= (select A i) max1))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (<= (select A i) max1) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (<= (+ 2 max2) max3) (<= (select A i) max1) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (< (+ 2 k) N) (<= (+ 2 max2) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (not (= (select A i) max1)) (= (select A i) max3)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (= (select A i) max3)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (< max3 (select A k)) (not (= (select A i) max1))) (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (<= (+ (select A i) max2) (+ max3 max1)) (= max1 0) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A i) max1) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (< max3 (select A k))) (or (<= N (+ k 1)) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= (+ 2 max2) (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N) (not (= (select A i) max1))) (or (<= N (+ k 1)) (= max1 0) (< (+ 2 k) N) (<= (+ (select A i) max2) (+ (select A (+ k 1)) max1)) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (< max3 (select A k))) (or (<= N (+ k 1)) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< (select A k) (select A (+ k 1))) (= max1 0) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N) (<= (+ (select A i) max2) (+ max1 (select A k)))) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N) (<= (select A k) max2)) (or (<= N (+ k 1)) (<= (select A i) max1) (< (+ 2 k) N) (<= (+ 2 max2) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (= max1 0) (< (+ 2 k) N) (<= (+ (select A i) max2) (+ (select A (+ k 1)) max1)) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N))), 26065#(and (or (< (+ 2 i) N) (<= (+ max3 1) max2) (= max1 0) (< k N) (<= (+ max3 max1) (+ max2 (select A (+ (- 1) N)))) (<= (+ max3 max1) (+ (select A i) max2))) (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (<= (select A i) max1) (< k N) (<= (select A (+ (- 1) N)) (select A i))) (or (< k N) (<= (+ 2 i) N)) (or (<= (+ (select A i) max2) (+ max3 max1)) (< (+ 2 i) N) (<= (select A i) max1) (< k N)) (or (< (+ 2 i) N) (< k N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= (+ max2 (select A (+ (- 1) N))) (+ max3 max1)) (< (+ 2 i) N) (< k N) (not (= max1 (select A (+ (- 1) N))))) (or (< (+ 2 i) N) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (< k N) (= (select A i) max3)) (or (< (+ 2 i) N) (<= (+ max3 1) max2) (< k N) (= max3 max1) (<= (+ max1 1) (select A i)) (<= (+ max3 max1) (+ max2 (select A (+ (- 1) N))))) (or (<= (+ (select A i) max2 1) (+ max3 max1)) (< (+ 2 i) N) (<= (select A i) max1) (< k N) (= (select A i) max3)) (or (<= (select A (+ (- 1) N)) 0) (<= (+ max2 (select A (+ (- 1) N))) (+ max3 max1)) (< (+ 2 i) N) (< k N) (<= (+ max1 1) (select A i))) (or (<= (+ max2 (select A (+ (- 1) N))) (+ max3 max1)) (< (+ 2 i) N) (= max1 0) (< k N))), 26053#(and (or (<= N (+ k 1)) (<= (select A j) max2) (< max3 (select A (+ k 1))) (< (+ j 1) M) (< (+ 2 k) N) (<= (+ (select A j) 1) max3) (= (select A j) max1) (< max3 (select A k)) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (<= (+ (select A j) 1) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A j) max1) (< max3 (select A k)) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (< max2 (select A j)) (<= (select A k) max3) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ j 1) M) (< (+ 2 k) N) (< max2 (select A j)) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (= (select A j) max1) (<= (+ (select A j) 1) (select A k)) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (< max2 (select A j)) (<= (select A k) max3) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ j 1) M) (< (+ 2 k) N) (< max2 (select A j)) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (< max2 (select A j)) (<= (select A k) max3) (<= (select A k) max2) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= M j) (<= (select A k) (select A j))) (or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max2 (select A j)) (< max3 (select A k)) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (<= (select A (+ k 1)) (select A j)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k)) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (<= (+ (select A j) 1) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (= (select A j) max1) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< max3 (select A (+ k 1))) (< (+ j 1) M) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (<= max3 (select A j)) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (<= (select A (+ k 1)) (select A j)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A (+ k 1)) max2) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (< max2 (select A j)) (= (select A (+ k 1)) max1) (< max3 (select A k)) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (select A (+ k 1)) max2) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (< max2 (select A j)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= M j))), 26038#(and (or (< j M) (< k N) (= max3 max1) (<= max3 max2)) (or (< j M) (< k N) (<= (+ max2 1) max3) (= max2 max1))), 26058#(and (or (not (< k N)) (< j M) (<= (select A i) max1) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ 2 max2) (select A k)) (= max2 max1)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (= (select A i) max3)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (not (< k N)) (<= (+ (select A i) max2) (+ max3 max1)) (< j M) (= max1 0) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (< j M) (<= (select A i) max1) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (<= (+ 2 max2) max3) (< j M) (<= (select A i) max1) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< j M) (<= (select A i) max1) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (< j M) (= max1 0) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ (select A i) max2) (+ max1 (select A k)))) (or (not (< k N)) (< j M) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (not (= (select A i) max1))) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (select A k) max2)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (not (= (select A i) max1)) (= (select A i) max3)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1))), 26044#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< j M) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2)) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1))), 26052#(and (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (select A k) max2) (< i N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N))), 26061#(and (or (not (< k N)) (< (+ j 1) M) (<= (select A i) max1) (<= (+ (select A j) 2) (select A k)) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (= (select A j) max1)) (or (not (< k N)) (< (+ j 1) M) (<= (+ (select A j) 2) max3) (<= (select A i) max1) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (= (select A j) max1) (< max3 (select A k))) (or (not (< k N)) (< (+ j 1) M) (<= (select A i) max1) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (< (+ j 1) M) (= max1 (select A k)) (not (< max3 (select A k))) (not (< j M)) (< max2 (select A j)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (select A k) max2)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= max3 (select A j)) (= (select A i) max3)) (or (not (< k N)) (< (+ j 1) M) (<= (select A i) max1) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ 2 max2) (select A k)) (= max2 max1)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ (select A j) 1) max3) (= (select A j) max1) (< max3 (select A k))) (or (not (< k N)) (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (not (< max3 (select A k))) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (select A k) (select A j))) (or (not (< k N)) (< (+ j 1) M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1)) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (not (= (select A i) max1)) (= (select A i) max3)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (= (select A j) max1) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (= (select A j) max1) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< (+ j 1) M) (= max1 0) (not (< max3 (select A k))) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ (select A i) max2) (+ max1 (select A k)))) (or (not (< k N)) (< (+ j 1) M) (<= (+ (select A i) (select A j)) (+ max3 max1)) (= max1 0) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (< (+ j 1) M) (<= (+ 2 max2) max3) (<= (select A i) max1) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (= (select A i) max3)) (or (not (< k N)) (< (+ j 1) M) (<= (+ (select A i) (select A j)) (+ max1 (select A k))) (= max1 0) (not (< max3 (select A k))) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (not (< k N)) (< (+ j 1) M) (= max1 (select A k)) (not (< max3 (select A k))) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (= (select A j) max1) (<= (+ (select A j) 1) (select A k))) (or (not (< k N)) (< (+ j 1) M) (not (< max3 (select A k))) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (not (= (select A i) max1))) (or (not (< k N)) (< (+ j 1) M) (<= (select A i) max1) (not (< max3 (select A k))) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (<= (+ (select A i) max2) (+ max3 max1)) (< (+ j 1) M) (= max1 0) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1))), 26078#(and (or (<= N (+ k 1)) (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< (+ j 1) M) (<= (select A i) max1) (< (+ 2 k) N) (= max3 (select A (+ i 1))) (< max3 (select A k)) (<= M j) (= (select A i) max3)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (< (+ 2 i) N) (< (+ 2 k) N) (= (select A j) max1) (<= (+ max1 1) (select A i)) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= (+ 2 i) N) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= (+ max3 1) max2) (= max1 0) (< (+ 2 k) N) (< max2 (select A j)) (<= (+ max3 max1) (+ max2 (select A (+ (- 1) N)))) (<= M j) (<= (+ max3 max1) (+ (select A i) max2))) (or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= (+ (select A j) (select A (+ (- 1) N))) (+ (select A (+ k 1)) max1)) (= max1 0) (< (+ 2 k) N) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 i) N) (< (+ 2 k) N) (< max2 (select A j)) (<= (+ max1 1) (select A i)) (= max2 max1) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= (+ (select A i) (select A j)) (+ max1 (select A k))) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ (select A i) (select A j) 1) (+ (select A (+ k 1)) max1)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 i) N) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= M j) (<= (+ (select A i) max2) (+ max1 (select A k)))) (or (<= N (+ k 1)) (<= (select A j) max2) (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< (+ j 1) M) (< (+ 2 k) N) (= max3 (select A (+ i 1))) (< max1 (select A i)) (<= max3 (select A j)) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (< (+ j 1) M) (< (+ 2 i) N) (= max1 0) (< (+ 2 k) N) (<= (+ (select A (+ k 1)) max1) (+ (select A j) (select A (+ (- 1) N)))) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= (+ max2 (select A (+ (- 1) N))) (+ (select A (+ k 1)) max1)) (< (+ 2 i) N) (= max1 0) (< (+ 2 k) N) (<= M j)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (<= (+ (select A i) max2 1) (+ (select A (+ k 1)) max1)) (< (+ 2 k) N) (<= M j)) (or (<= N (+ k 1)) (<= (+ (select A (+ k 1)) max1) (+ max2 (select A (+ (- 1) N)))) (< (+ j 1) M) (< (+ 2 i) N) (= max1 0) (< (+ 2 k) N) (< max2 (select A j)) (<= M j)) (or (<= N (+ k 1)) (<= (select A j) max2) (<= (+ max3 max1) (+ (select A j) (select A (+ (- 1) N)))) (< (+ j 1) M) (<= (+ max3 max1) (+ (select A i) (select A j))) (< (+ 2 i) N) (= max1 0) (< (+ 2 k) N) (<= (+ max3 1) (select A j)) (<= M j)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< (+ j 1) M) (< (+ 2 k) N) (= max3 (select A (+ i 1))) (< max2 (select A j)) (< max1 (select A i)) (<= max3 max2) (<= M j))), 26077#(and (or (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) 1) (select A (+ i 1))) (<= (select A i) max1) (<= N k) (= (select A i) (select A k)) (<= (select A k) max3) (< (+ k 1) N) (<= M j)) (or (not (< k N)) (<= (+ (select A i) max2 1) (+ max3 max1)) (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (not (< j M)) (< (+ k 1) N) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (<= (+ (select A i) (select A j) 1) (+ max1 (select A k))) (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (not (< max3 (select A k))) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (= max3 (select A (+ i 1))) (<= N k) (< max2 (select A j)) (< (+ k 1) N) (< max1 (select A i)) (< max3 (select A k)) (<= max3 max2) (<= M j)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (< (+ 2 i) N) (not (< j M)) (< (+ k 1) N) (= (select A j) max1) (<= (+ max1 1) (select A i))) (or (not (< k N)) (<= (+ max3 max1) (+ (select A j) (select A (+ (- 1) N)))) (< (+ j 1) M) (<= (+ max3 max1) (+ (select A i) (select A j))) (not (< max2 (select A j))) (< (+ 2 i) N) (= max1 0) (not (< j M)) (<= (+ max3 1) (select A j)) (< (+ k 1) N)) (or (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (not (< max3 (select A k))) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ (select A i) max2 1) (+ max1 (select A k)))) (or (<= (select A j) max2) (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (= max1 0) (<= (+ max1 (select A k)) (+ (select A j) (select A (+ (- 1) N)))) (< (+ k 1) N) (<= M j)) (or (not (< k N)) (<= (+ max1 (select A k)) (+ max2 (select A (+ (- 1) N)))) (< (+ j 1) M) (< (+ 2 i) N) (= max1 0) (< max2 (select A j)) (< (+ k 1) N) (<= M j)) (or (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (<= (+ max3 1) max2) (= max1 0) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (+ max3 max1) (+ max2 (select A (+ (- 1) N)))) (<= (+ max3 max1) (+ (select A i) max2))) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) 1) (select A (+ i 1))) (<= (select A i) max1) (<= N k) (< (+ k 1) N) (< max3 (select A k)) (<= M j) (= (select A i) max3)) (or (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (<= (+ (select A i) (select A j) 1) (+ max3 max1)) (not (< j M)) (< (+ k 1) N) (< max3 (select A k)) (= (select A i) max3)) (or (<= (select A j) max2) (<= (+ 3 i) N) (< (+ j 1) M) (= max3 (select A (+ i 1))) (<= N k) (< (+ k 1) N) (< max1 (select A i)) (< max3 (select A k)) (<= max3 (select A j)) (<= M j)) (or (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N) (<= (+ (select A i) max2) (+ max1 (select A k)))) (or (not (< k N)) (<= (+ (select A i) max2) (+ max3 max1)) (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (not (< j M)) (< (+ k 1) N) (< max3 (select A k))) (or (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (<= (+ (select A i) (select A j)) (+ max3 max1)) (not (< j M)) (< (+ k 1) N) (< max3 (select A k))) (or (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (= max1 0) (not (< j M)) (<= (+ (select A j) (select A (+ (- 1) N))) (+ max1 (select A k))) (< (+ k 1) N)) (or (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (<= (+ (select A i) (select A j)) (+ max1 (select A k))) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N)) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (<= (+ max2 (select A (+ (- 1) N))) (+ max1 (select A k))) (= max1 0) (not (< j M)) (< (+ k 1) N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (select A i) max1) (= max3 (select A (+ i 1))) (<= N k) (< (+ k 1) N) (< max3 (select A k)) (<= M j) (= (select A i) max3))), 26072#(and (or (<= N (+ k 1)) (<= (+ (select A (+ k 1)) max1) (+ max2 (select A (+ (- 1) N)))) (< (+ 2 i) N) (= max1 0) (< (+ 2 k) N)) (or (<= N (+ k 1)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (<= (+ (select A i) max2 1) (+ (select A (+ k 1)) max1)) (< (+ 2 k) N)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (= max3 (select A (+ i 1))) (not (< max1 (select A i))) (< max3 (select A k)) (= (select A i) max3)) (or (<= N (+ k 1)) (< (+ 2 i) N) (< (+ 2 k) N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (<= (+ max2 (select A (+ (- 1) N))) (+ (select A (+ k 1)) max1)) (< (+ 2 i) N) (= max1 0) (< (+ 2 k) N)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< (+ 2 i) N) (<= (+ max3 1) max2) (= max1 0) (< (+ 2 k) N) (<= (+ max3 max1) (+ max2 (select A (+ (- 1) N)))) (<= (+ max3 max1) (+ (select A i) max2))) (or (<= N (+ k 1)) (< (+ 2 i) N) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (+ (select A i) max2) (+ max1 (select A k)))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (= max3 (select A (+ i 1))) (< max1 (select A i)) (<= max3 max2))), 26055#(and (or (<= (+ (select A i) max2) (+ max3 max1)) (= max1 0) (< k N) (<= (+ 2 i) N) (= (select A i) max3)) (or (<= (select A i) max1) (< k N) (<= (+ 2 i) N) (= (select A i) max3)) (or (< k N) (<= (+ 2 i) N) (not (= (select A i) max1)) (= (select A i) max3)) (or (< k N) (<= (+ 2 i) N) (= max3 max1) (<= max3 max2) (= (select A i) max3)) (or (< k N) (<= (+ 2 i) N) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (< k N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (= max2 max1)) (or (<= (+ 2 max2) max3) (<= (select A i) max1) (< k N) (<= (+ 2 i) N) (= max2 max1))), 26056#(and (or (not (< k N)) (<= (+ (select A i) max2) (+ max3 max1)) (= max1 0) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (not (= (select A i) max1))) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (= (select A i) max3)) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (<= (select A i) max1) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (not (< k N)) (<= (select A i) max1) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (= max1 0) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ (select A i) max2) (+ max1 (select A k)))) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (select A k) max2)) (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (not (< k N)) (<= (+ 2 max2) max3) (<= (select A i) max1) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (not (= (select A i) max1)) (= (select A i) max3)) (or (not (< k N)) (<= (select A i) max1) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ 2 max2) (select A k)) (= max2 max1))), 26073#(and (or (< j M) (<= (+ 2 i) k)) (or (< (+ 2 i) k) (< j M) (<= (select A i) max1) (= (select A i) max2)) (or (< (+ 2 i) k) (< j M) (not (= max2 0)) (<= (select A (+ (- 1) k)) i) (<= (select A (+ (- 1) k)) (+ i max3))) (or (< (+ 2 i) k) (< j M) (= (select A (+ (- 1) k)) max3) (<= (select A (+ (- 1) k)) i)) (or (< (+ 2 i) k) (< j M) (<= (+ max1 1) (select A i)) (= i max2)) (or (< (+ 2 i) k) (< j M) (<= (+ i 1) (select A (+ (- 1) k))) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< (+ 2 i) k) (< j M) (= max1 0) (<= (+ max1 1) (select A i))) (or (< (+ 2 i) k) (< j M) (= i max1)) (or (< (+ 2 i) k) (< j M) (= i max3) (<= max3 (select A (+ (- 1) k))))), 26040#(and (or (< k N) (<= (+ max2 1) max3) (< i N) (= max2 max1)) (or (< k N) (= max3 max1) (<= max3 max2) (< i N))), 26043#(and (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1)) (or (not (< k N)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2)) (or (not (< k N)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2))), 26035#(and (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (<= (+ (select A j) 1) max3) (= (select A j) max1)) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (= max3 max1) (<= max3 max2)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= max3 max1) (<= max3 (select A j))) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (<= (+ max2 1) max3) (= max2 max1))), 26045#(and (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N) (= (select A j) max1) (<= (+ (select A j) 1) (select A k))) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 (select A j))) (or (not (< k N)) (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N) (<= (select A k) (select A j))) (or (not (< k N)) (< (+ j 1) M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (= max2 max1)) (or (not (< k N)) (< (+ j 1) M) (= max1 (select A k)) (not (< max3 (select A k))) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (select A k) max2)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< (+ k 1) N) (<= (+ (select A j) 1) max3) (= (select A j) max1) (< max3 (select A k)))), 26048#(and (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N) (= (select A j) max1) (<= (+ (select A j) 1) (select A k)) (< i N)) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N)) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< (+ k 1) N) (<= (+ (select A j) 1) max3) (= (select A j) max1) (< max3 (select A k)) (< i N)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (< i N) (<= max3 (select A j))) (or (not (< k N)) (< (+ j 1) M) (= max1 (select A k)) (not (< max3 (select A k))) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (select A k) max2) (< i N)) (or (not (< k N)) (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N) (< i N) (<= (select A k) (select A j))) (or (not (< k N)) (< (+ j 1) M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (< i N) (= max2 max1))), 26069#(and (or (not (< k N)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ (select A i) max2) (+ max1 (select A k)))) (or (not (< k N)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ (select A i) max2 1) (+ max1 (select A k)))) (or (not (< k N)) (<= (+ (select A i) max2 1) (+ max3 max1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (+ k 1) N) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (< (+ 2 i) N) (< j M) (< (+ k 1) N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= (+ 3 i) N) (< j M) (= max3 (select A (+ i 1))) (<= N k) (< (+ k 1) N) (< max3 (select A k)) (<= max3 max2) (= (select A i) max3)) (or (not (< k N)) (<= (+ max1 (select A k)) (+ max2 (select A (+ (- 1) N)))) (< (+ 2 i) N) (< j M) (= max1 0) (< (+ k 1) N)) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ i 1))) (<= (select A i) max1) (<= N k) (= (select A i) (select A k)) (<= (select A k) max3) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 i) N) (< j M) (<= (+ max2 (select A (+ (- 1) N))) (+ max1 (select A k))) (= max1 0) (< (+ k 1) N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ 2 i) N) (< j M) (<= (+ max3 1) max2) (= max1 0) (< (+ k 1) N) (<= (+ max3 max1) (+ max2 (select A (+ (- 1) N)))) (<= (+ max3 max1) (+ (select A i) max2))) (or (not (< k N)) (<= (+ (select A i) max2) (+ max3 max1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (+ k 1) N) (< max3 (select A k))) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ i 1))) (<= (select A i) max1) (<= N k) (< (+ k 1) N) (< max3 (select A k)) (= (select A i) max3))), 26070#(and (or (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (<= (+ (select A i) (select A j)) (+ max3 max1)) (not (< j M))) (or (< (+ j 1) M) (< (+ 2 i) N) (= max1 0) (not (< j M)) (<= (+ (select A j) (select A (+ (- 1) N))) (+ max3 max1))) (or (<= (+ 3 i) N) (< (+ j 1) M) (not (= max1 (select A (+ i 1)))) (= max3 (select A (+ i 1))) (not (< j M)) (< max1 (select A i))) (or (< (+ j 1) M) (not (< max2 (select A j))) (< (+ 2 i) N) (not (< j M)) (= (select A j) max1) (<= (+ max1 1) (select A i))) (or (< (+ j 1) M) (< (+ 2 i) N) (<= (+ max3 1) max2) (= max1 0) (not (< j M)) (< max2 (select A j)) (<= (+ max3 max1) (+ max2 (select A (+ (- 1) N)))) (<= (+ max3 max1) (+ (select A i) max2))) (or (<= (+ max3 max1) (+ (select A j) (select A (+ (- 1) N)))) (< (+ j 1) M) (<= (+ max3 max1) (+ (select A i) (select A j))) (not (< max2 (select A j))) (< (+ 2 i) N) (= max1 0) (not (< j M)) (<= (+ max3 1) (select A j))) (or (<= (+ max2 (select A (+ (- 1) N))) (+ max3 max1)) (< (+ j 1) M) (< (+ 2 i) N) (= max1 0) (not (< j M))) (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N)) (or (<= (+ (select A i) max2 1) (+ max3 max1)) (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (not (< j M)) (= (select A i) max3)) (or (<= (+ 3 i) N) (< (+ j 1) M) (= max3 (select A (+ i 1))) (not (< j M)) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (< max2 (select A j)) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= (select A j) max2) (<= (+ 3 i) N) (< (+ j 1) M) (= max3 (select A (+ i 1))) (< max1 (select A i)) (<= max3 (select A j)) (<= M j)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (select A (+ i 1)) max1) (= max3 (select A (+ i 1))) (not (< j M)) (< max1 (select A i))) (or (<= (+ (select A i) max2) (+ max3 max1)) (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (not (< j M))) (or (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (<= (+ (select A i) (select A j) 1) (+ max3 max1)) (not (< j M)) (= (select A i) max3)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) 1) (select A (+ i 1))) (<= (select A i) max1) (<= M j) (= (select A i) max3)) (or (<= (+ 3 i) N) (< (+ j 1) M) (= max3 (select A (+ i 1))) (< max2 (select A j)) (< max1 (select A i)) (<= max3 max2) (<= M j))), 26036#(and (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= max3 max1) (< i N) (<= max3 (select A j))) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (= max3 max1) (<= max3 max2) (< i N)) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (<= (+ max2 1) max3) (< i N) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (<= (+ (select A j) 1) max3) (= (select A j) max1) (< i N))), 26068#(and (or (not (< k N)) (< (+ 2 i) N) (<= (+ max2 (select A (+ (- 1) N))) (+ max1 (select A k))) (= max1 0) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 i) N) (<= (select A i) max1) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ (select A i) max2 1) (+ max1 (select A k)))) (or (<= (+ 3 i) N) (<= (+ (select A i) 1) (select A (+ i 1))) (<= (select A i) max1) (<= N k) (= (select A i) (select A k)) (<= (select A k) max3) (< (+ k 1) N)) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (<= (+ (select A i) 1) (select A (+ i 1))) (<= (select A i) max1) (<= N k) (< (+ k 1) N) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (<= (+ (select A i) max2) (+ max3 max1)) (< (+ 2 i) N) (<= (select A i) max1) (< (+ k 1) N) (< max3 (select A k))) (or (<= (+ 3 i) N) (= max3 (select A (+ i 1))) (<= N k) (< (+ k 1) N) (< max3 (select A k)) (<= max3 max2) (= (select A i) max3)) (or (not (< k N)) (< (+ 2 i) N) (< (+ k 1) N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (not (< k N)) (<= (+ max1 (select A k)) (+ max2 (select A (+ (- 1) N)))) (< (+ 2 i) N) (= max1 0) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 i) N) (<= (+ max3 1) max2) (= max1 0) (< (+ k 1) N) (<= (+ max3 max1) (+ max2 (select A (+ (- 1) N)))) (<= (+ max3 max1) (+ (select A i) max2))) (or (not (< k N)) (< (+ 2 i) N) (<= (select A i) max1) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ (select A i) max2) (+ max1 (select A k)))) (or (not (< k N)) (<= (+ (select A i) max2 1) (+ max3 max1)) (< (+ 2 i) N) (<= (select A i) max1) (< (+ k 1) N) (< max3 (select A k)) (= (select A i) max3))), 26079#(and (or (< (+ 2 i) k) (< (+ j 1) M) (not (< j M)) (= (select A (+ (- 1) k)) max3) (<= (select A (+ (- 1) k)) i)) (or (< (+ j 1) M) (<= (+ 2 i) k) (not (< j M))) (or (< (+ 2 i) k) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (<= (+ max1 1) (select A i)) (= i max2)) (or (< (+ 2 i) k) (< (+ j 1) M) (not (< j M)) (= i max3) (<= max3 (select A (+ (- 1) k)))) (or (< (+ 2 i) k) (< (+ j 1) M) (not (= (select A j) 0)) (not (< max2 (select A j))) (not (< j M)) (<= (select A (+ (- 1) k)) i) (<= (select A (+ (- 1) k)) (+ i max3))) (or (< (+ 2 i) k) (< (+ j 1) M) (= max1 0) (not (< j M)) (<= (+ max1 1) (select A i))) (or (< (+ 2 i) k) (< (+ j 1) M) (= i max1) (not (< j M))) (or (< (+ 2 i) k) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (not (= max2 0)) (<= (select A (+ (- 1) k)) i) (<= (select A (+ (- 1) k)) (+ i max3))) (or (< (+ 2 i) k) (< (+ j 1) M) (not (< j M)) (<= (+ i 1) (select A (+ (- 1) k))) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< (+ 2 i) k) (< (+ j 1) M) (not (< max2 (select A j))) (= (select A j) i) (not (< j M)) (<= (+ max1 1) (select A i))) (or (< (+ 2 i) k) (< (+ j 1) M) (<= (select A i) max1) (not (< j M)) (< max2 (select A j)) (= (select A i) max2)) (or (< (+ 2 i) k) (< (+ j 1) M) (not (< max2 (select A j))) (<= (select A i) max1) (not (< j M)) (= (select A i) (select A j)))), 26041#(and (or (< j M) (< k N) (= max3 max1) (<= max3 max2) (< i N)) (or (< j M) (< k N) (<= (+ max2 1) max3) (< i N) (= max2 max1))), 26050#(and (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (select A k) max2)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k))) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (= max2 max1))), 26042#(and (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (<= (+ (select A j) 1) max3) (= (select A j) max1) (< i N)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (= max3 max1) (< i N) (<= max3 (select A j))) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< k N) (<= (+ max2 1) max3) (< i N) (= max2 max1)) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< k N) (= max3 max1) (<= max3 max2) (< i N)))] [2022-03-15 22:16:00,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 22:16:00,851 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:00,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 22:16:00,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=4766, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 22:16:00,852 INFO L87 Difference]: Start difference. First operand 740 states and 2838 transitions. Second operand has 58 states, 57 states have (on average 2.982456140350877) internal successors, (170), 57 states have internal predecessors, (170), 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) Received shutdown request... [2022-03-15 22:16:14,578 WARN L244 SmtUtils]: Removed 54 from assertion stack [2022-03-15 22:16:14,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 22:16:14,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2291 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=817, Invalid=5989, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 22:16:14,579 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:14,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:16:14,580 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:16:14,589 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:16:14,589 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 22:16:14,601 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 22:16:14,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:14,781 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (740states) and FLOYD_HOARE automaton (currently 12 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 242 for 760ms.. [2022-03-15 22:16:14,783 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:16:14,783 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:16:14,783 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:16:14,785 INFO L732 BasicCegarLoop]: Path program histogram: [9, 7, 1, 1, 1] [2022-03-15 22:16:14,786 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:16:14,786 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:16:14,787 INFO L202 PluginConnector]: Adding new model max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:16:14 BasicIcfg [2022-03-15 22:16:14,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:16:14,788 INFO L158 Benchmark]: Toolchain (without parser) took 860442.60ms. Allocated memory was 184.5MB in the beginning and 767.6MB in the end (delta: 583.0MB). Free memory was 143.2MB in the beginning and 644.9MB in the end (delta: -501.7MB). Peak memory consumption was 493.6MB. Max. memory is 8.0GB. [2022-03-15 22:16:14,788 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:16:14,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.96ms. Allocated memory is still 184.5MB. Free memory was 143.2MB in the beginning and 141.6MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 22:16:14,788 INFO L158 Benchmark]: Boogie Preprocessor took 19.91ms. Allocated memory is still 184.5MB. Free memory was 141.6MB in the beginning and 140.7MB in the end (delta: 923.2kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:16:14,788 INFO L158 Benchmark]: RCFGBuilder took 262.67ms. Allocated memory is still 184.5MB. Free memory was 140.6MB in the beginning and 131.4MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:16:14,789 INFO L158 Benchmark]: TraceAbstraction took 860133.00ms. Allocated memory was 184.5MB in the beginning and 767.6MB in the end (delta: 583.0MB). Free memory was 130.9MB in the beginning and 644.9MB in the end (delta: -514.0MB). Peak memory consumption was 479.9MB. Max. memory is 8.0GB. [2022-03-15 22:16:14,789 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.10ms. Allocated memory is still 184.5MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.96ms. Allocated memory is still 184.5MB. Free memory was 143.2MB in the beginning and 141.6MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.91ms. Allocated memory is still 184.5MB. Free memory was 141.6MB in the beginning and 140.7MB in the end (delta: 923.2kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 262.67ms. Allocated memory is still 184.5MB. Free memory was 140.6MB in the beginning and 131.4MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 860133.00ms. Allocated memory was 184.5MB in the beginning and 767.6MB in the end (delta: 583.0MB). Free memory was 130.9MB in the beginning and 644.9MB in the end (delta: -514.0MB). Peak memory consumption was 479.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 36 PlacesBefore, 25 PlacesAfterwards, 29 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 116 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 116, positive: 116, positive conditional: 0, positive unconditional: 116, 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: 70, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 116, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 70, unknown conditional: 0, unknown unconditional: 70] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, 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: 66]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (740states) and FLOYD_HOARE automaton (currently 12 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 242 for 760ms.. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (740states) and FLOYD_HOARE automaton (currently 12 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 242 for 760ms.. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (740states) and FLOYD_HOARE automaton (currently 12 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 242 for 760ms.. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (740states) and FLOYD_HOARE automaton (currently 12 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 242 for 760ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 42 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 860.0s, OverallIterations: 19, TraceHistogramMax: 4, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 296.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4335 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4335 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 9.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3568 mSDsCounter, 2213 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13399 IncrementalHoareTripleChecker+Invalid, 15612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2213 mSolverCounterUnsat, 0 mSDtfsCounter, 13399 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2312 GetRequests, 915 SyntacticMatches, 47 SemanticMatches, 1349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57987 ImplicationChecksByTransitivity, 312.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=814occurred in iteration=17, InterpolantAutomatonStates: 998, 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, 18 MinimizatonAttempts, 4125 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 303.1s InterpolantComputationTime, 527 NumberOfCodeBlocks, 527 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 722 ConstructedInterpolants, 7 QuantifiedInterpolants, 20190 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1054 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 51 InterpolantComputations, 3 PerfectInterpolantSequences, 134/335 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