/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/min-array-hom.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:04:36,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:04:36,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:04:36,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:04:36,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:04:36,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:04:36,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:04:36,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:04:36,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:04:36,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:04:36,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:04:36,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:04:36,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:04:36,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:04:36,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:04:36,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:04:36,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:04:36,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:04:36,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:04:36,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:04:36,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:04:36,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:04:36,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:04:36,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:04:36,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:04:36,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:04:36,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:04:36,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:04:36,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:04:36,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:04:36,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:04:36,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:04:36,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:04:36,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:04:36,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:04:36,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:04:36,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:04:36,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:04:36,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:04:36,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:04:36,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:04:36,776 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:04:36,807 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:04:36,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:04:36,808 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:04:36,808 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:04:36,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:04:36,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:04:36,809 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:04:36,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:04:36,810 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:04:36,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:04:36,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:04:36,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:04:36,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:04:36,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:04:36,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:04:36,811 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:04:36,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:04:36,812 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:04:36,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:04:36,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:04:36,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:04:36,812 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:04:36,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:04:36,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:04:36,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:04:36,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:04:36,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:04:36,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:04:36,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:04:36,815 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:04:36,815 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:04:36,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:04:36,815 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:04:37,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:04:37,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:04:37,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:04:37,088 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:04:37,095 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:04:37,096 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/min-array-hom.wvr.bpl [2022-03-15 22:04:37,096 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-array-hom.wvr.bpl' [2022-03-15 22:04:37,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:04:37,131 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:04:37,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:04:37,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:04:37,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:04:37,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:37" (1/1) ... [2022-03-15 22:04:37,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:37" (1/1) ... [2022-03-15 22:04:37,155 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:04:37,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:04:37,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:04:37,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:04:37,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:04:37,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:37" (1/1) ... [2022-03-15 22:04:37,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:37" (1/1) ... [2022-03-15 22:04:37,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:37" (1/1) ... [2022-03-15 22:04:37,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:37" (1/1) ... [2022-03-15 22:04:37,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:37" (1/1) ... [2022-03-15 22:04:37,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:37" (1/1) ... [2022-03-15 22:04:37,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:37" (1/1) ... [2022-03-15 22:04:37,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:04:37,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:04:37,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:04:37,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:04:37,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:37" (1/1) ... [2022-03-15 22:04:37,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:04:37,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:37,225 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:04:37,246 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:04:37,261 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:04:37,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:04:37,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:04:37,261 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:04:37,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:04:37,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:04:37,262 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:04:37,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:04:37,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:04:37,262 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 22:04:37,262 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 22:04:37,262 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 22:04:37,263 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:04:37,309 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:04:37,310 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:04:37,404 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:04:37,417 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:04:37,417 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:04:37,419 INFO L202 PluginConnector]: Adding new model min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:04:37 BoogieIcfgContainer [2022-03-15 22:04:37,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:04:37,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:04:37,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:04:37,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:04:37,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:37" (1/2) ... [2022-03-15 22:04:37,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a03c2b and model type min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:04:37, skipping insertion in model container [2022-03-15 22:04:37,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:04:37" (2/2) ... [2022-03-15 22:04:37,427 INFO L111 eAbstractionObserver]: Analyzing ICFG min-array-hom.wvr.bpl [2022-03-15 22:04:37,432 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:04:37,432 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:04:37,432 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:04:37,432 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:04:37,497 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 22:04:37,532 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:04:37,536 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:04:37,537 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 22:04:37,545 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:04:37,554 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:04:37,557 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:04:37,558 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 82 flow [2022-03-15 22:04:37,578 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2022-03-15 22:04:37,578 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 22:04:37,581 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:04:37,583 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 22:04:37,934 INFO L131 LiptonReduction]: Checked pairs total: 116 [2022-03-15 22:04:37,935 INFO L133 LiptonReduction]: Total number of compositions: 12 [2022-03-15 22:04:37,948 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 22:04:37,967 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:04:37,969 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:04:37,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:04:37,973 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:37,973 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:37,974 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:04:37,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:37,978 INFO L85 PathProgramCache]: Analyzing trace with hash -580571257, now seen corresponding path program 1 times [2022-03-15 22:04:37,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:37,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615489274] [2022-03-15 22:04:37,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:37,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:38,188 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:04:38,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:38,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615489274] [2022-03-15 22:04:38,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615489274] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:04:38,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:04:38,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 22:04:38,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [528098614] [2022-03-15 22:04:38,194 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:38,200 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:38,232 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 22:04:38,232 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:38,623 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:04:38,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:04:38,625 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:38,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:04:38,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:04:38,652 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:04:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:38,689 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 22:04:38,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:04:38,692 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:04:38,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:38,698 INFO L225 Difference]: With dead ends: 45 [2022-03-15 22:04:38,698 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 22:04:38,699 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:04:38,702 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:04:38,703 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:04:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 22:04:38,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 22:04:38,732 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:04:38,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 22:04:38,734 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 22:04:38,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:38,734 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 22:04:38,734 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:04:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 22:04:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:04:38,735 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:38,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:38,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:04:38,736 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:04:38,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:38,737 INFO L85 PathProgramCache]: Analyzing trace with hash -817689900, now seen corresponding path program 1 times [2022-03-15 22:04:38,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:38,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929160111] [2022-03-15 22:04:38,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:38,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:38,770 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:04:38,770 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:38,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929160111] [2022-03-15 22:04:38,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929160111] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:04:38,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:04:38,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:04:38,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1192314021] [2022-03-15 22:04:38,771 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:38,772 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:38,775 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:04:38,775 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:38,908 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [220#(< i N)] [2022-03-15 22:04:38,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 22:04:38,909 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:38,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 22:04:38,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:04:38,910 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:04:38,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:38,945 INFO L93 Difference]: Finished difference Result 37 states and 98 transitions. [2022-03-15 22:04:38,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:04:38,946 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:04:38,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:38,947 INFO L225 Difference]: With dead ends: 37 [2022-03-15 22:04:38,947 INFO L226 Difference]: Without dead ends: 37 [2022-03-15 22:04:38,947 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:04:38,949 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:04:38,951 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:04:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-03-15 22:04:38,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-03-15 22:04:38,960 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:04:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-03-15 22:04:38,963 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 80 transitions. Word has length 12 [2022-03-15 22:04:38,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:38,963 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 80 transitions. [2022-03-15 22:04:38,964 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:04:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 80 transitions. [2022-03-15 22:04:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:04:38,966 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:38,966 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:38,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:04:38,973 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:04:38,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:38,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1068507127, now seen corresponding path program 1 times [2022-03-15 22:04:38,975 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:38,975 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315338608] [2022-03-15 22:04:38,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:38,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:39,005 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:04:39,005 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:39,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315338608] [2022-03-15 22:04:39,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315338608] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:04:39,006 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:04:39,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:04:39,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [256021218] [2022-03-15 22:04:39,006 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:39,007 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:39,010 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:04:39,010 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:39,183 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:04:39,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:04:39,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:39,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:04:39,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:04:39,186 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:04:39,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:39,211 INFO L93 Difference]: Finished difference Result 40 states and 106 transitions. [2022-03-15 22:04:39,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:04:39,212 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:04:39,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:39,212 INFO L225 Difference]: With dead ends: 40 [2022-03-15 22:04:39,213 INFO L226 Difference]: Without dead ends: 40 [2022-03-15 22:04:39,213 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:04:39,214 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:04:39,214 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:04:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-15 22:04:39,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-03-15 22:04:39,218 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:04:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 106 transitions. [2022-03-15 22:04:39,219 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 106 transitions. Word has length 12 [2022-03-15 22:04:39,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:39,220 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 106 transitions. [2022-03-15 22:04:39,220 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:04:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 106 transitions. [2022-03-15 22:04:39,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:04:39,220 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:39,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:39,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 22:04:39,221 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:04:39,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:39,221 INFO L85 PathProgramCache]: Analyzing trace with hash 282949368, now seen corresponding path program 1 times [2022-03-15 22:04:39,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:39,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556718843] [2022-03-15 22:04:39,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:39,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:39,479 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:04:39,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:39,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556718843] [2022-03-15 22:04:39,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556718843] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:39,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535597612] [2022-03-15 22:04:39,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:39,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:39,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:39,482 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:04:39,495 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:04:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:39,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 22:04:39,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:39,734 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:04:39,807 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:04:39,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:39,995 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:04:39,996 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:04:40,282 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:04:40,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535597612] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:40,283 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:40,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-03-15 22:04:40,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1051922169] [2022-03-15 22:04:40,283 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:40,284 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:40,287 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 22:04:40,287 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:42,592 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [529#(and (or (< j M) (= min1 min3) (<= (+ (select A i) 1) i)) (or (= 0 (+ (* (- 1) min1) i)) (< j M)) (or (< j M) (= (select A i) min3) (<= i (select A i))) (or (< j M) (<= (+ min3 1) 0) (= min3 min2)) (or (< j M) (= min2 0))), 528#(and (or (<= min3 (select A k)) (= min1 (select A k))) (or (= min2 (select A k)) (not (< (select A k) min3)) (<= (+ (select A k) 1) 0)) (= min2 0) (or (< (select A k) min3) (<= (+ min3 1) 0) (= min3 min2)) (or (< (select A k) min3) (= min1 min3))), 527#(and (or (< j M) (= min1 min3)) (or (< j M) (<= (+ min3 1) 0) (= min3 min2)) (or (< j M) (= min2 0))), 530#(and (or (< (select A k) min3) (< j M) (<= (+ min3 1) 0) (= min3 min2)) (or (< (select A k) min3) (< j M) (= min1 min3)) (or (= min2 (select A k)) (< j M) (not (< (select A k) min3)) (<= (+ (select A k) 1) 0)) (or (< j M) (<= min3 (select A k)) (= min1 (select A k))) (or (< j M) (= min2 0))), 531#(and (or (< j M) (= k i)) (or (< j M) (= min1 min3)) (or (< j M) (= i min1)) (or (< j M) (= k 0)) (or (< j M) (= min3 min2)))] [2022-03-15 22:04:42,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:04:42,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:42,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:04:42,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:04:42,594 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:04:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:42,877 INFO L93 Difference]: Finished difference Result 76 states and 207 transitions. [2022-03-15 22:04:42,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:04:42,878 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:04:42,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:42,879 INFO L225 Difference]: With dead ends: 76 [2022-03-15 22:04:42,879 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 22:04:42,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:04:42,880 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:42,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:04:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 22:04:42,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-03-15 22:04:42,887 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:04:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 192 transitions. [2022-03-15 22:04:42,887 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 192 transitions. Word has length 13 [2022-03-15 22:04:42,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:42,887 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 192 transitions. [2022-03-15 22:04:42,888 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:04:42,888 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 192 transitions. [2022-03-15 22:04:42,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:04:42,888 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:42,889 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:42,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 22:04:43,099 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:04:43,100 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:04:43,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:43,100 INFO L85 PathProgramCache]: Analyzing trace with hash 134365460, now seen corresponding path program 2 times [2022-03-15 22:04:43,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:43,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201970335] [2022-03-15 22:04:43,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:43,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:43,169 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:04:43,169 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:43,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201970335] [2022-03-15 22:04:43,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201970335] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:43,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005417977] [2022-03-15 22:04:43,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:04:43,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:43,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:43,171 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:04:43,177 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:04:43,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:04:43,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:43,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:04:43,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:43,257 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:04:43,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:43,330 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:04:43,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005417977] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:43,331 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:43,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-03-15 22:04:43,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1673082618] [2022-03-15 22:04:43,331 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:43,343 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:43,348 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:04:43,348 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:44,006 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [843#(or (< j M) (<= N k) (< (+ k 1) N)), 835#(< j M), 839#(or (<= N i) (<= N k) (< (+ k 1) N)), 841#(or (< j M) (< k N)), 842#(or (<= N i) (< j M) (< k N)), 840#(or (<= N i) (< j M)), 837#(or (<= N k) (< (+ k 1) N)), 844#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 838#(or (<= N i) (< k N)), 846#(or (< j M) (<= k (+ i 1))), 836#(< k N), 845#(or (<= N (+ i 1)) (< j M)), 828#(or (<= k i) (< j M))] [2022-03-15 22:04:44,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:04:44,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:44,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:04:44,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:04:44,007 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:04:45,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:45,016 INFO L93 Difference]: Finished difference Result 175 states and 510 transitions. [2022-03-15 22:04:45,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 22:04:45,017 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:04:45,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:45,019 INFO L225 Difference]: With dead ends: 175 [2022-03-15 22:04:45,019 INFO L226 Difference]: Without dead ends: 172 [2022-03-15 22:04:45,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=800, Invalid=2622, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:04:45,021 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 170 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:45,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 0 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:04:45,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-03-15 22:04:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 91. [2022-03-15 22:04:45,029 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:04:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 293 transitions. [2022-03-15 22:04:45,031 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 293 transitions. Word has length 14 [2022-03-15 22:04:45,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:45,031 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 293 transitions. [2022-03-15 22:04:45,031 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:04:45,031 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 293 transitions. [2022-03-15 22:04:45,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:04:45,032 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:45,032 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:45,052 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:04:45,247 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:04:45,248 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:04:45,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:45,248 INFO L85 PathProgramCache]: Analyzing trace with hash -771572247, now seen corresponding path program 3 times [2022-03-15 22:04:45,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:45,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54269976] [2022-03-15 22:04:45,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:45,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:45,315 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:04:45,315 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:45,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54269976] [2022-03-15 22:04:45,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54269976] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:45,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654685528] [2022-03-15 22:04:45,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:04:45,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:45,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:45,320 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:04:45,321 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:04:45,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:04:45,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:45,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:04:45,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:45,427 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:04:45,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:45,464 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:04:45,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654685528] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:45,464 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:45,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-03-15 22:04:45,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1261518823] [2022-03-15 22:04:45,465 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:45,466 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:45,471 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:04:45,471 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:45,920 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1372#(or (<= N k) (< (+ k 1) N) (< i N)), 1373#(or (<= N (+ k 1)) (< (+ 2 k) N)), 1369#(< k N), 1374#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 1371#(or (<= N k) (< (+ k 1) N)), 1370#(or (< k N) (< i N))] [2022-03-15 22:04:45,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 22:04:45,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:45,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 22:04:45,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:04:45,921 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:04:46,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:46,388 INFO L93 Difference]: Finished difference Result 240 states and 732 transitions. [2022-03-15 22:04:46,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 22:04:46,389 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:04:46,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:46,391 INFO L225 Difference]: With dead ends: 240 [2022-03-15 22:04:46,391 INFO L226 Difference]: Without dead ends: 240 [2022-03-15 22:04:46,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:04:46,392 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 126 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:46,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 0 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:04:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-03-15 22:04:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 170. [2022-03-15 22:04:46,409 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:04:46,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 580 transitions. [2022-03-15 22:04:46,412 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 580 transitions. Word has length 14 [2022-03-15 22:04:46,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:46,412 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 580 transitions. [2022-03-15 22:04:46,412 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:04:46,412 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 580 transitions. [2022-03-15 22:04:46,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:04:46,418 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:46,419 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:46,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 22:04:46,631 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:04:46,632 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:04:46,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:46,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1294994650, now seen corresponding path program 1 times [2022-03-15 22:04:46,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:46,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896887662] [2022-03-15 22:04:46,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:46,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:46,665 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:04:46,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:46,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896887662] [2022-03-15 22:04:46,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896887662] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:46,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387491772] [2022-03-15 22:04:46,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:46,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:46,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:46,667 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:04:46,675 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:04:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:46,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:04:46,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:46,769 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:04:46,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:46,826 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:04:46,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387491772] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:46,827 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:46,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-03-15 22:04:46,827 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [877123637] [2022-03-15 22:04:46,827 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:46,830 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:46,834 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 110 transitions. [2022-03-15 22:04:46,834 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:47,363 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [2076#(< j M), 2081#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 2078#(or (< j M) (<= (+ 2 i) N)), 2077#(or (< j M) (< i N)), 2079#(or (< (+ j 1) M) (<= M j)), 2080#(or (< (+ j 1) M) (< i N) (<= M j))] [2022-03-15 22:04:47,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:04:47,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:47,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:04:47,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-03-15 22:04:47,364 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:04:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:47,526 INFO L93 Difference]: Finished difference Result 256 states and 873 transitions. [2022-03-15 22:04:47,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 22:04:47,526 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:04:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:47,528 INFO L225 Difference]: With dead ends: 256 [2022-03-15 22:04:47,528 INFO L226 Difference]: Without dead ends: 256 [2022-03-15 22:04:47,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:04:47,529 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:47,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:04:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-03-15 22:04:47,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 210. [2022-03-15 22:04:47,540 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:04:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 720 transitions. [2022-03-15 22:04:47,541 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 720 transitions. Word has length 14 [2022-03-15 22:04:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:47,542 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 720 transitions. [2022-03-15 22:04:47,542 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:04:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 720 transitions. [2022-03-15 22:04:47,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:04:47,543 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:47,543 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:47,566 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:04:47,759 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:04:47,760 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:04:47,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:47,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1803933763, now seen corresponding path program 4 times [2022-03-15 22:04:47,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:47,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50599966] [2022-03-15 22:04:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:47,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:48,242 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:04:48,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:48,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50599966] [2022-03-15 22:04:48,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50599966] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:48,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104853338] [2022-03-15 22:04:48,242 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:04:48,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:48,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:48,244 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:04:48,246 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:04:48,276 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:04:48,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:48,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:04:48,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:48,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2022-03-15 22:04:48,818 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:04:48,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:49,446 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:04:49,447 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:04:51,242 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:04:51,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104853338] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:51,242 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:51,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-03-15 22:04:51,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1126279871] [2022-03-15 22:04:51,243 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:51,244 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:51,249 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 22:04:51,250 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:05:06,355 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [2876#(and (or (<= (+ min3 1) min2) (< j M) (= min1 min2) (< k N)) (or (<= min2 min3) (< j M) (< k N) (= min1 min3))), 2884#(and (or (not (< k N)) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (= min1 0) (not (< (select A k) min3)) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ 2 i) N) (= (select A i) min2)) (or (< (select A k) min3) (not (< k N)) (<= min1 (select A i)) (= (select A i) min3) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (<= min1 (select A i)) (not (< (select A k) min3)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (= min1 0) (<= (+ min3 1) min2) (< (+ k 1) N) (<= (+ 2 i) N) (= (select A i) min2)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (= min1 min2) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (= min1 min3) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N))), 2875#(and (or (<= min2 min3) (< j M) (= min1 min3)) (or (<= (+ min3 1) min2) (< j M) (= min1 min2))), 2869#(and (or (<= (+ min3 1) min2) (= min1 min2) (< k N)) (or (<= min2 min3) (< k N) (= min1 min3))), 2887#(and (or (= min1 0) (<= (+ min3 1) min2) (< j M) (< k N) (<= (+ 2 i) N) (= (select A i) min2)) (or (<= (+ min3 1) min2) (< j M) (= min1 min2) (< k N) (<= (+ 2 i) N)) (or (<= min2 min3) (< j M) (< k N) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= min1 (select A i)) (< j M) (= (select A i) min3) (< k N) (<= (+ 2 i) N))), 2888#(and (or (< (select A k) min3) (not (< k N)) (<= min1 (select A i)) (< j M) (= (select A i) min3) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (= min1 0) (< j M) (not (< (select A k) min3)) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ 2 i) N) (= (select A i) min2)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< j M) (= min1 min2) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (= min1 0) (<= (+ min3 1) min2) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (= (select A i) min2)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (not (< k N)) (<= min1 (select A i)) (< j M) (not (< (select A k) min3)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (< j M) (= min1 min3) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N))), 2870#(and (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (= min1 min3) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (= min1 min2) (< (+ k 1) N)) (or (not (< k N)) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N)) (or (not (< k N)) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N))), 2872#(and (or (<= min2 min3) (< k N) (<= (+ i 1) N) (= min1 min3)) (or (<= (+ min3 1) min2) (= min1 min2) (< k N) (<= (+ i 1) N))), 2892#(and (or (< j M) (= i 0)) (or (< j M) (= min1 min2)) (or (< j M) (= i min3)) (or (< j M) (= k 0)) (or (= min1 0) (< j M))), 2880#(and (or (<= min2 min3) (< j M) (< k N) (<= (+ i 1) N) (= min1 min3)) (or (<= (+ min3 1) min2) (< j M) (= min1 min2) (< k N) (<= (+ i 1) N))), 2871#(and (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min2)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min3)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (select A k) (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A (+ k 1)) 1) min2))), 2891#(and (or (< j M) (= i min2)) (or (< j M) (= min1 min2)) (or (< j M) (= i min3) (<= (+ (select A i) 1) i)) (or (< j M) (= (select A i) min3) (<= i (select A i))) (or (<= (+ i 1) k) (< j M)) (or (= min1 0) (< j M))), 2889#(and (or (<= N (+ k 1)) (= min1 0) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2) (= (select A i) min2)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (= min1 0) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (= (select A i) min2)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min1 (select A i)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= min1 (select A i)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min1 (select A i)) (< (select A (+ k 1)) min3) (< j M) (= (select A i) min3) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= min1 (select A i)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (= min1 0) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) min2) (= (select A i) min2)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (= min1 0) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k)) (= (select A i) min2))), 2873#(and (or (not (< k N)) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N) (< i N)) (or (not (< k N)) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (< i N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (= min1 min2) (< (+ k 1) N) (< i N)) (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (= min1 min3) (< (+ k 1) N) (< i N))), 2890#(and (or (< (+ 2 i) N) (< j M) (= i min3) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ 2 i) N) (< j M) (= (select A i) min3) (= i min3)) (or (< (+ 2 i) N) (< j M) (= i min3) (<= (+ (select A i) 1) i) (<= (+ (select A (+ (- 1) N)) 1) 0)) (or (< (+ 2 i) N) (< j M) (<= i (select A i)) (not (= i min3))) (or (< j M) (= (+ (* (- 1) min2) i) 0)) (or (= 0 (+ (* (- 1) min1) i)) (< (+ 2 i) N) (< j M)) (or (< j M) (<= (+ 2 i) N)) (or (= min1 0) (< (+ 2 i) N) (< j M) (= min2 (select A (+ (- 1) N)))) (or (= min1 0) (< (+ 2 i) N) (< j M) (= i min3)) (or (<= 0 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (not (= i min3)) (= min2 (select A (+ (- 1) N))))), 2874#(and (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min3) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min2) (< i N)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (select A k) (select A (+ k 1))) (< i N)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A (+ k 1)) (select A k)) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k)) (< i N))), 2882#(and (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min3) (< i N)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (select A k) (select A (+ k 1))) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min2) (< i N)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A (+ k 1)) (select A k)) (< i N)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k)) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< i N))), 2885#(and (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1)))) (or (<= N (+ k 1)) (= min1 0) (<= min3 (select A k)) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2) (= (select A i) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= min1 (select A i)) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min1 (select A i)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (= min1 0) (<= min3 (select A k)) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k)) (= (select A i) min2)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (= min1 0) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) min2) (= (select A i) min2)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (<= min1 (select A i)) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min1 (select A i)) (< (select A (+ k 1)) min3) (= (select A i) min3) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= N (+ k 1)) (= min1 0) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (<= (+ 2 i) N) (= (select A i) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N))), 2877#(and (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (< j M) (= min1 min3) (< (+ k 1) N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< j M) (= min1 min2) (< (+ k 1) N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N))), 2879#(and (or (<= (+ min3 1) min2) (< j M) (= min1 min2) (<= (+ i 1) N)) (or (<= min2 min3) (< j M) (<= (+ i 1) N) (= min1 min3))), 2881#(and (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (< j M) (= min1 min3) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (< i N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< j M) (= min1 min2) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N) (< i N))), 2878#(and (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min3)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (select A k) (select A (+ k 1))))), 2883#(and (or (<= min2 min3) (< k N) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= (+ min3 1) min2) (= min1 min2) (< k N) (<= (+ 2 i) N)) (or (<= min1 (select A i)) (= (select A i) min3) (< k N) (<= (+ 2 i) N)) (or (= min1 0) (<= (+ min3 1) min2) (< k N) (<= (+ 2 i) N) (= (select A i) min2))), 2886#(and (or (<= (+ min3 1) min2) (< j M) (= min1 min2) (<= (+ 2 i) N)) (or (<= min2 min3) (< j M) (= (select A i) min3) (= min1 min3) (<= (+ 2 i) N)) (or (= min1 0) (<= (+ min3 1) min2) (< j M) (<= (+ 2 i) N) (= (select A i) min2)) (or (<= min1 (select A i)) (< j M) (= (select A i) min3) (<= (+ 2 i) N)) (or (< j M) (= min1 min2) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)))] [2022-03-15 22:05:06,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:05:06,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:05:06,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:05:06,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1528, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:05:06,357 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:05:27,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:05:27,643 INFO L93 Difference]: Finished difference Result 440 states and 1390 transitions. [2022-03-15 22:05:27,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-03-15 22:05:27,644 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:05:27,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:05:27,646 INFO L225 Difference]: With dead ends: 440 [2022-03-15 22:05:27,646 INFO L226 Difference]: Without dead ends: 429 [2022-03-15 22:05:27,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3588 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=2065, Invalid=10145, Unknown=0, NotChecked=0, Total=12210 [2022-03-15 22:05:27,650 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 376 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:05:27,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 0 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 22:05:27,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-03-15 22:05:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 256. [2022-03-15 22:05:27,661 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:05:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 910 transitions. [2022-03-15 22:05:27,662 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 910 transitions. Word has length 15 [2022-03-15 22:05:27,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:05:27,663 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 910 transitions. [2022-03-15 22:05:27,663 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:05:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 910 transitions. [2022-03-15 22:05:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:05:27,664 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:05:27,664 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:05:27,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 22:05:27,879 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:05:27,880 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:05:27,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:05:27,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1005306136, now seen corresponding path program 5 times [2022-03-15 22:05:27,881 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:05:27,881 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55088650] [2022-03-15 22:05:27,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:05:27,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:05:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:05:27,933 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:05:27,933 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:05:27,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55088650] [2022-03-15 22:05:27,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55088650] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:05:27,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608999981] [2022-03-15 22:05:27,933 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:05:27,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:05:27,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:05:27,935 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:05:27,936 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:05:27,962 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:05:27,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:05:27,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:05:27,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:05:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:05:28,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:05:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:05:28,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608999981] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:05:28,072 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:05:28,072 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-03-15 22:05:28,072 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [489580533] [2022-03-15 22:05:28,072 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:05:28,073 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:05:28,079 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:05:28,079 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:05:28,516 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [4080#(or (<= N i) (< (+ i 1) N)), 4079#(or (<= N k) (< i N)), 4077#(< i N), 4081#(or (<= N i) (< (+ i 1) N) (<= (+ N 1) k)), 4082#(or (<= N i) (< (+ i 1) N) (<= N k)), 4078#(or (<= (+ N 1) k) (< i N))] [2022-03-15 22:05:28,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 22:05:28,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:05:28,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 22:05:28,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-03-15 22:05:28,517 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:05:28,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:05:28,900 INFO L93 Difference]: Finished difference Result 385 states and 1236 transitions. [2022-03-15 22:05:28,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 22:05:28,900 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:05:28,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:05:28,903 INFO L225 Difference]: With dead ends: 385 [2022-03-15 22:05:28,903 INFO L226 Difference]: Without dead ends: 364 [2022-03-15 22:05:28,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=319, Invalid=941, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 22:05:28,904 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:05:28,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:05:28,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-03-15 22:05:28,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 251. [2022-03-15 22:05:28,914 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:05:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 876 transitions. [2022-03-15 22:05:28,916 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 876 transitions. Word has length 15 [2022-03-15 22:05:28,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:05:28,916 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 876 transitions. [2022-03-15 22:05:28,916 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:05:28,916 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 876 transitions. [2022-03-15 22:05:28,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:05:28,917 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:05:28,917 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:05:28,942 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:05:29,131 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:05:29,132 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:05:29,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:05:29,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1442998130, now seen corresponding path program 2 times [2022-03-15 22:05:29,133 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:05:29,133 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23698050] [2022-03-15 22:05:29,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:05:29,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:05:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:05:29,514 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:05:29,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:05:29,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23698050] [2022-03-15 22:05:29,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23698050] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:05:29,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801449818] [2022-03-15 22:05:29,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:05:29,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:05:29,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:05:29,516 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:05:29,517 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:05:29,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:05:29,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:05:29,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:05:29,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:05:29,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:05:29,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:05:29,905 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:05:30,176 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:05:30,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:05:31,024 INFO L353 Elim1Store]: treesize reduction 10, result has 81.8 percent of original size [2022-03-15 22:05:31,024 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 339 treesize of output 261 [2022-03-15 22:05:38,577 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:05:38,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801449818] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:05:38,578 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:05:38,578 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-03-15 22:05:38,578 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1296259365] [2022-03-15 22:05:38,578 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:05:38,579 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:05:38,585 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 141 transitions. [2022-03-15 22:05:38,585 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:05:54,347 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [5128#(and (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (< j M) (= min1 min3) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (< i N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< j M) (= min1 min2) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N) (< i N))), 5126#(and (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (< j M) (= min1 min3) (< (+ k 1) N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< j M) (= min1 min2) (< (+ k 1) N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N))), 5111#(and (or (< j M) (= (select A i) min3) (<= (+ 2 i) N) (<= (+ min1 1) (select A i)) (<= 0 (select A i))) (or (< j M) (= min1 min2) (<= (+ 2 i) N)) (or (= min1 0) (< j M) (= (select A i) min3) (<= (+ 2 i) N) (<= (+ min1 1) (select A i))) (or (= min1 0) (<= (+ min1 1) min3) (< j M) (= (select A i) min3) (<= (+ 2 i) N)) (or (<= min2 min3) (< j M) (= (select A i) min3) (<= (+ 2 i) N))), 5115#(and (or (not (< k N)) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N) (< i N)) (or (not (< k N)) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (< i N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (= min1 min2) (< (+ k 1) N) (< i N)) (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (= min1 min3) (< (+ k 1) N) (< i N))), 5131#(and (or (not (< k N)) (= min1 0) (< j M) (not (< (select A k) min3)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i))) (or (not (< k N)) (= min1 0) (< j M) (not (< (select A k) min3)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 1) (select A k))) (or (< (select A k) min3) (not (< k N)) (= min1 0) (< j M) (= (select A i) min3) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i))) (or (< (select A k) min3) (not (< k N)) (< j M) (= (select A i) min3) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i)) (<= 0 (select A i))) (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (< j M) (= (select A i) min3) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (= min1 0) (<= (+ min1 1) min3) (< j M) (= (select A i) min3) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (<= min2 (select A k)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (= min1 min2) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i)) (<= 0 (select A i)))), 5109#(and (or (<= min2 min3) (< j M) (= min1 min3)) (or (<= (+ min3 1) min2) (< j M) (= min1 min2))), 5110#(and (or (<= (+ min3 1) min2) (< j M) (= min1 min2) (<= (+ i 1) N)) (or (<= min2 min3) (< j M) (<= (+ i 1) N) (= min1 min3))), 5133#(and (or (< (+ 2 i) N) (< j M) (= min1 min2) (<= (+ (select A i) 1) i)) (or (= min1 0) (< (+ 2 i) N) (< j M) (= min3 (select A (+ (- 1) N))) (<= (+ (select A i) 1) i)) (or (< (+ 2 i) N) (< j M) (= i min3) (= min3 (select A (+ (- 1) N)))) (or (<= 0 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (= min3 (select A (+ (- 1) N)))) (or (< (+ 2 i) N) (< j M) (<= i (select A i)) (= (select A i) min2)) (or (= 0 (+ (* (- 1) min1) i)) (< (+ 2 i) N) (< j M)) (or (< j M) (<= (+ 2 i) N)) (or (= min1 0) (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (= min3 (select A (+ (- 1) N))))), 5118#(and (or (= (select A i) min3) (< k N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i)) (<= 0 (select A i))) (or (<= min2 min3) (= (select A i) min3) (< k N) (<= (+ 2 i) N)) (or (= min1 0) (<= (+ min1 1) min3) (= (select A i) min3) (< k N) (<= (+ 2 i) N)) (or (= min1 min2) (< k N) (<= (+ 2 i) N)) (or (= min1 0) (= (select A i) min3) (< k N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i)))), 5112#(and (or (<= (+ min3 1) min2) (= min1 min2) (< k N)) (or (<= min2 min3) (< k N) (= min1 min3))), 5114#(and (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (= min1 min3) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (= min1 min2) (< (+ k 1) N)) (or (not (< k N)) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N)) (or (not (< k N)) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N))), 5124#(and (or (<= min2 min3) (< (+ j 1) M) (= (select A i) min3) (< (select A j) min2) (not (< j M)) (<= (+ 2 i) N)) (or (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (<= (+ 2 i) N)) (or (= min1 0) (< (+ j 1) M) (= (select A i) min3) (not (< j M)) (<= (+ 2 i) N) (<= (+ min1 1) (select A i))) (or (< (+ j 1) M) (= (select A i) min3) (not (< j M)) (<= (+ 2 i) N) (<= (+ min1 1) (select A i)) (<= 0 (select A i))) (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (= (select A i) min3) (not (< j M)) (<= (+ 2 i) N) (not (< (select A j) min2)) (<= (select A j) min3)) (or (= min1 0) (< (+ j 1) M) (<= (+ min1 1) min3) (= (select A i) min3) (not (< j M)) (<= (+ 2 i) N))), 5123#(and (or (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (< k N) (< i N)) (or (<= min2 min3) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (< k N) (= min1 min3) (< i N)) (or (< (+ j 1) M) (not (< j M)) (<= (+ min3 1) (select A j)) (< k N) (not (< (select A j) min2)) (< i N) (= (select A j) min1)) (or (< (+ j 1) M) (not (< j M)) (< k N) (= min1 min3) (not (< (select A j) min2)) (< i N) (<= (select A j) min3))), 5117#(and (or (<= min2 min3) (< j M) (< k N) (<= (+ i 1) N) (= min1 min3)) (or (<= (+ min3 1) min2) (< j M) (= min1 min2) (< k N) (<= (+ i 1) N))), 5120#(and (or (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2)) (or (<= min2 min3) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min3)) (or (< (+ j 1) M) (not (< j M)) (<= (+ min3 1) (select A j)) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (not (< j M)) (= min1 min3) (not (< (select A j) min2)) (<= (select A j) min3))), 5121#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ min3 1) (select A j)) (not (< (select A j) min2)) (< i N) (= (select A j) min1)) (or (< (+ j 1) M) (not (< j M)) (= min1 min3) (not (< (select A j) min2)) (< i N) (<= (select A j) min3)) (or (<= min2 min3) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min3) (< i N)) (or (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (< i N))), 5129#(and (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (not (< j M)) (<= (+ min3 1) (select A j)) (< (+ k 1) N) (not (< (select A j) min2)) (< i N) (= (select A j) min1)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< (+ j 1) M) (< (select A j) min2) (not (< (select A k) min3)) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< (+ j 1) M) (not (< (select A k) min3)) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (< (+ k 1) N) (not (< (select A j) min2)) (< i N) (= (select A j) min1)) (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min3) (< (+ k 1) N) (< i N)) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (not (< j M)) (= min1 min3) (< (+ k 1) N) (not (< (select A j) min2)) (< i N) (<= (select A j) min3)) (or (not (< k N)) (< (+ j 1) M) (not (< (select A k) min3)) (not (< j M)) (= min1 (select A k)) (< (+ k 1) N) (not (< (select A j) min2)) (< i N) (<= (select A j) (select A k))) (or (not (< k N)) (< (+ j 1) M) (< (select A j) min2) (not (< (select A k) min3)) (<= min2 (select A k)) (not (< j M)) (= min1 (select A k)) (< (+ k 1) N) (< i N))), 5116#(and (or (<= (+ min3 1) min2) (< j M) (= min1 min2) (< k N)) (or (<= min2 min3) (< j M) (< k N) (= min1 min3))), 5132#(and (or (< (select A k) min3) (not (< k N)) (= min1 0) (< (+ j 1) M) (= (select A i) min3) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i))) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (= (select A i) min3) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i)) (<= 0 (select A i))) (or (not (< k N)) (< (+ j 1) M) (not (< (select A k) min3)) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i)) (<= 0 (select A i))) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (not (< (select A j) min2)) (= (select A j) min1)) (or (not (< k N)) (< (+ j 1) M) (not (< (select A k) min3)) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (not (< (select A j) min2)) (<= (select A j) (select A k))) (or (< (select A k) min3) (not (< k N)) (= min1 0) (< (+ j 1) M) (<= (+ min1 1) min3) (= (select A i) min3) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (< (+ j 1) M) (= (select A i) min3) (< (select A j) min2) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (= (select A i) min3) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (not (< (select A j) min2)) (<= (select A j) min3)) (or (not (< k N)) (= min1 0) (< (+ j 1) M) (not (< (select A k) min3)) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i))) (or (not (< k N)) (< (+ j 1) M) (< (select A j) min2) (not (< (select A k) min3)) (<= min2 (select A k)) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (= min1 0) (< (+ j 1) M) (not (< (select A k) min3)) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 1) (select A k))) (or (not (< k N)) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (< (+ k 1) N) (<= (+ 2 i) N))), 5127#(and (or (not (< k N)) (< (+ j 1) M) (< (select A j) min2) (not (< (select A k) min3)) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N)) (or (not (< k N)) (< (+ j 1) M) (not (< (select A k) min3)) (not (< j M)) (= min1 (select A k)) (< (+ k 1) N) (not (< (select A j) min2)) (<= (select A j) (select A k))) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (not (< j M)) (<= (+ min3 1) (select A j)) (< (+ k 1) N) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min3) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (not (< j M)) (= min1 min3) (< (+ k 1) N) (not (< (select A j) min2)) (<= (select A j) min3)) (or (not (< k N)) (< (+ j 1) M) (< (select A j) min2) (not (< (select A k) min3)) (<= min2 (select A k)) (not (< j M)) (= min1 (select A k)) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (< (+ k 1) N)) (or (not (< k N)) (< (+ j 1) M) (not (< (select A k) min3)) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (< (+ k 1) N) (not (< (select A j) min2)) (= (select A j) min1))), 5134#(and (or (< (+ j 1) M) (< (+ 2 i) N) (<= i (select A i)) (< (select A j) min2) (not (< j M)) (= (select A i) min2)) (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N)) (or (<= 0 (select A (+ (- 1) N))) (< (+ j 1) M) (< (+ 2 i) N) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (not (< j M)) (= min3 (select A (+ (- 1) N)))) (or (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (= i min3) (= min3 (select A (+ (- 1) N)))) (or (= min1 0) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (= min3 (select A (+ (- 1) N))) (<= (+ (select A i) 1) i)) (or (= min1 0) (< (+ j 1) M) (< (+ 2 i) N) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (not (< j M)) (= min3 (select A (+ (- 1) N)))) (or (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (not (< (select A j) min2)) (<= (+ (select A i) 1) i) (= (select A j) min1)) (or (< (+ j 1) M) (< (+ 2 i) N) (<= i (select A i)) (not (< j M)) (= (select A i) (select A j)) (not (< (select A j) min2))) (or (< (+ j 1) M) (< (+ 2 i) N) (< (select A j) min2) (not (< j M)) (= min1 min2) (<= (+ (select A i) 1) i)) (or (< (+ j 1) M) (= 0 (+ (* (- 1) min1) i)) (< (+ 2 i) N) (not (< j M)))), 5119#(and (or (< j M) (= (select A i) min3) (< k N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i)) (<= 0 (select A i))) (or (< j M) (= min1 min2) (< k N) (<= (+ 2 i) N)) (or (= min1 0) (<= (+ min1 1) min3) (< j M) (= (select A i) min3) (< k N) (<= (+ 2 i) N)) (or (<= min2 min3) (< j M) (= (select A i) min3) (< k N) (<= (+ 2 i) N)) (or (= min1 0) (< j M) (= (select A i) min3) (< k N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i)))), 5122#(and (or (<= min2 min3) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (< k N) (= min1 min3)) (or (< (+ j 1) M) (not (< j M)) (< k N) (= min1 min3) (not (< (select A j) min2)) (<= (select A j) min3)) (or (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (< k N)) (or (< (+ j 1) M) (not (< j M)) (<= (+ min3 1) (select A j)) (< k N) (not (< (select A j) min2)) (= (select A j) min1))), 5125#(and (or (< (+ j 1) M) (= (select A i) min3) (not (< j M)) (< k N) (<= (+ 2 i) N) (not (< (select A j) min2)) (<= (select A j) min3)) (or (<= min2 min3) (< (+ j 1) M) (= (select A i) min3) (< (select A j) min2) (not (< j M)) (< k N) (<= (+ 2 i) N)) (or (< (+ j 1) M) (not (< j M)) (< k N) (<= (+ 2 i) N) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (= (select A i) min3) (not (< j M)) (< k N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i)) (<= 0 (select A i))) (or (= min1 0) (< (+ j 1) M) (= (select A i) min3) (not (< j M)) (< k N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i))) (or (= min1 0) (< (+ j 1) M) (<= (+ min1 1) min3) (= (select A i) min3) (not (< j M)) (< k N) (<= (+ 2 i) N)) (or (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (< k N) (<= (+ 2 i) N))), 5113#(and (or (<= min2 min3) (< k N) (<= (+ i 1) N) (= min1 min3)) (or (<= (+ min3 1) min2) (= min1 min2) (< k N) (<= (+ i 1) N))), 5130#(and (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (= (select A i) min3) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (not (< (select A k) min3)) (<= min2 (select A k)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (= min1 0) (<= (+ min1 1) min3) (= (select A i) min3) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (= min1 min2) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (= min1 0) (not (< (select A k) min3)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i))) (or (not (< k N)) (not (< (select A k) min3)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i)) (<= 0 (select A i))) (or (< (select A k) min3) (not (< k N)) (= (select A i) min3) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i)) (<= 0 (select A i))) (or (< (select A k) min3) (not (< k N)) (= min1 0) (= (select A i) min3) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 1) (select A i))) (or (not (< k N)) (= min1 0) (not (< (select A k) min3)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 1) (select A k))))] [2022-03-15 22:05:54,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:05:54,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:05:54,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:05:54,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1740, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:05:54,349 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:06:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:33,191 INFO L93 Difference]: Finished difference Result 1094 states and 3040 transitions. [2022-03-15 22:06:33,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-03-15 22:06:33,192 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:06:33,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:33,197 INFO L225 Difference]: With dead ends: 1094 [2022-03-15 22:06:33,197 INFO L226 Difference]: Without dead ends: 1049 [2022-03-15 22:06:33,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8651 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=4495, Invalid=22565, Unknown=0, NotChecked=0, Total=27060 [2022-03-15 22:06:33,203 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 611 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:33,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 0 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 22:06:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2022-03-15 22:06:33,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 298. [2022-03-15 22:06:33,218 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:06:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 1070 transitions. [2022-03-15 22:06:33,219 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 1070 transitions. Word has length 15 [2022-03-15 22:06:33,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:33,219 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 1070 transitions. [2022-03-15 22:06:33,220 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:06:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 1070 transitions. [2022-03-15 22:06:33,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:06:33,221 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:33,221 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:33,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 22:06:33,435 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:06:33,436 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:06:33,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:33,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1848560448, now seen corresponding path program 3 times [2022-03-15 22:06:33,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:33,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715709804] [2022-03-15 22:06:33,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:33,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:33,476 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:06:33,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:33,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715709804] [2022-03-15 22:06:33,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715709804] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:33,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718556827] [2022-03-15 22:06:33,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:06:33,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:33,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:33,478 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:06:33,478 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:06:33,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:06:33,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:33,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:06:33,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:33,552 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:06:33,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:33,599 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:06:33,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718556827] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:33,600 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:33,600 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-03-15 22:06:33,600 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [257661348] [2022-03-15 22:06:33,600 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:33,601 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:33,606 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 147 transitions. [2022-03-15 22:06:33,606 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:33,984 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [7159#(or (<= N i) (< (+ i 1) N)), 7158#(< i N)] [2022-03-15 22:06:33,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 22:06:33,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:33,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 22:06:33,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-03-15 22:06:33,985 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:06:34,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:34,146 INFO L93 Difference]: Finished difference Result 436 states and 1461 transitions. [2022-03-15 22:06:34,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:06:34,147 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:06:34,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:34,150 INFO L225 Difference]: With dead ends: 436 [2022-03-15 22:06:34,150 INFO L226 Difference]: Without dead ends: 428 [2022-03-15 22:06:34,150 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:06:34,151 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:06:34,151 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:06:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-03-15 22:06:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 277. [2022-03-15 22:06:34,160 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:06:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 994 transitions. [2022-03-15 22:06:34,161 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 994 transitions. Word has length 15 [2022-03-15 22:06:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:34,162 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 994 transitions. [2022-03-15 22:06:34,162 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:06:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 994 transitions. [2022-03-15 22:06:34,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:34,163 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:34,163 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:34,181 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:06:34,367 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:06:34,367 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:06:34,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:34,368 INFO L85 PathProgramCache]: Analyzing trace with hash 40241449, now seen corresponding path program 6 times [2022-03-15 22:06:34,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:34,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236895751] [2022-03-15 22:06:34,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:34,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:34,428 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:06:34,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:34,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236895751] [2022-03-15 22:06:34,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236895751] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:34,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584646075] [2022-03-15 22:06:34,429 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:06:34,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:34,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:34,430 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:06:34,431 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:06:34,454 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:06:34,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:34,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:06:34,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:34,499 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:06:34,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:34,557 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:06:34,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584646075] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:34,557 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:34,557 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-03-15 22:06:34,557 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [107608087] [2022-03-15 22:06:34,557 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:34,558 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:34,563 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:06:34,563 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:35,461 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [8282#(or (<= N i) (<= N k) (< (+ k 1) N)), 8287#(or (< j M) (<= k (+ 2 i))), 8289#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N)), 8285#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 8271#(or (<= N k) (< (+ k 1) N)), 8275#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 8290#(or (<= N (+ k 1)) (<= N i) (< j M) (< (+ 2 k) N)), 8273#(or (< j M) (< k N)), 8286#(or (<= N (+ 2 i)) (< j M)), 8277#(or (<= N (+ i 1)) (< k N)), 8283#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 8291#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N)), 8262#(or (<= k i) (< j M)), 8274#(or (< j M) (<= N k) (< (+ k 1) N)), 8288#(or (< j M) (<= k (+ i 1))), 8292#(or (<= N (+ k 1)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N)), 8278#(or (<= N i) (< j M)), 8284#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 8272#(or (<= N (+ k 1)) (< (+ 2 k) N)), 8269#(< j M), 8279#(or (<= N i) (< j M) (< k N)), 8281#(or (<= N (+ i 1)) (< j M) (< k N)), 8276#(or (<= N i) (< k N)), 8270#(< k N), 8280#(or (<= N (+ i 1)) (< j M))] [2022-03-15 22:06:35,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:06:35,461 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:35,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:06:35,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:06:35,462 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:06:37,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:37,534 INFO L93 Difference]: Finished difference Result 649 states and 2165 transitions. [2022-03-15 22:06:37,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 22:06:37,534 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:06:37,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:37,538 INFO L225 Difference]: With dead ends: 649 [2022-03-15 22:06:37,538 INFO L226 Difference]: Without dead ends: 642 [2022-03-15 22:06:37,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3312 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2726, Invalid=9264, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 22:06:37,542 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 357 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:37,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 0 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:06:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-03-15 22:06:37,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 354. [2022-03-15 22:06:37,555 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:06:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1325 transitions. [2022-03-15 22:06:37,557 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1325 transitions. Word has length 16 [2022-03-15 22:06:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:37,557 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 1325 transitions. [2022-03-15 22:06:37,557 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:06:37,557 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1325 transitions. [2022-03-15 22:06:37,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:37,558 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:37,558 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:37,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 22:06:37,771 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:06:37,771 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:06:37,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:37,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2020943604, now seen corresponding path program 7 times [2022-03-15 22:06:37,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:37,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76894611] [2022-03-15 22:06:37,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:37,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:37,822 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:06:37,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:37,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76894611] [2022-03-15 22:06:37,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76894611] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:37,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234515306] [2022-03-15 22:06:37,823 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:06:37,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:37,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:37,824 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:06:37,825 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:06:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:37,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:06:37,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:37,928 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:06:37,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:37,955 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:06:37,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234515306] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:37,956 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:37,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-15 22:06:37,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [388620131] [2022-03-15 22:06:37,956 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:37,957 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:37,961 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:06:37,962 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:38,715 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [9908#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 9909#(or (< k N) (< i N)), 9912#(or (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)), 9915#(or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ 2 i) N)), 9916#(or (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)), 9914#(or (<= N k) (< (+ k 1) N) (<= (+ 2 i) N)), 9907#(or (<= N (+ k 1)) (< (+ 2 k) N)), 9913#(or (< k N) (<= (+ 2 i) N)), 9905#(< k N), 9910#(or (<= N k) (< (+ k 1) N) (< i N)), 9911#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 9906#(or (<= N k) (< (+ k 1) N))] [2022-03-15 22:06:38,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:06:38,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:38,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:06:38,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2022-03-15 22:06:38,716 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:06:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:39,481 INFO L93 Difference]: Finished difference Result 745 states and 2539 transitions. [2022-03-15 22:06:39,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 22:06:39,482 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:06:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:39,486 INFO L225 Difference]: With dead ends: 745 [2022-03-15 22:06:39,486 INFO L226 Difference]: Without dead ends: 745 [2022-03-15 22:06:39,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=850, Invalid=2572, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:06:39,489 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 248 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:39,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 0 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:06:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-03-15 22:06:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 469. [2022-03-15 22:06:39,506 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:06:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1749 transitions. [2022-03-15 22:06:39,508 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1749 transitions. Word has length 16 [2022-03-15 22:06:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:39,508 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 1749 transitions. [2022-03-15 22:06:39,509 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:06:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1749 transitions. [2022-03-15 22:06:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:39,510 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:39,510 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:39,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 22:06:39,723 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:06:39,723 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:06:39,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:39,724 INFO L85 PathProgramCache]: Analyzing trace with hash -578126427, now seen corresponding path program 4 times [2022-03-15 22:06:39,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:39,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599755611] [2022-03-15 22:06:39,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:39,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:39,766 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:06:39,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:39,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599755611] [2022-03-15 22:06:39,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599755611] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:39,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533978760] [2022-03-15 22:06:39,767 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:06:39,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:39,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:39,768 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:06:39,768 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:06:39,796 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:06:39,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:39,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:06:39,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:39,838 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:06:39,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:39,880 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:06:39,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533978760] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:39,880 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:39,880 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 22:06:39,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [327046755] [2022-03-15 22:06:39,880 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:39,881 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:39,887 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 180 transitions. [2022-03-15 22:06:39,887 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:41,582 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [11787#(or (< (+ j 1) M) (<= M j)), 11789#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 11764#(< k N), 11788#(or (< (+ j 1) M) (< k N) (<= M j)), 11775#(or (< j M) (<= (+ 2 i) N)), 11783#(or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ 2 i) N)), 11780#(or (<= (+ 3 i) N) (< j M)), 11792#(or (< (+ j 1) M) (< k N) (< i N) (<= M j)), 11799#(or (<= (+ 3 i) N) (< (+ j 1) M) (<= M j)), 11800#(or (< (+ j 1) M) (<= (+ 2 i) k) (<= M j)), 11774#(or (< j M) (< k N) (< i N)), 11795#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 11776#(or (< j M) (< k N) (<= (+ 2 i) N)), 11778#(or (< j M) (<= N k) (< (+ k 1) N) (< i N)), 11777#(or (< j M) (<= N k) (< (+ k 1) N)), 11765#(or (<= N k) (< (+ k 1) N)), 11772#(or (< j M) (< k N)), 11773#(or (< j M) (< i N)), 11769#(or (< k N) (<= (+ 2 i) N)), 11781#(or (< j M) (<= (+ 2 i) k)), 11770#(or (<= N k) (< (+ k 1) N) (<= (+ 2 i) N)), 11771#(< j M), 11790#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= M j)), 11793#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (< i N) (<= M j)), 11784#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 11766#(or (<= N (+ k 1)) (< (+ 2 k) N)), 11767#(or (< k N) (< i N)), 11797#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= (+ 2 i) N) (<= M j)), 11779#(or (< j M) (<= N k) (< (+ k 1) N) (<= (+ 2 i) N)), 11791#(or (< (+ j 1) M) (< i N) (<= M j)), 11782#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 11794#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (< i N) (<= M j)), 11785#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (< i N)), 11786#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N)), 11798#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= (+ 2 i) N) (<= M j)), 11768#(or (<= N k) (< (+ k 1) N) (< i N)), 11796#(or (< (+ j 1) M) (< k N) (<= (+ 2 i) N) (<= M j))] [2022-03-15 22:06:41,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 22:06:41,583 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:41,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 22:06:41,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 22:06:41,583 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:06:46,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:46,005 INFO L93 Difference]: Finished difference Result 1012 states and 3592 transitions. [2022-03-15 22:06:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2022-03-15 22:06:46,005 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:06:46,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:46,010 INFO L225 Difference]: With dead ends: 1012 [2022-03-15 22:06:46,010 INFO L226 Difference]: Without dead ends: 1000 [2022-03-15 22:06:46,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14281 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7971, Invalid=32229, Unknown=0, NotChecked=0, Total=40200 [2022-03-15 22:06:46,014 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 602 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:46,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 0 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 22:06:46,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-03-15 22:06:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 576. [2022-03-15 22:06:46,031 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:06:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 2168 transitions. [2022-03-15 22:06:46,033 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 2168 transitions. Word has length 16 [2022-03-15 22:06:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:46,034 INFO L470 AbstractCegarLoop]: Abstraction has 576 states and 2168 transitions. [2022-03-15 22:06:46,034 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:06:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 2168 transitions. [2022-03-15 22:06:46,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:46,035 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:46,036 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:46,059 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:06:46,255 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:06:46,255 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:06:46,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:46,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1676567846, now seen corresponding path program 5 times [2022-03-15 22:06:46,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:46,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183308012] [2022-03-15 22:06:46,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:46,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:46,326 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:06:46,326 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:46,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183308012] [2022-03-15 22:06:46,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183308012] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:46,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140520708] [2022-03-15 22:06:46,326 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:06:46,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:46,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:46,328 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:06:46,329 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:06:46,356 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:06:46,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:46,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:06:46,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:46,424 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:06:46,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:46,497 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:06:46,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140520708] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:46,497 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:46,497 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-03-15 22:06:46,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1808399151] [2022-03-15 22:06:46,498 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:46,498 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:46,504 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 172 transitions. [2022-03-15 22:06:46,504 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:47,729 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [14383#(or (< (+ j 1) M) (<= M j)), 14401#(or (<= N (+ 2 i)) (< k N)), 14400#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 14402#(or (<= N (+ 2 i)) (<= N k) (< (+ k 1) N)), 14407#(or (<= N (+ i 1)) (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 14391#(or (< j M) (<= N k) (< (+ k 1) N)), 14394#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 14389#(or (< (+ j 1) M) (<= N i) (<= M j)), 14390#(or (< (+ j 1) M) (<= N i) (< k N) (<= M j)), 14387#(or (<= N i) (< j M)), 14386#(or (<= N i) (< k N)), 14397#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 14380#(< k N), 14396#(or (<= N (+ i 1)) (< k N)), 14405#(or (<= N (+ i 1)) (< (+ j 1) M) (<= M j)), 14406#(or (<= N (+ i 1)) (< (+ j 1) M) (< k N) (<= M j)), 14385#(or (<= N k) (< (+ k 1) N)), 14381#(< j M), 14393#(or (<= N i) (<= N k) (< (+ k 1) N)), 14384#(or (< (+ j 1) M) (< k N) (<= M j)), 14395#(or (< (+ j 1) M) (<= N i) (<= N k) (< (+ k 1) N) (<= M j)), 14392#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 14398#(or (<= N (+ i 1)) (< j M)), 14399#(or (<= N (+ i 1)) (< j M) (< k N)), 14404#(or (<= (+ N j) (+ 2 M i)) (<= N k) (< (+ k 1) N)), 14403#(or (<= (+ N j) (+ 2 M i)) (< k N)), 14382#(or (< j M) (< k N)), 14388#(or (<= N i) (< j M) (< k N))] [2022-03-15 22:06:47,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 22:06:47,730 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:47,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 22:06:47,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1712, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:06:47,730 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:06:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:50,296 INFO L93 Difference]: Finished difference Result 934 states and 3191 transitions. [2022-03-15 22:06:50,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-03-15 22:06:50,296 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:06:50,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:50,300 INFO L225 Difference]: With dead ends: 934 [2022-03-15 22:06:50,300 INFO L226 Difference]: Without dead ends: 929 [2022-03-15 22:06:50,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5007 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3474, Invalid=13818, Unknown=0, NotChecked=0, Total=17292 [2022-03-15 22:06:50,301 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 390 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:50,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [390 Valid, 0 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:06:50,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-03-15 22:06:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 609. [2022-03-15 22:06:50,317 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:06:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 2303 transitions. [2022-03-15 22:06:50,319 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 2303 transitions. Word has length 16 [2022-03-15 22:06:50,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:50,319 INFO L470 AbstractCegarLoop]: Abstraction has 609 states and 2303 transitions. [2022-03-15 22:06:50,320 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:06:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 2303 transitions. [2022-03-15 22:06:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:50,321 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:50,322 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:50,347 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:06:50,535 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:06:50,535 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:06:50,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:50,536 INFO L85 PathProgramCache]: Analyzing trace with hash -975824784, now seen corresponding path program 6 times [2022-03-15 22:06:50,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:50,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561288693] [2022-03-15 22:06:50,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:50,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:50,581 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:06:50,581 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:50,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561288693] [2022-03-15 22:06:50,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561288693] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:50,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973215334] [2022-03-15 22:06:50,581 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:06:50,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:50,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:50,584 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:06:50,607 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:06:50,619 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 22:06:50,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:50,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:06:50,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:50,674 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:06:50,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:50,731 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:06:50,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973215334] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:50,731 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:50,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-03-15 22:06:50,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [379366680] [2022-03-15 22:06:50,732 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:50,733 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:50,740 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 189 transitions. [2022-03-15 22:06:50,740 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:51,652 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [16841#(or (< (+ 2 j) M) (<= M (+ j 1))), 16840#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 16838#(or (< j M) (<= (+ 2 i) N)), 16843#(or (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 16836#(or (< (+ j 1) M) (<= M j)), 16837#(or (< j M) (< i N)), 16839#(or (< (+ j 1) M) (< i N) (<= M j)), 16842#(or (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 16835#(< j M)] [2022-03-15 22:06:51,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:06:51,653 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:51,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:06:51,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:06:51,653 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:06:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:52,067 INFO L93 Difference]: Finished difference Result 1081 states and 4109 transitions. [2022-03-15 22:06:52,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 22:06:52,067 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:06:52,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:52,072 INFO L225 Difference]: With dead ends: 1081 [2022-03-15 22:06:52,072 INFO L226 Difference]: Without dead ends: 1081 [2022-03-15 22:06:52,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=369, Invalid=963, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 22:06:52,073 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:52,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:06:52,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2022-03-15 22:06:52,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 727. [2022-03-15 22:06:52,090 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:06:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 2790 transitions. [2022-03-15 22:06:52,093 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 2790 transitions. Word has length 16 [2022-03-15 22:06:52,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:52,093 INFO L470 AbstractCegarLoop]: Abstraction has 727 states and 2790 transitions. [2022-03-15 22:06:52,093 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:06:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 2790 transitions. [2022-03-15 22:06:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:06:52,095 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:52,095 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:52,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 22:06:52,318 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:06:52,318 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:06:52,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:52,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1822388072, now seen corresponding path program 8 times [2022-03-15 22:06:52,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:52,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622253032] [2022-03-15 22:06:52,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:52,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:52,987 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:06:52,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:52,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622253032] [2022-03-15 22:06:52,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622253032] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:52,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368942680] [2022-03-15 22:06:52,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:06:52,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:52,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:52,989 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:06:52,990 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:06:53,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:06:53,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:53,017 WARN L261 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-15 22:06:53,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:53,711 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 153 [2022-03-15 22:06:53,960 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:06:53,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:56,352 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:06:56,353 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 1679 treesize of output 925 [2022-03-15 22:07:16,915 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:07:16,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368942680] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:07:16,915 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:07:16,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 22:07:16,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1192521907] [2022-03-15 22:07:16,915 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:07:16,916 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:07:16,922 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 173 transitions. [2022-03-15 22:07:16,923 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:08:11,697 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [19534#(and (or (<= min2 min3) (< j M) (= min1 min3)) (or (<= (+ min3 1) min2) (< j M) (= min1 min2))), 19573#(and (or (< j M) (= min1 min3)) (or (< j M) (= i 0)) (or (< j M) (= min1 min2)) (or (< j M) (= i min3)) (or (< j M) (= k 0))), 19566#(and (or (< (+ 2 i) N) (<= (+ min1 1) min2) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (<= (+ (select A i) 1) min2)) (or (<= (+ 3 i) N) (<= min3 (select A k)) (< (select A (+ 2 k)) (select A k)) (= min1 min2) (<= (+ (select A k) 1) min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (<= (+ 3 i) N) (<= min3 (select A k)) (< (select A (+ 2 k)) (select A (+ k 1))) (= min1 min2) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= (+ 3 i) N) (<= min2 min3) (<= (+ (select A (+ i 1)) 1) min1) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (< (select A i) min1) (= min1 min3) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< (select A k) min3) (<= (+ 3 i) N) (<= min3 (select A (+ k 1))) (<= (+ (select A (+ 2 k)) 1) min2) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (<= (+ 3 i) N) (<= min1 (select A i)) (= (select A k) (select A (+ i 1))) (<= (select A i) (select A (+ i 1))) (< (select A (+ 2 k)) (select A k)) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (<= (+ (select A (+ 2 k)) 1) min2) (<= min3 (select A k)) (= min1 min2) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (<= min3 (select A k)) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k))) (<= min2 (select A (+ 2 k)))) (or (< (select A k) min3) (<= (+ 3 i) N) (<= min3 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= (+ 3 i) N) (= (select A k) (select A (+ i 1))) (< (select A (+ 2 k)) (select A k)) (< (select A i) min1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= min1 (select A (+ i 1)))) (or (<= (+ 3 i) N) (<= min3 (select A k)) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (< (select A i) min1) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k)) (<= min2 (select A (+ 2 k)))) (or (< (select A k) min3) (<= (+ 3 i) N) (<= (+ min3 1) min2) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (select A k) min3) (<= (+ 3 i) N) (<= min3 (select A (+ 2 k))) (<= (+ (select A (+ i 1)) 1) min1) (< (select A (+ k 1)) min3) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (<= min2 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (<= (+ (select A (+ 2 k)) 1) min2) (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (<= (+ 3 i) N) (<= min1 (select A i)) (< (select A (+ k 1)) min3) (= (select A i) min3) (<= (+ (select A (+ i 1)) 1) (select A i)) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (<= min1 (select A i)) (< (select A (+ 2 k)) min3) (= min3 (select A (+ i 1))) (<= (select A i) (select A (+ i 1))) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (select A k) min3) (<= (+ 3 i) N) (<= min3 (select A (+ 2 k))) (< (select A (+ k 1)) min3) (<= (+ (select A (+ 2 k)) 1) min2) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (<= min3 (select A k)) (<= min2 (select A k)) (< (select A (+ 2 k)) (select A k)) (= min1 (select A k)) (< (select A i) min1) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (<= (+ 3 i) N) (< (select A (+ 2 k)) min3) (= min3 (select A (+ i 1))) (< (select A i) min1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= min1 (select A (+ i 1)))) (or (< (select A k) min3) (<= (+ 3 i) N) (<= min3 (select A (+ k 1))) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (< (select A i) min1) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (<= min1 (select A i)) (= (select A i) (select A k)) (<= (+ (select A (+ i 1)) 1) (select A i)) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (<= min3 (select A (+ k 1))) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k))) (<= min2 (select A (+ 2 k))))), 19554#(and (or (< j M) (<= min3 (select A k)) (<= min2 (select A k)) (< (select A (+ 2 k)) (select A k)) (= min1 (select A k)) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= min3 (select A (+ 2 k))) (< (select A (+ k 1)) min3) (< j M) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (<= min2 (select A (+ 2 k)))) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (< j M) (<= (+ (select A (+ 2 k)) 1) min2) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (< j M) (< (select A (+ 2 k)) (select A (+ k 1))) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= (+ min3 1) min2) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (< j M) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (< j M) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k))) (<= min2 (select A (+ 2 k)))) (or (< (select A k) min3) (<= min2 min3) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (< j M) (= min1 min3) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (select A k) min3) (<= min3 (select A (+ 2 k))) (< (select A (+ k 1)) min3) (< j M) (<= (+ (select A (+ 2 k)) 1) min2) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< j M) (<= min3 (select A k)) (< (select A (+ 2 k)) (select A k)) (= min1 min2) (<= (+ (select A k) 1) min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (< j M) (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k)) (<= min2 (select A (+ 2 k)))) (or (< j M) (<= (+ (select A (+ 2 k)) 1) min2) (<= min3 (select A k)) (= min1 min2) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (< j M) (<= min3 (select A k)) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N)) (or (< j M) (<= min3 (select A k)) (< (select A (+ 2 k)) (select A (+ k 1))) (= min1 min2) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (< j M) (<= (+ (select A (+ 2 k)) 1) min2) (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (< j M) (<= min3 (select A k)) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k))) (<= min2 (select A (+ 2 k))))), 19572#(and (or (< j M) (= i 0)) (or (< j M) (= i min1)) (or (< j M) (= i min2)) (or (< j M) (= i min3) (<= (+ (select A i) 1) i)) (or (< j M) (= (select A i) min3) (<= i (select A i))) (or (<= (+ i 1) k) (< j M))), 19571#(and (or (< j M) (<= (+ 2 i) k)) (or (< (+ 2 i) k) (<= (select A i) (select A (+ (- 1) k))) (< j M) (= i min3) (= (select A (+ (- 1) k)) min3)) (or (< (+ 2 i) k) (< j M) (not (= i min3)) (<= i (select A (+ (- 1) k)))) (or (< (+ 2 i) k) (< j M) (= i min2)) (or (< (+ 2 i) k) (< j M) (= i min3) (<= (+ (select A i) 1) i) (<= (+ (select A (+ (- 1) k)) 1) (select A i))) (or (< (+ 2 i) k) (< j M) (= (select A i) min3) (= i min3) (<= (+ (select A (+ (- 1) k)) 1) (select A i))) (or (< (+ 2 i) k) (< j M) (<= i (select A i)) (not (= i min3))) (or (< (+ 2 i) k) (< j M) (= i min1)) (or (< (+ 2 i) k) (<= (select A i) (select A (+ (- 1) k))) (< j M) (= i min3) (<= (+ (select A (+ (- 1) k)) 1) min1))), 19569#(and (or (<= (+ 3 i) N) (<= min1 (select A i)) (< (select A (+ 2 k)) min3) (= min3 (select A (+ i 1))) (< j M) (<= (select A i) (select A (+ i 1))) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< (select A (+ 2 k)) min3) (= min3 (select A (+ i 1))) (< j M) (< (select A i) min1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= min1 (select A (+ i 1)))) (or (< (select A k) min3) (<= (+ 3 i) N) (<= min3 (select A (+ k 1))) (< j M) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (< (select A i) min1) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (select A k) min3) (<= (+ 3 i) N) (<= min3 (select A (+ 2 k))) (<= (+ (select A (+ i 1)) 1) min1) (< (select A (+ k 1)) min3) (< j M) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (<= min2 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< j M) (<= min3 (select A k)) (< (select A (+ 2 k)) (select A (+ k 1))) (= min1 min2) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= (+ 3 i) N) (<= min3 (select A (+ k 1))) (< j M) (< (select A (+ 2 k)) (select A (+ k 1))) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (< j M) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< (select A k) min3) (<= (+ 3 i) N) (<= (+ min3 1) min2) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (< j M) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A (+ 2 k)) 1) min2) (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (< j M) (<= min3 (select A k)) (<= min2 (select A k)) (< (select A (+ 2 k)) (select A k)) (= min1 (select A k)) (< (select A i) min1) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= (+ 3 i) N) (<= min3 (select A (+ k 1))) (< j M) (<= (+ (select A (+ 2 k)) 1) min2) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (< (select A k) min3) (<= (+ 3 i) N) (<= min2 min3) (<= (+ (select A (+ i 1)) 1) min1) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (< j M) (< (select A i) min1) (= min1 min3) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (<= min1 (select A i)) (< j M) (= (select A i) (select A k)) (<= (+ (select A (+ i 1)) 1) (select A i)) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (<= (+ 3 i) N) (<= min1 (select A i)) (< (select A (+ k 1)) min3) (< j M) (= (select A i) min3) (<= (+ (select A (+ i 1)) 1) (select A i)) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (< j M) (<= min3 (select A k)) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k))) (<= min2 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (< j M) (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k)) (<= min2 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (<= min1 (select A i)) (= (select A k) (select A (+ i 1))) (< j M) (<= (select A i) (select A (+ i 1))) (< (select A (+ 2 k)) (select A k)) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A (+ 2 k)) 1) min2) (<= min3 (select A k)) (= min1 min2) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (< (+ 2 i) N) (< j M) (<= (+ min1 1) min2) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (<= (+ (select A i) 1) min2)) (or (< (select A k) min3) (<= (+ 3 i) N) (<= min3 (select A (+ 2 k))) (< (select A (+ k 1)) min3) (< j M) (<= (+ (select A (+ 2 k)) 1) min2) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (= (select A k) (select A (+ i 1))) (< j M) (< (select A (+ 2 k)) (select A k)) (< (select A i) min1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= min1 (select A (+ i 1)))) (or (<= (+ 3 i) N) (< j M) (<= min3 (select A k)) (< (select A (+ 2 k)) (select A k)) (= min1 min2) (<= (+ (select A k) 1) min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (<= min3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k))) (<= min2 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< j M) (<= min3 (select A k)) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (< (select A i) min1) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N))), 19555#(and (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (< j M) (= min1 min3) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (< i N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< j M) (= min1 min2) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N) (< i N))), 19557#(and (or (< j M) (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k)) (< i N) (<= min2 (select A (+ 2 k)))) (or (< j M) (<= min3 (select A k)) (< (select A (+ 2 k)) (select A (+ k 1))) (= min1 min2) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (< j M) (<= (+ (select A (+ 2 k)) 1) min2) (<= min3 (select A k)) (= min1 min2) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (< i N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (< j M) (<= (+ (select A (+ 2 k)) 1) min2) (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k)) (< i N)) (or (< j M) (<= min3 (select A k)) (< (select A (+ 2 k)) (select A k)) (= min1 min2) (<= (+ (select A k) 1) min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k)) (< i N)) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (< j M) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (< j M) (<= min3 (select A k)) (<= min2 (select A k)) (< (select A (+ 2 k)) (select A k)) (= min1 (select A k)) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k)) (< i N)) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (< j M) (< (select A (+ 2 k)) (select A (+ k 1))) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (< i N) (<= (select A (+ k 1)) (select A (+ 2 k))) (<= min2 (select A (+ 2 k)))) (or (< (select A k) min3) (<= min2 min3) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (< j M) (= min1 min3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (< (select A k) min3) (<= min3 (select A (+ 2 k))) (< (select A (+ k 1)) min3) (< j M) (<= (+ (select A (+ 2 k)) 1) min2) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (< j M) (<= min3 (select A k)) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (< i N) (<= (select A (+ k 1)) (select A (+ 2 k))) (<= min2 (select A (+ 2 k)))) (or (< (select A k) min3) (<= min3 (select A (+ 2 k))) (< (select A (+ k 1)) min3) (< j M) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (< i N) (<= min2 (select A (+ 2 k)))) (or (< j M) (<= min3 (select A k)) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (< i N)) (or (< (select A k) min3) (<= (+ min3 1) min2) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (< j M) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (< j M) (<= (+ (select A (+ 2 k)) 1) min2) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (<= (select A (+ k 1)) (select A (+ 2 k))))), 19562#(and (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (< j M) (<= (+ min1 1) min2) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min1 (select A i)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= min1 (select A i)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min1 (select A i)) (< (select A (+ k 1)) min3) (< j M) (= (select A i) min3) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= min1 (select A i)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N))), 19556#(and (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min3) (< i N)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (select A k) (select A (+ k 1))) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min2) (< i N)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A (+ k 1)) (select A k)) (< i N)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k)) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< i N))), 19550#(and (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min3) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min2) (< i N)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (select A k) (select A (+ k 1))) (< i N)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A (+ k 1)) (select A k)) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k)) (< i N))), 19548#(and (or (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k)) (<= min2 (select A (+ 2 k)))) (or (< (select A k) min3) (<= (+ min3 1) min2) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= min3 (select A k)) (< (select A (+ 2 k)) (select A (+ k 1))) (= min1 min2) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k))) (<= min2 (select A (+ 2 k)))) (or (<= min3 (select A k)) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k))) (<= min2 (select A (+ 2 k)))) (or (< (select A k) min3) (<= min3 (select A (+ 2 k))) (< (select A (+ k 1)) min3) (<= (+ (select A (+ 2 k)) 1) min2) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= min3 (select A k)) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N)) (or (< (select A k) min3) (<= min3 (select A (+ 2 k))) (< (select A (+ k 1)) min3) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (<= min2 (select A (+ 2 k)))) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (<= (+ (select A (+ 2 k)) 1) min2) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (<= (+ (select A (+ 2 k)) 1) min2) (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (<= min3 (select A k)) (<= min2 (select A k)) (< (select A (+ 2 k)) (select A k)) (= min1 (select A k)) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= (+ (select A (+ 2 k)) 1) min2) (<= min3 (select A k)) (= min1 min2) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (<= min3 (select A k)) (< (select A (+ 2 k)) (select A k)) (= min1 min2) (<= (+ (select A k) 1) min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= min2 min3) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (= min1 min3) (<= N (+ 2 k)) (< (+ 3 k) N))), 19568#(and (or (<= N (+ k 1)) (<= (+ 3 i) N) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= min1 (select A i)) (< (select A (+ k 1)) min3) (= min3 (select A (+ i 1))) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 2 k) N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (<= min2 min3) (<= (+ (select A (+ i 1)) 1) min1) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (< (select A i) min1) (= min1 min3)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (<= min1 (select A i)) (< j M) (= (select A i) min3) (< (+ 2 k) N) (<= (+ (select A (+ i 1)) 1) (select A i))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (select A (+ k 1)) min3) (= min3 (select A (+ i 1))) (< j M) (< (+ 2 k) N) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (< (+ 2 i) N) (< j M) (<= (+ min1 1) min2) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A i) 1) min2)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min2)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (select A k) (select A (+ k 1))))), 19565#(and (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (< (+ 2 i) N) (<= (+ min1 1) min2) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A i) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (<= min2 min3) (<= (+ (select A (+ i 1)) 1) min1) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (< (select A i) min1) (= min1 min3)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= min1 (select A i)) (< (select A (+ k 1)) min3) (= min3 (select A (+ i 1))) (<= (select A i) (select A (+ i 1))) (< (+ 2 k) N)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (select A (+ k 1)) min3) (= min3 (select A (+ i 1))) (< (+ 2 k) N) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (select A k) (select A (+ k 1)))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1)))) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (<= min1 (select A i)) (= (select A i) min3) (< (+ 2 k) N) (<= (+ (select A (+ i 1)) 1) (select A i))) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min2))), 19558#(and (or (not (< k N)) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (<= min1 (select A i)) (= (select A i) min3) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (<= min1 (select A i)) (not (< (select A k) min3)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (= min1 min2) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (= min1 min3) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (not (< k N)) (<= (+ min1 1) min2) (= min1 min2) (< (+ k 1) N) (<= (+ 2 i) N))), 19560#(and (or (< (select A k) min3) (<= min3 (select A (+ 2 k))) (< (select A (+ k 1)) min3) (<= N (+ 2 k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (<= min2 (select A (+ 2 k)))) (or (<= (+ (select A (+ 2 k)) 1) min2) (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (= min1 min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (<= min3 (select A k)) (<= N (+ 2 k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (= (select A (+ 2 k)) min1) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k))) (<= min2 (select A (+ 2 k)))) (or (< (select A k) min3) (<= min1 (select A i)) (<= min3 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (= (select A i) (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< (select A k) min3) (<= min1 (select A i)) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (= (select A i) min3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< (select A k) min3) (<= min1 (select A i)) (<= min3 (select A (+ k 1))) (= (select A i) (select A (+ 2 k))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (<= min3 (select A k)) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N)) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< (select A k) min3) (<= min3 (select A (+ 2 k))) (<= min1 (select A i)) (= (select A i) (select A (+ 2 k))) (< (select A (+ k 1)) min3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (= min1 min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= (+ min3 1) min2) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (= min1 min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= (+ min1 1) min2) (= min1 min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= min3 (select A k)) (< (select A (+ 2 k)) (select A k)) (= min1 min2) (<= (+ (select A k) 1) min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (<= min1 (select A i)) (= (select A i) (select A (+ 2 k))) (<= min3 (select A k)) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (<= (+ (select A (+ 2 k)) 1) min2) (= min1 min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (<= min1 (select A i)) (<= min3 (select A k)) (< (select A (+ 2 k)) (select A k)) (= (select A i) (select A k)) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (<= (+ (select A (+ 2 k)) 1) min2) (<= min3 (select A k)) (= min1 min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (<= N (+ 2 k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k)) (<= min2 (select A (+ 2 k)))) (or (< (select A k) min3) (<= min3 (select A (+ 2 k))) (< (select A (+ k 1)) min3) (<= (+ (select A (+ 2 k)) 1) min2) (= min1 min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= min1 (select A i)) (<= min3 (select A k)) (< (select A (+ 2 k)) (select A (+ k 1))) (= (select A i) (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N)) (or (< (select A k) min3) (<= min2 min3) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (= min1 min3) (<= N (+ 2 k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= min3 (select A k)) (<= min2 (select A k)) (< (select A (+ 2 k)) (select A k)) (= min1 (select A k)) (<= N (+ 2 k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (<= min3 (select A k)) (< (select A (+ 2 k)) (select A (+ k 1))) (= min1 min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= min1 (select A i)) (= (select A i) (select A (+ 2 k))) (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k))) (<= min2 (select A (+ 2 k))))), 19567#(and (or (< (select A k) min3) (<= (+ 3 i) N) (not (< k N)) (= min3 (select A (+ i 1))) (< j M) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ k 1) N)) (or (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (< j M) (<= min3 (select A k)) (<= min2 (select A k)) (<= N k) (= min1 (select A k)) (< (+ k 1) N)) (or (<= (+ 3 i) N) (<= min1 (select A i)) (< j M) (<= min3 (select A k)) (<= N k) (<= (+ (select A k) 1) min2) (< (+ k 1) N)) (or (< (select A k) min3) (<= (+ 3 i) N) (not (< k N)) (= min3 (select A (+ i 1))) (< j M) (< (select A i) min1) (< (+ k 1) N) (<= min1 (select A (+ i 1)))) (or (<= (+ 3 i) N) (< j M) (<= min3 (select A k)) (<= N k) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N)) (or (< (select A k) min3) (<= (+ 3 i) N) (<= min1 (select A i)) (< j M) (= (select A i) min3) (<= N k) (<= (+ (select A (+ i 1)) 1) (select A i)) (< (+ k 1) N)) (or (<= (+ 3 i) N) (< j M) (<= min3 (select A k)) (<= min2 (select A k)) (<= N k) (= (select A i) (select A k)) (<= (+ (select A (+ i 1)) 1) (select A i)) (< (+ k 1) N)) (or (< (select A k) min3) (<= (+ 3 i) N) (not (< k N)) (<= min2 min3) (<= (+ (select A (+ i 1)) 1) min1) (< j M) (< (select A i) min1) (= min1 min3) (< (+ k 1) N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= (+ 3 i) N) (<= (+ min3 1) min2) (< j M) (<= N k) (= min1 min2) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 i) N) (< j M) (<= (+ min1 1) min2) (= min1 min2) (< (+ k 1) N) (<= (+ (select A i) 1) min2))), 19559#(and (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= min1 (select A i)) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min1 (select A i)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (+ min1 1) min2) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (<= min1 (select A i)) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min1 (select A i)) (< (select A (+ k 1)) min3) (= (select A i) min3) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N))), 19551#(and (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (< (select A k) min3) (<= min3 (select A (+ 2 k))) (< (select A (+ k 1)) min3) (<= (+ (select A (+ 2 k)) 1) min2) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (<= min3 (select A k)) (<= min2 (select A k)) (< (select A (+ 2 k)) (select A k)) (= min1 (select A k)) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k)) (< i N)) (or (<= (+ (select A (+ 2 k)) 1) min2) (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k)) (< i N)) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (< i N) (<= (select A (+ k 1)) (select A (+ 2 k))) (<= min2 (select A (+ 2 k)))) (or (<= min3 (select A k)) (< (select A (+ 2 k)) (select A k)) (= min1 min2) (<= (+ (select A k) 1) min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k)) (< i N)) (or (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k)) (< i N) (<= min2 (select A (+ 2 k)))) (or (<= min3 (select A k)) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (< i N) (<= (select A (+ k 1)) (select A (+ 2 k))) (<= min2 (select A (+ 2 k)))) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (< (select A k) min3) (<= min2 min3) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (= min1 min3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (<= min3 (select A k)) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (< i N)) (or (< (select A k) min3) (<= min3 (select A (+ 2 k))) (< (select A (+ k 1)) min3) (<= N (+ 2 k)) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (< i N) (<= min2 (select A (+ 2 k)))) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (<= (+ (select A (+ 2 k)) 1) min2) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (< (select A k) min3) (<= (+ min3 1) min2) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (= min1 min2) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (<= min3 (select A k)) (< (select A (+ 2 k)) (select A (+ k 1))) (= min1 min2) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (<= (+ (select A (+ 2 k)) 1) min2) (<= min3 (select A k)) (= min1 min2) (<= N (+ 2 k)) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (< i N) (<= (select A (+ k 1)) (select A (+ 2 k))))), 19546#(and (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (= min1 min3) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (= min1 min2) (< (+ k 1) N)) (or (not (< k N)) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N)) (or (not (< k N)) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N))), 19547#(and (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min2)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min3)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (select A k) (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A (+ k 1)) 1) min2))), 19535#(and (or (<= (+ min3 1) min2) (< j M) (= min1 min2) (<= (+ i 1) N)) (or (<= min2 min3) (< j M) (<= (+ i 1) N) (= min1 min3))), 19536#(and (or (<= (+ min3 1) min2) (< j M) (= min1 min2) (<= (+ 2 i) N)) (or (<= min2 min3) (< j M) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (< j M) (<= (+ min1 1) min2) (= min1 min2) (<= (+ 2 i) N)) (or (<= min1 (select A i)) (< j M) (= (select A i) min3) (<= (+ 2 i) N))), 19543#(and (or (<= (+ min3 1) min2) (< j M) (= min1 min2) (< k N) (<= (+ 2 i) N)) (or (<= min2 min3) (< j M) (< k N) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= min1 (select A i)) (< j M) (= (select A i) min3) (< k N) (<= (+ 2 i) N)) (or (< j M) (<= (+ min1 1) min2) (= min1 min2) (< k N) (<= (+ 2 i) N))), 19552#(and (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (< j M) (= min1 min3) (< (+ k 1) N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< j M) (= min1 min2) (< (+ k 1) N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N))), 19545#(and (or (<= (+ min3 1) min2) (< (+ 2 i) N) (< j M) (= min1 min2) (< k N)) (or (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (= (select A i) min3) (< k N)) (or (< (+ 2 i) N) (< j M) (<= (+ min1 1) min2) (= min1 min2) (< k N) (<= (+ (select A i) 1) min2)) (or (< (+ 2 i) N) (< j M) (< k N) (= min3 (select A (+ (- 1) N))) (<= min1 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (<= min2 min3) (< (+ 2 i) N) (< j M) (< k N) (<= (+ (select A (+ (- 1) N)) 1) min1) (= min1 min3) (<= (+ (select A i) 1) min1)) (or (< j M) (< k N) (<= (+ 2 i) N))), 19564#(and (or (<= (+ 3 i) N) (<= min1 (select A i)) (<= min3 (select A k)) (<= N k) (<= (+ (select A k) 1) min2) (< (+ k 1) N)) (or (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (<= min3 (select A k)) (<= min2 (select A k)) (<= N k) (= min1 (select A k)) (< (+ k 1) N)) (or (<= (+ 3 i) N) (<= min3 (select A k)) (<= N k) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N)) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= (+ 3 i) N) (<= (+ min3 1) min2) (<= N k) (= min1 min2) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 i) N) (<= (+ min1 1) min2) (= min1 min2) (< (+ k 1) N) (<= (+ (select A i) 1) min2)) (or (< (select A k) min3) (<= (+ 3 i) N) (not (< k N)) (= min3 (select A (+ i 1))) (< (select A i) min1) (< (+ k 1) N) (<= min1 (select A (+ i 1)))) (or (< (select A k) min3) (<= (+ 3 i) N) (not (< k N)) (= min3 (select A (+ i 1))) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ k 1) N)) (or (< (select A k) min3) (<= (+ 3 i) N) (not (< k N)) (<= min2 min3) (<= (+ (select A (+ i 1)) 1) min1) (< (select A i) min1) (= min1 min3) (< (+ k 1) N)) (or (<= (+ 3 i) N) (<= min3 (select A k)) (<= min2 (select A k)) (<= N k) (= (select A i) (select A k)) (<= (+ (select A (+ i 1)) 1) (select A i)) (< (+ k 1) N)) (or (< (select A k) min3) (<= (+ 3 i) N) (<= min1 (select A i)) (= (select A i) min3) (<= N k) (<= (+ (select A (+ i 1)) 1) (select A i)) (< (+ k 1) N))), 19563#(and (or (< (select A k) min3) (<= min3 (select A (+ 2 k))) (<= min1 (select A i)) (= (select A i) (select A (+ 2 k))) (< (select A (+ k 1)) min3) (< j M) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (< j M) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< j M) (<= (+ min1 1) min2) (= min1 min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= min1 (select A i)) (< j M) (<= min3 (select A k)) (< (select A (+ 2 k)) (select A k)) (= (select A i) (select A k)) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= min3 (select A (+ 2 k))) (< (select A (+ k 1)) min3) (< j M) (<= N (+ 2 k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (<= min2 (select A (+ 2 k)))) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (< j M) (< (select A (+ 2 k)) (select A (+ k 1))) (= min1 min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= min1 (select A i)) (= (select A i) (select A (+ 2 k))) (< j M) (<= min3 (select A k)) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (< (select A k) min3) (<= min3 (select A (+ 2 k))) (< (select A (+ k 1)) min3) (< j M) (<= (+ (select A (+ 2 k)) 1) min2) (= min1 min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k))) (<= min2 (select A (+ 2 k)))) (or (< (select A k) min3) (<= min3 (select A (+ k 1))) (< j M) (<= (+ (select A (+ 2 k)) 1) min2) (= min1 min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (<= min1 (select A i)) (< j M) (<= min3 (select A k)) (< (select A (+ 2 k)) (select A (+ k 1))) (= (select A i) (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N)) (or (< (select A k) min3) (<= (+ min3 1) min2) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (< j M) (= min1 min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< j M) (<= (+ (select A (+ 2 k)) 1) min2) (<= min3 (select A k)) (= min1 min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (< j M) (<= min3 (select A k)) (< (select A (+ 2 k)) (select A k)) (= min1 min2) (<= (+ (select A k) 1) min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= min1 (select A i)) (<= min3 (select A (+ k 1))) (< j M) (< (select A (+ 2 k)) (select A (+ k 1))) (= (select A i) (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< (select A k) min3) (<= min2 min3) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (< j M) (= min1 min3) (<= N (+ 2 k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< j M) (<= (+ (select A (+ 2 k)) 1) min2) (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (= min1 min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (<= min1 (select A i)) (= (select A i) (select A (+ 2 k))) (< j M) (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (< j M) (<= min3 (select A k)) (<= min2 (select A k)) (< (select A (+ 2 k)) (select A k)) (= min1 (select A k)) (<= N (+ 2 k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k))) (or (< j M) (<= min3 (select A k)) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A (+ 2 k)) (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N)) (or (< j M) (<= min3 (select A k)) (<= (select A k) (select A (+ 2 k))) (<= N (+ 2 k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (= (select A (+ 2 k)) min1) (< (+ 3 k) N) (< (select A (+ k 1)) (select A k)) (<= min2 (select A (+ 2 k)))) (or (< (select A k) min3) (<= min1 (select A i)) (< (select A (+ 2 k)) min3) (< (select A (+ k 1)) min3) (< j M) (= (select A i) min3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< (select A k) min3) (<= min1 (select A i)) (<= min3 (select A (+ k 1))) (= (select A i) (select A (+ 2 k))) (< j M) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k)))) (or (< j M) (<= min3 (select A k)) (< (select A (+ 2 k)) (select A (+ k 1))) (= min1 min2) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (< j M) (<= min3 (select A k)) (<= N (+ 2 k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (= (select A (+ 2 k)) min1) (<= (select A k) (select A (+ k 1))) (< (+ 3 k) N) (<= (select A (+ k 1)) (select A (+ 2 k))) (<= min2 (select A (+ 2 k))))), 19541#(and (or (<= (+ min3 1) min2) (< j M) (= min1 min2) (< k N)) (or (<= min2 min3) (< j M) (< k N) (= min1 min3))), 19570#(and (or (= 0 (+ (* (- 1) min1) i)) (< j M) (< (+ 3 i) N)) (or (< j M) (= (+ (* (- 1) min2) i) 0) (< (+ 3 i) N)) (or (= (+ (* (- 1) min3) i) 0) (< j M) (<= (+ (select A (+ (- 2) N)) 1) min1) (< (+ 3 i) N) (<= (+ (select A (+ (- 1) N)) 1) i) (<= (+ (select A i) 1) i)) (or (< j M) (<= (+ (select A (+ (- 2) N)) 1) min1) (<= i (select A (+ (- 1) N))) (< (+ 3 i) N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (<= (+ 3 i) N) (< j M)) (or (<= (select A i) (select A (+ (- 2) N))) (< j M) (<= (+ (select A (+ (- 1) N)) 1) (select A (+ (- 2) N))) (< (+ 3 i) N) (= (select A (+ (- 2) N)) min3) (<= i (select A (+ (- 2) N)))) (or (< j M) (<= (select A (+ (- 2) N)) (select A (+ (- 1) N))) (< (+ 3 i) N) (<= i (select A (+ (- 2) N))) (= min3 (select A (+ (- 1) N))) (<= (+ (select A i) 1) i)) (or (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (<= (+ (select A (+ (- 2) N)) 1) (select A i)) (< j M) (= (select A i) min3) (<= i (select A i)) (< (+ 3 i) N)) (or (< j M) (<= i (select A i)) (<= (select A (+ (- 2) N)) (select A (+ (- 1) N))) (< (+ 3 i) N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N))))), 19549#(and (or (not (< k N)) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N) (< i N)) (or (not (< k N)) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (< i N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (= min1 min2) (< (+ k 1) N) (< i N)) (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (= min1 min3) (< (+ k 1) N) (< i N))), 19561#(and (or (< (select A k) min3) (not (< k N)) (<= min1 (select A i)) (< j M) (= (select A i) min3) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< j M) (= min1 min2) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (<= (+ min1 1) min2) (= min1 min2) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (not (< k N)) (<= min1 (select A i)) (< j M) (not (< (select A k) min3)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (< j M) (= min1 min3) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N))), 19539#(and (or (<= min2 min3) (< k N) (<= (+ i 1) N) (= min1 min3)) (or (<= (+ min3 1) min2) (= min1 min2) (< k N) (<= (+ i 1) N))), 19553#(and (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min3)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (select A k) (select A (+ k 1))))), 19537#(and (or (< (+ 2 i) N) (< j M) (<= (+ min1 1) min2) (= min1 min2) (<= (+ (select A i) 1) min2)) (or (< j M) (<= (+ 2 i) N)) (or (<= (+ min3 1) min2) (< (+ 2 i) N) (< j M) (= min1 min2)) (or (< (+ 2 i) N) (< j M) (= min3 (select A (+ (- 1) N))) (<= min1 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (= (select A i) min3)) (or (<= min2 min3) (< (+ 2 i) N) (< j M) (<= (+ (select A (+ (- 1) N)) 1) min1) (= min1 min3) (<= (+ (select A i) 1) min1))), 19544#(and (or (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (<= min1 (select A i)) (< (+ 2 i) N) (= (select A i) min3) (< k N)) (or (<= min2 min3) (< (+ 2 i) N) (< k N) (<= (+ (select A (+ (- 1) N)) 1) min1) (= min1 min3) (<= (+ (select A i) 1) min1)) (or (< k N) (<= (+ 2 i) N)) (or (< (+ 2 i) N) (< k N) (= min3 (select A (+ (- 1) N))) (<= min1 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (< (+ 2 i) N) (<= (+ min1 1) min2) (= min1 min2) (< k N) (<= (+ (select A i) 1) min2)) (or (<= (+ min3 1) min2) (< (+ 2 i) N) (= min1 min2) (< k N))), 19540#(and (or (<= min2 min3) (< k N) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= (+ min1 1) min2) (= min1 min2) (< k N) (<= (+ 2 i) N)) (or (<= (+ min3 1) min2) (= min1 min2) (< k N) (<= (+ 2 i) N)) (or (<= min1 (select A i)) (= (select A i) min3) (< k N) (<= (+ 2 i) N))), 19542#(and (or (<= min2 min3) (< j M) (< k N) (<= (+ i 1) N) (= min1 min3)) (or (<= (+ min3 1) min2) (< j M) (= min1 min2) (< k N) (<= (+ i 1) N))), 19538#(and (or (<= (+ min3 1) min2) (= min1 min2) (< k N)) (or (<= min2 min3) (< k N) (= min1 min3)))] [2022-03-15 22:08:11,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 22:08:11,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:08:11,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 22:08:11,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=3624, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:08:11,699 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:10:26,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:10:26,196 INFO L93 Difference]: Finished difference Result 1454 states and 5033 transitions. [2022-03-15 22:10:26,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2022-03-15 22:10:26,204 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:26,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:10:26,211 INFO L225 Difference]: With dead ends: 1454 [2022-03-15 22:10:26,211 INFO L226 Difference]: Without dead ends: 1427 [2022-03-15 22:10:26,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18011 ImplicationChecksByTransitivity, 138.2s TimeCoverageRelationStatistics Valid=7707, Invalid=43143, Unknown=0, NotChecked=0, Total=50850 [2022-03-15 22:10:26,214 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 871 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 3241 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 3241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:10:26,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [871 Valid, 0 Invalid, 3453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 3241 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-03-15 22:10:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2022-03-15 22:10:26,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 814. [2022-03-15 22:10:26,235 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:26,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 3168 transitions. [2022-03-15 22:10:26,238 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 3168 transitions. Word has length 17 [2022-03-15 22:10:26,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:10:26,239 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 3168 transitions. [2022-03-15 22:10:26,239 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:26,239 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 3168 transitions. [2022-03-15 22:10:26,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:10:26,241 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:10:26,241 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:10:26,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-03-15 22:10:26,455 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:26,455 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:26,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:10:26,456 INFO L85 PathProgramCache]: Analyzing trace with hash -633677775, now seen corresponding path program 9 times [2022-03-15 22:10:26,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:10:26,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915842534] [2022-03-15 22:10:26,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:10:26,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:10:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:10:26,514 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:26,514 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:10:26,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915842534] [2022-03-15 22:10:26,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915842534] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:10:26,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201655472] [2022-03-15 22:10:26,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:10:26,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:10:26,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:10:26,515 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:26,525 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:26,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:10:26,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:10:26,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:10:26,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:10:26,644 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:26,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:10:26,683 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:26,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201655472] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:10:26,683 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:10:26,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-03-15 22:10:26,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [253600217] [2022-03-15 22:10:26,683 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:10:26,687 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:10:26,694 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:10:26,694 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:10:27,444 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [23103#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 23095#(or (<= N k) (< i N)), 23096#(or (<= N (+ k 1)) (< i N)), 23099#(or (<= N i) (< (+ i 1) N) (<= N k)), 23100#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 23101#(or (<= N (+ i 1)) (< (+ 2 i) N)), 23093#(< i N), 23098#(or (<= N i) (< (+ i 1) N) (<= (+ N 1) k)), 23097#(or (<= N i) (< (+ i 1) N)), 23102#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N 1) k)), 23094#(or (<= (+ N 1) k) (< i N)), 23104#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N))] [2022-03-15 22:10:27,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:10:27,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:10:27,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:10:27,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:10:27,445 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:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:10:28,257 INFO L93 Difference]: Finished difference Result 1409 states and 5086 transitions. [2022-03-15 22:10:28,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:10:28,258 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:28,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:10:28,263 INFO L225 Difference]: With dead ends: 1409 [2022-03-15 22:10:28,264 INFO L226 Difference]: Without dead ends: 1345 [2022-03-15 22:10:28,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1114, Invalid=3442, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 22:10:28,265 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:10:28,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:10:28,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2022-03-15 22:10:28,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 740. [2022-03-15 22:10:28,285 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:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 2838 transitions. [2022-03-15 22:10:28,288 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 2838 transitions. Word has length 17 [2022-03-15 22:10:28,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:10:28,288 INFO L470 AbstractCegarLoop]: Abstraction has 740 states and 2838 transitions. [2022-03-15 22:10:28,288 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:28,288 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 2838 transitions. [2022-03-15 22:10:28,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:10:28,290 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:10:28,291 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:10:28,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-15 22:10:28,494 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:28,494 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:28,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:10:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash -789180409, now seen corresponding path program 7 times [2022-03-15 22:10:28,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:10:28,495 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262897827] [2022-03-15 22:10:28,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:10:28,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:10:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:10:29,272 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:29,272 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:10:29,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262897827] [2022-03-15 22:10:29,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262897827] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:10:29,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001000280] [2022-03-15 22:10:29,272 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:10:29,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:10:29,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:10:29,273 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:29,274 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:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:10:29,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 22:10:29,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:10:30,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:10:30,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:10:30,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:10:30,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:10:30,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:10:30,170 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:30,604 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:30,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:10:34,258 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 22:10:34,259 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:48,309 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:48,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001000280] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:48,309 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:48,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-03-15 22:14:48,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1728686136] [2022-03-15 22:14:48,309 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:48,310 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:48,318 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 219 transitions. [2022-03-15 22:14:48,318 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:32,067 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 48 new interpolants: [26200#(and (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (< j M) (= min1 min3) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (< i N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< j M) (= min1 min2) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N) (< i N))), 26233#(and (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (not (< j M)) (<= (+ min3 1) (select A j)) (<= (+ 2 i) N) (not (< (select A j) min2)) (= (select A j) min3) (= (select A j) min1)) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (not (< j M)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (not (< (select A j) min2)) (= (select A j) min1)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= min1 (select A (+ k 1))) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A (+ k 1))) (= (select A (+ k 1)) min2) (< (select A j) min2) (< (+ 2 k) N) (not (< j M)) (= min1 min2) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (= min1 (select A k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (not (< (select A j) min2)) (< (select A (+ k 1)) (select A k)) (= (select A j) min1)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (<= min1 (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (<= min1 (select A i)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (not (< j M)) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (not (< j M)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (not (< (select A j) min2)) (<= (select A k) (select A (+ k 1))) (= (select A j) min1)) (or (<= (+ (select A (+ k 1)) min1) (+ (select A i) (select A j))) (<= N (+ k 1)) (< (+ j 1) M) (= (select A j) (select A (+ k 1))) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) (select A j))) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (< (select A (+ k 1)) min3) (< (select A j) min2) (< (+ 2 k) N) (not (< j M)) (= min1 min2) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A (+ k 1))) (= (select A (+ k 1)) min2) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A (+ k 1)) min1) (+ (select A i) min2)) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A (+ k 1))) (= (select A j) (select A (+ k 1))) (< (+ 2 k) N) (not (< j M)) (<= (+ 2 i) N) (not (< (select A j) min2)) (<= (+ (select A (+ k 1)) 1) (select A j)) (= (select A j) min1)) (or (<= N (+ k 1)) (< (+ j 1) M) (= min2 (select A k)) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A k) 1) min2) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k)) (<= (+ min1 (select A k)) (+ (select A i) min2))) (or (<= N (+ k 1)) (< (+ j 1) M) (= (select A j) (select A k)) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k)) (<= (+ min1 (select A k)) (+ (select A i) (select A j)))) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (< (select A (+ k 1)) min3) (<= (+ min1 min3) (+ (select A i) (select A j))) (< (+ 2 k) N) (not (< j M)) (<= (+ min3 1) (select A j)) (<= (+ 2 i) N) (= (select A j) min3)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= min1 min3) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< (+ j 1) M) (= (select A (+ k 1)) min2) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A (+ k 1)) min1) (+ (select A i) min2)) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (< (+ j 1) M) (= min2 (select A k)) (< (select A j) min2) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A (+ k 1)) min3) (< (select A j) min2) (< (+ 2 k) N) (= min3 min2) (not (< j M)) (= min1 min2) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< (+ j 1) M) (= (select A j) (select A (+ k 1))) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (<= (+ 2 i) N) (not (< (select A j) min2)) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) (select A j)) (= (select A j) min1)) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (not (< j M)) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (not (< (select A j) min2)) (= (select A j) min1)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= min1 (select A i)) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1)))) (or (<= N (+ k 1)) (< (+ j 1) M) (< (select A j) min2) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (= min1 min2) (= min1 (select A k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (<= (+ (select A (+ k 1)) min1) (+ (select A i) (select A j))) (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A (+ k 1))) (= (select A j) (select A (+ k 1))) (< (+ 2 k) N) (not (< j M)) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) (select A j))) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A (+ k 1))) (< (select A j) min2) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (not (< j M)) (= min1 min2) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (select A j) min2) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (not (< j M)) (= min1 min2) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (<= min1 (select A i)) (< (select A (+ k 1)) min3) (= (select A i) min3) (< (+ 2 k) N) (not (< j M)) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< (+ j 1) M) (= (select A (+ k 1)) min2) (< (select A j) min2) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (= min1 min2) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A (+ k 1)) min3) (<= (+ min1 min3) (+ (select A i) min2)) (< (+ 2 k) N) (= min3 min2) (not (< j M)) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= min1 (select A i)) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (= (select A i) (select A k)) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (< (+ j 1) M) (= (select A j) (select A k)) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (<= (+ 2 i) N) (not (< (select A j) min2)) (< (select A (+ k 1)) (select A k)) (= (select A j) min1))), 26216#(and (or (< (+ 2 i) k) (< j M) (<= (+ (select A (+ (- 1) k)) 1) 0) (= min1 min3)) (or (< j M) (<= (+ 2 i) k)) (or (< (+ 2 i) k) (< j M) (= i min2) (<= (+ (select A i) 1) i)) (or (< (+ 2 i) k) (< j M) (<= 0 (select A (+ (- 1) k))) (= (select A (+ (- 1) k)) min3)) (or (< (+ 2 i) k) (< j M) (<= i (select A i)) (= (select A i) min2)) (or (< (+ 2 i) k) (= min1 0) (< j M)) (or (< (+ 2 i) k) (< j M) (= i min1))), 26192#(and (or (<= min2 min3) (< k N) (<= (+ i 1) N) (= min1 min3)) (or (<= (+ min3 1) min2) (= min1 min2) (< k N) (<= (+ i 1) N))), 26219#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ min3 1) (select A j)) (<= (+ 2 i) N) (not (< (select A j) min2)) (= (select A j) min3) (= (select A j) min1)) (or (<= (+ min3 1) min2) (< (+ j 1) M) (<= (+ min1 min3) (+ (select A i) min2)) (= min3 min2) (not (< j M)) (<= (+ 2 i) N)) (or (< (+ j 1) M) (<= (+ min1 min3) (+ (select A i) (select A j))) (not (< j M)) (<= (+ min3 1) (select A j)) (<= (+ 2 i) N) (= (select A j) min3)) (or (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A j) min2) (= min3 min2) (not (< j M)) (= min1 min2) (<= (+ 2 i) N)) (or (< (+ j 1) M) (not (< j M)) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (<= min1 (select A i)) (= (select A i) min3) (not (< j M)) (<= (+ 2 i) N)) (or (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (< (+ j 1) M) (= (select A i) min3) (<= min1 min3) (not (< j M)) (<= (+ 2 i) N))), 26210#(and (or (<= (+ min3 1) min2) (< (+ 2 i) N) (= min3 min2) (< k N) (<= (+ min1 1) (select A i))) (or (<= (+ min3 1) min2) (< (+ 2 i) N) (= min3 min2) (< k N) (<= (+ min1 min3) (+ min2 (select A (+ (- 1) N))))) (or (= min1 0) (< (+ 2 i) N) (= min1 min2) (< k N) (<= (+ (select A (+ (- 1) N)) 1) min1)) (or (< (+ 2 i) N) (= min1 min2) (< k N) (<= (+ (select A (+ (- 1) N)) 1) min1) (= min1 min3) (<= (select A i) (select A (+ (- 1) N)))) (or (= min1 0) (<= (+ min1 1) min3) (< (+ 2 i) N) (< k N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (not (= min1 0)) (< (+ 2 i) N) (= (select A i) min3) (< k N) (<= 0 (select A i))) (or (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (<= (+ min1 1) min3) (< (+ 2 i) N) (= (select A i) min3) (< k N)) (or (< k N) (<= (+ 2 i) N)) (or (<= 0 (select A (+ (- 1) N))) (<= (+ min1 1) min3) (< (+ 2 i) N) (<= (+ (select A i) 1) 0) (< k N) (= min3 (select A (+ (- 1) N)))) (or (= min1 0) (< (+ 2 i) N) (= min1 min2) (< k N) (= min3 (select A (+ (- 1) N)))) (or (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ 2 i) N) (<= (+ (select A i) 1) 0) (= min1 min2) (< k N) (= min1 min3)) (or (not (= min1 0)) (< (+ 2 i) N) (< k N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N))) (<= 0 (select A i))) (or (<= (+ min3 1) min2) (< (+ 2 i) N) (= min3 min2) (= min1 min2) (< k N)) (or (not (= min1 0)) (<= (+ min1 1) min3) (< (+ 2 i) N) (<= (+ (select A i) 1) 0) (< k N) (= min1 min3) (= min3 (select A (+ (- 1) N)))) (or (<= 0 (select A (+ (- 1) N))) (< (+ 2 i) N) (= min1 min2) (< k N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ 2 i) N) (= min1 min2) (< k N))), 26193#(and (or (not (< k N)) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N) (< i N)) (or (not (< k N)) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (< i N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (= min1 min2) (< (+ k 1) N) (< i N)) (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (= min1 min3) (< (+ k 1) N) (< i N))), 26197#(and (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (< j M) (= min1 min3) (< (+ k 1) N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< j M) (= min1 min2) (< (+ k 1) N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N))), 26215#(and (or (= 0 (+ (* (- 1) min1) i)) (< j M) (< (+ 3 i) N)) (or (< j M) (<= (+ (select A (+ (- 1) N)) 1) (select A (+ (- 2) N))) (<= i (select A i)) (< (+ 3 i) N) (= (select A i) min2)) (or (< j M) (<= (+ (select A (+ (- 1) N)) 1) (select A (+ (- 2) N))) (< (+ 3 i) N) (= (select A (+ (- 2) N)) min3) (<= i (select A (+ (- 2) N)))) (or (<= 0 (select A (+ (- 1) N))) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< j M) (< (+ 3 i) N) (= (select A i) min2)) (or (< j M) (<= i (select A i)) (< (+ 3 i) N) (<= (+ (select A (+ (- 1) N)) 1) min1) (= (select A i) min2)) (or (<= 0 (select A (+ (- 1) N))) (< j M) (< (+ 3 i) N) (= (select A (+ (- 2) N)) min3) (= min3 (select A (+ (- 1) N)))) (or (= min1 0) (< j M) (< (+ 3 i) N) (= min3 (select A (+ (- 1) N)))) (or (<= 0 (select A (+ (- 1) N))) (<= (+ (select A (+ (- 2) N)) 1) 0) (< j M) (< (+ 3 i) N) (= min3 (select A (+ (- 1) N)))) (or (= min1 0) (< j M) (< (+ 3 i) N) (<= (+ (select A (+ (- 1) N)) 1) min1)) (or (<= (+ 3 i) N) (< j M)) (or (= min1 0) (< j M) (<= (+ (select A (+ (- 1) N)) 1) (select A (+ (- 2) N))) (< (+ 3 i) N)) (or (< j M) (= i min2) (< (+ 3 i) N) (<= (+ (select A i) 1) i)) (or (<= (+ (select A (+ (- 2) N)) 1) 0) (< j M) (< (+ 3 i) N) (<= (+ (select A (+ (- 1) N)) 1) min1) (= min1 min3)) (or (< j M) (<= (select A (+ (- 2) N)) (select A (+ (- 1) N))) (< (+ 3 i) N) (= min1 min3) (= min3 (select A (+ (- 1) N)))) (or (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (<= (+ (select A (+ (- 2) N)) 1) 0) (< j M) (< (+ 3 i) N) (= min1 min3) (= (select A i) min2)) (or (< j M) (= i min2) (< (+ 3 i) N) (= (select A i) min2))), 26228#(and (or (<= N (+ k 1)) (< (+ j 1) M) (< (select A j) min2) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (not (< j M)) (<= (select A k) (select A (+ k 1))) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (not (< j M)) (not (< (select A j) min2)) (< i N) (<= (+ (select A (+ k 1)) 1) (select A j)) (= (select A j) min1)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (select A j) min2) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k)) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A (+ k 1))) (< (select A j) min2) (< (+ 2 k) N) (not (< j M)) (= min1 min2) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (not (< j M)) (<= (+ min3 1) (select A j)) (not (< (select A j) min2)) (< i N) (= (select A j) min1)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (= min1 (select A k)) (not (< (select A j) min2)) (< (select A (+ k 1)) (select A k)) (< i N) (<= (select A j) (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (+ j 1) M) (< (select A (+ k 1)) min3) (< (select A j) min2) (< (+ 2 k) N) (not (< j M)) (= min1 min3) (< i N)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= (select A j) (select A (+ k 1))) (not (< j M)) (not (< (select A j) min2)) (<= (select A k) (select A (+ k 1))) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= (select A j) (select A (+ k 1))) (not (< j M)) (not (< (select A j) min2)) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A (+ k 1)) min3) (< (select A j) min2) (< (+ 2 k) N) (not (< j M)) (= min1 min2) (< i N)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (not (< (select A j) min2)) (<= (select A k) (select A (+ k 1))) (< i N) (<= (+ (select A (+ k 1)) 1) (select A j)) (= (select A j) min1)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (not (< (select A j) min2)) (< (select A (+ k 1)) (select A k)) (< i N) (= (select A j) min1)) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (not (< j M)) (= min1 min3) (not (< (select A j) min2)) (< i N) (<= (select A j) min3)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (select A j) min2) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (not (< j M)) (= min1 (select A k)) (< (select A (+ k 1)) (select A k)) (< i N)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (select A j) min2) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A (+ k 1))) (< (select A j) min2) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (not (< j M)) (< i N))), 26201#(and (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min3)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (select A k) (select A (+ k 1))))), 26220#(and (or (<= (+ 3 i) N) (< (+ j 1) M) (<= min1 (select A i)) (= (select A i) min3) (<= (+ (select A (+ i 1)) 1) (select A i)) (<= M j)) (or (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (not (< (select A j) min2)) (= (select A j) min1)) (or (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (<= (+ min1 1) min3) (< (+ 2 i) N) (= (select A i) min3) (not (< j M))) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ min1 min3) (+ (select A j) (select A (+ i 1)))) (<= (+ min3 1) (select A j)) (= (select A j) min3) (<= M j)) (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (= min3 (select A (+ i 1))) (not (< j M)) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (= min1 0) (< (+ j 1) M) (< (+ 2 i) N) (< (select A j) min2) (not (< j M)) (= min1 min2) (<= (+ (select A (+ (- 1) N)) 1) min1)) (or (= min1 0) (< (+ j 1) M) (<= (+ min1 1) min3) (< (+ 2 i) N) (not (< j M)) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (< (+ 2 i) N) (< (select A j) min2) (not (< j M)) (= min1 min2)) (or (<= (+ min3 1) min2) (< (+ j 1) M) (< (+ 2 i) N) (= min3 min2) (not (< j M)) (<= (+ min1 1) (select A i))) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ min3 1) (select A j)) (<= min2 (select A j)) (= (select A j) min3) (= (select A j) min1) (<= M j)) (or (<= (+ 3 i) N) (< (+ j 1) M) (= min3 (select A (+ i 1))) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (not (< j M))) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A (+ i 1)) 1) min1) (not (< j M)) (< (select A i) min1) (= min1 min3) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (<= (+ min3 1) (select A j)) (= (select A j) min3) (<= (+ min1 1) (select A i))) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A (+ i 1)) 1) min1) (< (select A j) min2) (not (< j M)) (= min1 min2) (< (select A i) min1) (= min1 min3)) (or (= min1 0) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (<= (+ (select A (+ (- 1) N)) 1) min1) (not (< (select A j) min2)) (= (select A j) min1)) (or (<= (+ 3 i) N) (<= (+ min3 1) min2) (< (+ j 1) M) (= min3 min2) (<= (+ min1 min3) (+ min2 (select A (+ i 1)))) (<= M j)) (or (<= (+ 3 i) N) (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A j) min2) (= min3 min2) (= min1 min2) (<= M j)) (or (<= (+ 3 i) N) (< (+ j 1) M) (= min3 (select A (+ i 1))) (<= min1 min3) (not (< j M)) (< (select A i) min1))), 26231#(and (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min2) (< (select A i) min1) (= min1 min3)) (or (<= N (+ k 1)) (= min1 0) (< (select A (+ k 1)) min3) (<= (+ min1 1) min3) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (<= N (+ k 1)) (= min1 0) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A (+ (- 1) N)) 1) min1)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (= min1 min2)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< j M) (= (select A (+ k 1)) min2) (< (+ 2 k) N) (< (select A i) min1) (<= (+ (select A (+ k 1)) min1) (+ min2 (select A (+ i 1)))) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= min1 (select A i)) (< (select A (+ k 1)) min3) (= min3 (select A (+ i 1))) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 2 k) N)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (< j M) (<= min1 min3) (< (+ 2 k) N) (< (select A i) min1)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= min1 (select A i)) (= min2 (select A k)) (< j M) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (= min1 min2)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (select A (+ k 1)) min3) (= min3 (select A (+ i 1))) (< j M) (< (+ 2 k) N) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (= min1 (select A k)) (< (select A i) min1) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< j M) (<= (select A i) min3) (not (< (select A i) min1)) (< (+ 2 k) N) (<= (+ (select A (+ i 1)) 1) (select A i))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= min1 (select A i)) (< j M) (= (select A (+ k 1)) min2) (< (+ 2 k) N) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (= min1 min2) (<= (select A k) (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (<= (+ min1 1) min3) (< (+ 2 i) N) (< j M) (= (select A i) min3) (< (+ 2 k) N))), 26224#(and (or (not (< k N)) (< (+ j 1) M) (< (select A j) min2) (not (< (select A k) min3)) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N)) (or (not (< k N)) (< (+ j 1) M) (not (< (select A k) min3)) (not (< j M)) (= min1 (select A k)) (< (+ k 1) N) (not (< (select A j) min2)) (<= (select A j) (select A k))) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (not (< j M)) (<= (+ min3 1) (select A j)) (< (+ k 1) N) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min3) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (not (< j M)) (= min1 min3) (< (+ k 1) N) (not (< (select A j) min2)) (<= (select A j) min3)) (or (not (< k N)) (< (+ j 1) M) (< (select A j) min2) (not (< (select A k) min3)) (<= min2 (select A k)) (not (< j M)) (= min1 (select A k)) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (< (+ k 1) N)) (or (not (< k N)) (< (+ j 1) M) (not (< (select A k) min3)) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (< (+ k 1) N) (not (< (select A j) min2)) (= (select A j) min1))), 26217#(and (or (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2)) (or (<= min2 min3) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min3)) (or (< (+ j 1) M) (not (< j M)) (<= (+ min3 1) (select A j)) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (not (< j M)) (= min1 min3) (not (< (select A j) min2)) (<= (select A j) min3))), 26229#(and (or (< (+ j 1) M) (= (select A i) min3) (<= min1 min3) (not (< j M)) (< k N) (<= (+ 2 i) N)) (or (<= (+ min3 1) min2) (< (+ j 1) M) (<= (+ min1 min3) (+ (select A i) min2)) (= min3 min2) (not (< j M)) (< k N) (<= (+ 2 i) N)) (or (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A j) min2) (= min3 min2) (not (< j M)) (= min1 min2) (< k N) (<= (+ 2 i) N)) (or (< (+ j 1) M) (not (< j M)) (<= (+ min3 1) (select A j)) (< k N) (<= (+ 2 i) N) (not (< (select A j) min2)) (= (select A j) min3) (= (select A j) min1)) (or (< (+ j 1) M) (<= min1 (select A i)) (= (select A i) min3) (not (< j M)) (< k N) (<= (+ 2 i) N)) (or (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (< k N) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (< (+ j 1) M) (not (< j M)) (< k N) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (<= (+ min1 min3) (+ (select A i) (select A j))) (not (< j M)) (<= (+ min3 1) (select A j)) (< k N) (<= (+ 2 i) N) (= (select A j) min3))), 26232#(and (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (<= min1 (select A k))) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< (+ j 1) M) (<= (+ min1 min3) (+ (select A i) min2)) (= min3 min2) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ j 1) M) (not (< (select A k) min3)) (not (< j M)) (= min1 (select A k)) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (<= (+ min1 min3) (+ (select A i) (select A j))) (not (< j M)) (<= (+ min3 1) (select A j)) (< (+ k 1) N) (<= (+ 2 i) N) (= (select A j) min3)) (or (not (< k N)) (< (+ j 1) M) (= min2 (select A k)) (< (select A j) min2) (not (< (select A k) min3)) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ j 1) M) (= (select A j) (select A k)) (not (< (select A k) min3)) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (< (+ k 1) N) (<= (+ 2 i) N) (not (< (select A j) min2)) (= (select A j) min1)) (or (not (< k N)) (< (+ j 1) M) (= (select A j) (select A k)) (not (< (select A k) min3)) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 (select A k)) (+ (select A i) (select A j)))) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (not (< j M)) (<= (+ min3 1) (select A j)) (< (+ k 1) N) (<= (+ 2 i) N) (not (< (select A j) min2)) (= (select A j) min3) (= (select A j) min1)) (or (not (< k N)) (< (+ j 1) M) (< (select A j) min2) (not (< (select A k) min3)) (not (< j M)) (= min1 min2) (= min1 (select A k)) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (<= min1 (select A i)) (= (select A i) min3) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (= min1 min3) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ j 1) M) (<= min1 min3) (not (< j M)) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ j 1) M) (<= min1 (select A i)) (not (< (select A k) min3)) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (not (< j M)) (= min1 min3) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (not (< (select A j) min2)) (= (select A j) min1)) (or (not (< k N)) (< (+ j 1) M) (= min2 (select A k)) (not (< (select A k) min3)) (not (< j M)) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 (select A k)) (+ (select A i) min2))) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A j) min2) (= min3 min2) (not (< j M)) (= min1 min2) (< (+ k 1) N) (<= (+ 2 i) N))), 26206#(and (or (< j M) (= (select A i) min3) (<= min1 min3) (< k N) (<= (+ 2 i) N)) (or (<= (+ min3 1) min2) (< j M) (= min3 min2) (= min1 min2) (< k N) (<= (+ 2 i) N)) (or (< j M) (= min1 min2) (< k N) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= (+ min3 1) min2) (< j M) (<= (+ min1 min3) (+ (select A i) min2)) (= min3 min2) (< k N) (<= (+ 2 i) N)) (or (<= min1 (select A i)) (< j M) (= (select A i) min3) (< k N) (<= (+ 2 i) N))), 26221#(and (or (< (+ j 1) M) (<= i (select A i)) (< (select A j) min2) (not (< j M)) (< (+ 3 i) N) (<= (+ (select A (+ (- 1) N)) 1) min1) (= (select A i) min2)) (or (<= (+ (select A (+ (- 2) N)) 1) 0) (< (+ j 1) M) (not (< j M)) (< (+ 3 i) N) (<= (+ (select A (+ (- 1) N)) 1) min1) (= min1 min3)) (or (<= 0 (select A (+ (- 1) N))) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (< (+ 3 i) N) (= (select A i) min2)) (or (= min1 0) (< (+ j 1) M) (not (< j M)) (< (+ 3 i) N) (= min3 (select A (+ (- 1) N)))) (or (<= 0 (select A (+ (- 1) N))) (<= (+ (select A (+ (- 2) N)) 1) 0) (< (+ j 1) M) (not (< j M)) (< (+ 3 i) N) (= min3 (select A (+ (- 1) N)))) (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< j M))) (or (< (+ j 1) M) (<= (select A (+ (- 2) N)) (select A (+ (- 1) N))) (not (< j M)) (< (+ 3 i) N) (= min1 min3) (= min3 (select A (+ (- 1) N)))) (or (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (<= (+ (select A (+ (- 2) N)) 1) 0) (< (+ j 1) M) (not (< j M)) (< (+ 3 i) N) (= (select A i) (select A j)) (= min1 min3) (not (< (select A j) min2))) (or (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (<= (+ (select A (+ (- 2) N)) 1) 0) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (< (+ 3 i) N) (= min1 min3) (= (select A i) min2)) (or (= min1 0) (< (+ j 1) M) (not (< j M)) (< (+ 3 i) N) (<= (+ (select A (+ (- 1) N)) 1) min1)) (or (< (+ j 1) M) (= 0 (+ (* (- 1) min1) i)) (not (< j M)) (< (+ 3 i) N)) (or (< (+ j 1) M) (= (select A j) i) (not (< j M)) (< (+ 3 i) N) (not (< (select A j) min2)) (<= (+ (select A i) 1) i)) (or (< (+ j 1) M) (<= (+ (select A (+ (- 1) N)) 1) (select A (+ (- 2) N))) (<= i (select A i)) (not (< j M)) (< (+ 3 i) N) (= (select A i) (select A j)) (not (< (select A j) min2))) (or (< (+ j 1) M) (= (select A j) i) (not (< j M)) (< (+ 3 i) N) (= (select A i) (select A j)) (not (< (select A j) min2))) (or (< (+ j 1) M) (<= (+ (select A (+ (- 1) N)) 1) (select A (+ (- 2) N))) (<= i (select A i)) (< (select A j) min2) (not (< j M)) (< (+ 3 i) N) (= (select A i) min2)) (or (<= 0 (select A (+ (- 1) N))) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (not (< j M)) (< (+ 3 i) N) (= (select A i) (select A j)) (not (< (select A j) min2))) (or (< (+ j 1) M) (<= (+ (select A (+ (- 1) N)) 1) (select A (+ (- 2) N))) (not (< j M)) (< (+ 3 i) N) (= (select A (+ (- 2) N)) min3) (<= i (select A (+ (- 2) N)))) (or (< (+ j 1) M) (= i min2) (< (select A j) min2) (not (< j M)) (< (+ 3 i) N) (= (select A i) min2)) (or (<= 0 (select A (+ (- 1) N))) (< (+ j 1) M) (not (< j M)) (< (+ 3 i) N) (= (select A (+ (- 2) N)) min3) (= min3 (select A (+ (- 1) N)))) (or (< (+ j 1) M) (<= i (select A i)) (not (< j M)) (< (+ 3 i) N) (= (select A i) (select A j)) (<= (+ (select A (+ (- 1) N)) 1) min1) (not (< (select A j) min2))) (or (= min1 0) (< (+ j 1) M) (<= (+ (select A (+ (- 1) N)) 1) (select A (+ (- 2) N))) (not (< j M)) (< (+ 3 i) N)) (or (< (+ j 1) M) (= i min2) (< (select A j) min2) (not (< j M)) (< (+ 3 i) N) (<= (+ (select A i) 1) i))), 26218#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ min3 1) (select A j)) (not (< (select A j) min2)) (< i N) (= (select A j) min1)) (or (< (+ j 1) M) (not (< j M)) (= min1 min3) (not (< (select A j) min2)) (< i N) (<= (select A j) min3)) (or (<= min2 min3) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min3) (< i N)) (or (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (< i N))), 26189#(and (or (<= (+ min3 1) min2) (= min1 min2) (< k N)) (or (<= min2 min3) (< k N) (= min1 min3))), 26234#(and (or (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (not (< (select A k) min3)) (not (< j M)) (= min1 (select A k)) (<= (+ (select A (+ (- 1) N)) 1) min1) (< (+ k 1) N) (not (< (select A j) min2)) (= (select A j) min1)) (or (<= (+ min1 (select A k)) (+ (select A j) (select A (+ (- 1) N)))) (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (= (select A j) (select A k)) (not (< (select A k) min3)) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (<= (+ min3 1) (select A j)) (< (+ k 1) N) (= (select A j) min3) (<= (+ min1 1) (select A i))) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (not (= min1 0)) (<= (+ min1 1) min3) (< (+ 2 i) N) (<= (+ (select A i) 1) 0) (not (< j M)) (= min1 min3) (< (+ k 1) N) (= min3 (select A (+ (- 1) N)))) (or (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (= (select A j) (select A k)) (not (< (select A k) min3)) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (< (+ k 1) N) (<= (+ min1 1) (select A i))) (or (< (select A k) min3) (not (< k N)) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (< (+ 2 i) N) (<= (+ (select A i) 1) 0) (< (select A j) min2) (not (< j M)) (= min1 min2) (= min1 min3) (< (+ k 1) N)) (or (not (< k N)) (= min1 0) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (<= (+ (select A (+ (- 1) N)) 1) min1) (< (+ k 1) N) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< (+ j 1) M) (< (+ 2 i) N) (< (select A j) min2) (= min3 min2) (not (< j M)) (= min1 min2) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (= min1 0) (< (+ j 1) M) (<= (+ min1 1) min3) (< (+ 2 i) N) (not (< j M)) (< (+ k 1) N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (not (< k N)) (= min1 0) (< (+ j 1) M) (< (+ 2 i) N) (< (select A j) min2) (not (< j M)) (= min1 min2) (<= (+ (select A (+ (- 1) N)) 1) min1) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (not (= min1 0)) (< (+ 2 i) N) (= (select A i) min3) (not (< j M)) (< (+ k 1) N) (<= 0 (select A i))) (or (< (select A k) min3) (not (< k N)) (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (<= (+ min1 1) min3) (< (+ 2 i) N) (= (select A i) min3) (not (< j M)) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (not (= min1 0)) (< (+ 2 i) N) (not (< j M)) (< (+ k 1) N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N))) (<= 0 (select A i))) (or (not (< k N)) (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (< (+ k 1) N) (not (< (select A j) min2)) (= (select A j) min1)) (or (not (< k N)) (< (+ j 1) M) (= min2 (select A k)) (< (+ 2 i) N) (not (< (select A k) min3)) (not (< j M)) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ min1 1) (select A i))) (or (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (< (select A j) min2) (not (< (select A k) min3)) (not (< j M)) (= min1 min2) (= min1 (select A k)) (<= (+ (select A (+ (- 1) N)) 1) min1) (< (+ k 1) N)) (or (not (< k N)) (< (+ j 1) M) (= min2 (select A k)) (< (+ 2 i) N) (not (< (select A k) min3)) (not (< j M)) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ min1 (select A k)) (+ min2 (select A (+ (- 1) N))))) (or (< (select A k) min3) (not (< k N)) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (< (+ 2 i) N) (<= (+ (select A i) 1) 0) (not (< j M)) (= min1 min3) (< (+ k 1) N) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (< (select A j) min2) (not (< j M)) (= min1 min2) (<= (+ (select A (+ (- 1) N)) 1) min1) (= min1 min3) (< (+ k 1) N) (<= (select A i) (select A (+ (- 1) N)))) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (<= (+ (select A (+ (- 1) N)) 1) min1) (= min1 min3) (< (+ k 1) N) (not (< (select A j) min2)) (<= (select A i) (select A (+ (- 1) N))) (= (select A j) min1)) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (<= (+ min3 1) (select A j)) (< (+ k 1) N) (not (< (select A j) min2)) (= (select A j) min3) (= (select A j) min1)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< (+ j 1) M) (< (+ 2 i) N) (= min3 min2) (not (< j M)) (< (+ k 1) N) (<= (+ min1 1) (select A i))) (or (not (< k N)) (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (< (+ 2 i) N) (< (select A j) min2) (not (< j M)) (= min1 min2) (< (+ k 1) N)) (or (not (< k N)) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (< (+ 2 i) N) (not (< (select A k) min3)) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ min1 1) (select A k)))), 26195#(and (or (<= min2 min3) (< j M) (= min1 min3)) (or (<= (+ min3 1) min2) (< j M) (= min1 min2))), 26209#(and (or (<= N (+ k 1)) (< j M) (<= min1 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= N (+ k 1)) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min2) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (= min1 min2) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< j M) (<= min1 min3) (< (+ 2 k) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< j M) (= (select A (+ k 1)) min2) (<= min3 (select A k)) (< (+ 2 k) N) (<= (+ (select A (+ k 1)) min1) (+ (select A i) min2)) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (= min2 (select A k)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k)) (<= (+ min1 (select A k)) (+ (select A i) min2))) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (= min1 min2) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1)))) (or (<= N (+ k 1)) (< j M) (= (select A (+ k 1)) min2) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (= min1 (select A k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (<= min1 (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min1 (select A i)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (= (select A (+ k 1)) min2) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (<= min1 (select A i)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min1 (select A i)) (< (select A (+ k 1)) min3) (< j M) (= (select A i) min3) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= min1 (select A i)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (= min2 (select A k)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< j M) (<= (+ min1 min3) (+ (select A i) min2)) (< (+ 2 k) N) (= min3 min2) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (= (select A (+ k 1)) min2) (< (+ 2 k) N) (<= (+ (select A (+ k 1)) min1) (+ (select A i) min2)) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min3 min2) (= min1 min2) (<= (+ 2 i) N))), 26225#(and (or (<= N (+ k 1)) (< (+ j 1) M) (< (select A j) min2) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (not (< j M)) (<= (+ min3 1) (select A j)) (not (< (select A j) min2)) (= (select A j) min1)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (select A j) min2) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (select A j) min2) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (not (< j M)) (= min1 (select A k)) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (not (< j M)) (not (< (select A j) min2)) (<= (+ (select A (+ k 1)) 1) (select A j)) (= (select A j) min1)) (or (<= N (+ k 1)) (< (+ j 1) M) (< (select A j) min2) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (not (< j M)) (<= (select A k) (select A (+ k 1)))) (or (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (not (< (select A j) min2)) (< (select A (+ k 1)) (select A k)) (= (select A j) min1)) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A (+ k 1))) (< (select A j) min2) (< (+ 2 k) N) (not (< j M)) (= min1 min2) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A (+ k 1))) (< (select A j) min2) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (not (< j M))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (+ j 1) M) (< (select A (+ k 1)) min3) (< (select A j) min2) (< (+ 2 k) N) (not (< j M)) (= min1 min3)) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= (select A j) (select A (+ k 1))) (not (< j M)) (not (< (select A j) min2))) (or (< (select A k) min3) (<= N (+ k 1)) (< (+ j 1) M) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (not (< j M)) (= min1 min3) (not (< (select A j) min2)) (<= (select A j) min3)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A (+ k 1)) min3) (< (select A j) min2) (< (+ 2 k) N) (not (< j M)) (= min1 min2)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (not (< (select A j) min2)) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) (select A j)) (= (select A j) min1)) (or (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= (select A j) (select A (+ k 1))) (not (< j M)) (not (< (select A j) min2)) (<= (select A k) (select A (+ k 1)))) (or (<= N (+ k 1)) (< (+ j 1) M) (<= min3 (select A k)) (< (+ 2 k) N) (not (< j M)) (= min1 (select A k)) (not (< (select A j) min2)) (< (select A (+ k 1)) (select A k)) (<= (select A j) (select A k)))), 26214#(and (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< (+ 2 i) N) (< j M) (= min3 min2) (= min1 min2) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (not (= min1 0)) (< (+ 2 i) N) (< j M) (= (select A i) min3) (< (+ k 1) N) (<= 0 (select A i))) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< (+ 2 i) N) (< j M) (= min3 min2) (< (+ k 1) N) (<= (+ min1 1) (select A i))) (or (< (select A k) min3) (not (< k N)) (not (= min1 0)) (< (+ 2 i) N) (< j M) (< (+ k 1) N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N))) (<= 0 (select A i))) (or (not (< k N)) (= min2 (select A k)) (< (+ 2 i) N) (< j M) (not (< (select A k) min3)) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ min1 (select A k)) (+ min2 (select A (+ (- 1) N))))) (or (not (< k N)) (= min2 (select A k)) (< (+ 2 i) N) (< j M) (not (< (select A k) min3)) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ min1 1) (select A i))) (or (< (select A k) min3) (not (< k N)) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) 0) (= min1 min2) (= min1 min3) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (= min1 0) (<= (+ min1 1) min3) (< (+ 2 i) N) (< j M) (< (+ k 1) N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (< (select A k) min3) (not (< k N)) (< (+ 2 i) N) (< j M) (= min1 min2) (<= (+ (select A (+ (- 1) N)) 1) min1) (= min1 min3) (< (+ k 1) N) (<= (select A i) (select A (+ (- 1) N)))) (or (not (< k N)) (= min1 0) (< (+ 2 i) N) (< j M) (= min1 min2) (<= (+ (select A (+ (- 1) N)) 1) min1) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 i) N) (< j M) (not (< (select A k) min3)) (= min1 min2) (= min1 (select A k)) (<= (+ (select A (+ (- 1) N)) 1) min1) (< (+ k 1) N)) (or (not (< k N)) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ 2 i) N) (< j M) (not (< (select A k) min3)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ min1 1) (select A k))) (or (not (< k N)) (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ 2 i) N) (< j M) (= min1 min2) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (<= (+ min1 1) min3) (< (+ 2 i) N) (< j M) (= (select A i) min3) (< (+ k 1) N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (not (= min1 0)) (<= (+ min1 1) min3) (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) 0) (= min1 min3) (< (+ k 1) N) (= min3 (select A (+ (- 1) N))))), 26202#(and (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min3) (< i N)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (select A k) (select A (+ k 1))) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< j M) (< (+ 2 k) N) (= min1 min2) (< i N)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A (+ k 1)) (select A k)) (< i N)) (or (<= N (+ k 1)) (< j M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k)) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< i N))), 26212#(and (or (<= (+ min3 1) min2) (< (+ 2 i) N) (< j M) (= min3 min2) (<= (+ min1 1) (select A i))) (or (= min1 0) (< (+ 2 i) N) (< j M) (= min1 min2) (<= (+ (select A (+ (- 1) N)) 1) min1)) (or (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (not (= min1 0)) (< (+ 2 i) N) (< j M) (= (select A i) min3) (<= 0 (select A i))) (or (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) 0) (= min1 min2) (= min1 min3)) (or (< (+ 2 i) N) (< j M) (= min1 min2) (<= (+ (select A (+ (- 1) N)) 1) min1) (= min1 min3) (<= (select A i) (select A (+ (- 1) N)))) (or (< j M) (<= (+ 2 i) N)) (or (<= (+ min3 1) min2) (< (+ 2 i) N) (< j M) (= min3 min2) (<= (+ min1 min3) (+ min2 (select A (+ (- 1) N))))) (or (<= 0 (select A (+ (- 1) N))) (<= (+ min1 1) min3) (< (+ 2 i) N) (< j M) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (= min1 0) (<= (+ min1 1) min3) (< (+ 2 i) N) (< j M) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ 2 i) N) (< j M) (= min1 min2)) (or (not (= min1 0)) (<= (+ min1 1) min3) (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) 0) (= min1 min3) (= min3 (select A (+ (- 1) N)))) (or (<= (+ min3 1) min2) (< (+ 2 i) N) (< j M) (= min3 min2) (= min1 min2)) (or (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (<= (+ min1 1) min3) (< (+ 2 i) N) (< j M) (= (select A i) min3)) (or (< (+ 2 i) N) (< j M) (= min1 min2) (= min1 min3) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N))))), 26227#(and (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (not (< j M)) (<= (+ min3 1) (select A j)) (< (+ k 1) N) (not (< (select A j) min2)) (< i N) (= (select A j) min1)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< (+ j 1) M) (< (select A j) min2) (not (< (select A k) min3)) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< (+ j 1) M) (not (< (select A k) min3)) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (< (+ k 1) N) (not (< (select A j) min2)) (< i N) (= (select A j) min1)) (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min3) (< (+ k 1) N) (< i N)) (or (< (select A k) min3) (not (< k N)) (< (+ j 1) M) (not (< j M)) (= min1 min3) (< (+ k 1) N) (not (< (select A j) min2)) (< i N) (<= (select A j) min3)) (or (not (< k N)) (< (+ j 1) M) (not (< (select A k) min3)) (not (< j M)) (= min1 (select A k)) (< (+ k 1) N) (not (< (select A j) min2)) (< i N) (<= (select A j) (select A k))) (or (not (< k N)) (< (+ j 1) M) (< (select A j) min2) (not (< (select A k) min3)) (<= min2 (select A k)) (not (< j M)) (= min1 (select A k)) (< (+ k 1) N) (< i N))), 26236#(and (or (< (+ 2 i) k) (= min1 0) (< (+ j 1) M) (not (< j M))) (or (< (+ j 1) M) (<= (+ 2 i) k) (not (< j M))) (or (< (+ 2 i) k) (< (+ j 1) M) (<= i (select A i)) (< (select A j) min2) (not (< j M)) (= (select A i) min2)) (or (< (+ 2 i) k) (< (+ j 1) M) (= (select A j) i) (not (< j M)) (not (< (select A j) min2)) (<= (+ (select A i) 1) i)) (or (< (+ 2 i) k) (< (+ j 1) M) (<= i (select A i)) (not (< j M)) (= (select A i) (select A j)) (not (< (select A j) min2))) (or (< (+ 2 i) k) (< (+ j 1) M) (<= (+ (select A (+ (- 1) k)) 1) 0) (not (< j M)) (= min1 min3)) (or (< (+ 2 i) k) (< (+ j 1) M) (= i min2) (< (select A j) min2) (not (< j M)) (<= (+ (select A i) 1) i)) (or (< (+ 2 i) k) (< (+ j 1) M) (= i min1) (not (< j M))) (or (< (+ 2 i) k) (< (+ j 1) M) (not (< j M)) (<= 0 (select A (+ (- 1) k))) (= (select A (+ (- 1) k)) min3))), 26196#(and (or (<= (+ min3 1) min2) (< j M) (= min1 min2) (< k N)) (or (<= min2 min3) (< j M) (< k N) (= min1 min3))), 26191#(and (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min2)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min3)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (select A k) (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A (+ k 1)) 1) min2))), 26194#(and (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min2 min3) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min3) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min2) (< i N)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (<= (select A k) (select A (+ k 1))) (< i N)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A (+ k 1)) (select A k)) (< i N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A (+ k 1)) 1) min2) (< i N)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k)) (< i N))), 26208#(and (or (< (select A k) min3) (<= N (+ k 1)) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min2) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= min1 (select A i)) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1)))) (or (<= N (+ k 1)) (<= min1 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min1 (select A i)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (= (select A (+ k 1)) min2) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (= (select A (+ k 1)) min2) (<= min3 (select A k)) (< (+ 2 k) N) (<= (+ (select A (+ k 1)) min1) (+ (select A i) min2)) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (= (select A (+ k 1)) min2) (< (+ 2 k) N) (<= (+ (select A (+ k 1)) min1) (+ (select A i) min2)) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (<= (+ min1 min3) (+ (select A i) min2)) (< (+ 2 k) N) (= min3 min2) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (= min2 (select A k)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (= min2 (select A k)) (<= min3 (select A k)) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k)) (<= (+ min1 (select A k)) (+ (select A i) min2))) (or (<= N (+ k 1)) (<= min1 min3) (< (+ 2 k) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= min1 (select A i)) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min1 (select A i)) (< (select A (+ k 1)) min3) (= (select A i) min3) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (= min1 min2) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (<= (select A k) (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (= min1 min2) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (= min1 (select A k)) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (< (select A (+ k 1)) (select A k))) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ min3 1) min2) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min3 min2) (= min1 min2) (<= (+ 2 i) N)) (or (< (select A k) min3) (<= N (+ k 1)) (<= min3 (select A (+ k 1))) (= (select A (+ k 1)) min2) (< (+ 2 k) N) (= min1 min2) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (<= min1 (select A k)))), 26222#(and (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (= min1 min2) (< (select A i) min1) (= min1 min3)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= min1 (select A i)) (< (select A (+ k 1)) min3) (= min3 (select A (+ i 1))) (<= (select A i) (select A (+ i 1))) (< (+ 2 k) N)) (or (< (select A k) min3) (<= N (+ k 1)) (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (<= (+ min1 1) min3) (< (+ 2 i) N) (= (select A i) min3) (< (+ 2 k) N)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= (select A i) min3) (not (< (select A i) min1)) (< (+ 2 k) N) (<= (+ (select A (+ i 1)) 1) (select A i))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (select A (+ k 1)) min3) (= min3 (select A (+ i 1))) (< (+ 2 k) N) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (= min1 (select A k)) (< (select A i) min1) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (= (select A (+ k 1)) min2) (< (+ 2 k) N) (< (select A i) min1) (<= (+ (select A (+ k 1)) min1) (+ min2 (select A (+ i 1)))) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ 2 i) N) (< (+ 2 k) N) (= min1 min2)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= min1 (select A i)) (= min2 (select A k)) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= min1 (select A i)) (= (select A (+ k 1)) min2) (< (+ 2 k) N) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (<= min1 min3) (< (+ 2 k) N) (< (select A i) min1)) (or (<= N (+ k 1)) (= min1 0) (< (+ 2 i) N) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A (+ (- 1) N)) 1) min1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (= min1 0) (< (select A (+ k 1)) min3) (<= (+ min1 1) min3) (< (+ 2 i) N) (< (+ 2 k) N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (= min1 min2) (<= (select A k) (select A (+ k 1)))) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ (select A (+ i 1)) 1) min1) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (= min1 min2))), 26235#(and (or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= (+ 2 i) N) (<= M j)) (or (<= N (+ k 1)) (= min1 0) (< (+ j 1) M) (< (+ 2 i) N) (< (+ 2 k) N) (<= (+ (select A (+ (- 1) N)) 1) min1) (<= min2 (select A j)) (= (select A j) min1) (<= M j)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= min3 (select A (+ k 1))) (= (select A (+ k 1)) min2) (not (< (select A i) min1)) (< (+ 2 k) N) (<= (+ (select A (+ k 1)) 1) min2) (<= M j)) (or (<= N (+ k 1)) (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (< (+ 2 i) N) (< (+ 2 k) N) (<= min2 (select A j)) (= (select A j) min1) (<= M j)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (< (select A j) min2) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (= min1 (select A k)) (< (select A i) min1) (< (select A (+ k 1)) (select A k)) (<= M j)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= min1 (select A i)) (= (select A j) (select A k)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A j)) (< (select A (+ k 1)) (select A k)) (<= M j)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (= (select A (+ k 1)) min2) (< (+ 2 k) N) (< (select A i) min1) (<= (+ (select A (+ k 1)) min1) (+ min2 (select A (+ i 1)))) (<= (+ (select A (+ k 1)) 1) min2) (<= M j)) (or (<= N (+ k 1)) (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (< (+ 2 i) N) (< (select A j) min2) (< (+ 2 k) N) (= min1 min2) (<= M j)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= min1 (select A i)) (< (select A (+ k 1)) min3) (= min3 (select A (+ i 1))) (<= (select A i) (select A (+ i 1))) (< (+ 2 k) N) (<= M j)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A (+ i 1)) 1) min1) (<= min1 min3) (< (+ 2 k) N) (not (< j M)) (< (select A i) min1)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (<= (+ min3 1) (select A j)) (<= min2 (select A j)) (= (select A j) min3) (= (select A j) min1) (<= M j)) (or (<= N (+ k 1)) (= min1 0) (< (+ j 1) M) (< (select A (+ k 1)) min3) (<= (+ min1 1) min3) (< (+ 2 i) N) (< (+ 2 k) N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N))) (<= M j)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A (+ i 1)) 1) min1) (<= min3 (select A (+ k 1))) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A j)) (= (select A j) min1) (<= M j)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= (select A i) min3) (not (< (select A i) min1)) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A (+ i 1)) 1) (select A i))) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A (+ i 1)) 1) min1) (<= min3 (select A (+ k 1))) (< (select A j) min2) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (= min1 min2) (<= M j)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A (+ k 1)) min1) (+ (select A j) (select A (+ i 1)))) (= (select A j) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) (select A j)) (<= M j)) (or (< (select A k) min3) (<= N (+ k 1)) (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (<= (+ min1 1) min3) (< (+ 2 i) N) (= (select A i) min3) (< (+ 2 k) N) (<= M j)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A (+ i 1)) 1) min1) (< (select A j) min2) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= M j)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A (+ i 1)) 1) min1) (< (select A (+ k 1)) min3) (< (select A j) min2) (< (+ 2 k) N) (not (< j M)) (= min1 min2) (< (select A i) min1) (= min1 min3)) (or (<= N (+ k 1)) (= min1 0) (< (+ j 1) M) (< (+ 2 i) N) (< (select A j) min2) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A (+ (- 1) N)) 1) min1) (<= M j)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= min1 (select A i)) (= min2 (select A k)) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (< (select A (+ k 1)) (select A k)) (<= M j)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (= (select A (+ k 1)) min2) (< (select A j) min2) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 min2) (<= (select A k) (select A (+ k 1))) (<= (+ (select A (+ k 1)) 1) min2) (<= M j)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= min3 (select A k)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A j)) (< (select A i) min1) (<= min2 (select A j)) (< (select A (+ k 1)) (select A k)) (= (select A j) min1) (<= M j)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= min3 (select A k)) (< (+ 2 k) N) (= min1 (select A k)) (< (select A i) min1) (<= min2 (select A j)) (< (select A (+ k 1)) (select A k)) (= (select A j) min1) (<= M j)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A (+ k 1)) min3) (< (select A j) min2) (< (+ 2 k) N) (= min3 min2) (= min1 min2) (<= M j)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A (+ i 1)) 1) min1) (<= min3 (select A k)) (< (+ 2 k) N) (= (select A (+ k 1)) min1) (<= min2 (select A j)) (<= (select A k) (select A (+ k 1))) (= (select A j) min1) (<= M j)) (or (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (< (select A (+ k 1)) min3) (= min3 (select A (+ i 1))) (< (+ 2 k) N) (< (select A i) min1) (<= min1 (select A (+ i 1))) (<= M j)) (or (< (select A k) min3) (<= N (+ k 1)) (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A (+ i 1)) 1) min1) (< (select A (+ k 1)) min3) (< (+ 2 k) N) (not (< j M)) (< (select A i) min1) (= min1 min3) (not (< (select A j) min2)) (= (select A j) min1))), 26190#(and (or (< (select A k) min3) (not (< k N)) (<= min2 min3) (= min1 min3) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (= min1 min2) (< (+ k 1) N)) (or (not (< k N)) (not (< (select A k) min3)) (<= min2 (select A k)) (= min1 (select A k)) (< (+ k 1) N)) (or (not (< k N)) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N))), 26204#(and (or (< (select A k) min3) (not (< k N)) (= min1 min2) (= min1 min3) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (not (< k N)) (<= min1 min3) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (<= min1 (select A i)) (= (select A i) min3) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (<= min1 (select A i)) (not (< (select A k) min3)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (= min2 (select A k)) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (<= min1 (select A k))) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (<= (+ min1 min3) (+ (select A i) min2)) (= min3 min2) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (= min2 (select A k)) (not (< (select A k) min3)) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 (select A k)) (+ (select A i) min2))) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (= min3 min2) (= min1 min2) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (not (< (select A k) min3)) (= min1 min2) (= min1 (select A k)) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N))), 26203#(and (or (= min1 min2) (< k N) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= (+ min3 1) min2) (<= (+ min1 min3) (+ (select A i) min2)) (= min3 min2) (< k N) (<= (+ 2 i) N)) (or (<= min1 min3) (< k N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (<= min1 (select A i)) (= (select A i) min3) (< k N) (<= (+ 2 i) N)) (or (<= (+ min3 1) min2) (= min3 min2) (= min1 min2) (< k N) (<= (+ 2 i) N))), 26213#(and (or (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) 0) (= min1 min2) (< k N) (= min1 min3)) (or (<= 0 (select A (+ (- 1) N))) (<= (+ min1 1) min3) (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) 0) (< k N) (= min3 (select A (+ (- 1) N)))) (or (<= (+ min3 1) min2) (< (+ 2 i) N) (< j M) (= min3 min2) (= min1 min2) (< k N)) (or (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ 2 i) N) (< j M) (= min1 min2) (< k N)) (or (= min1 0) (<= (+ min1 1) min3) (< (+ 2 i) N) (< j M) (< k N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (<= (+ min3 1) min2) (< (+ 2 i) N) (< j M) (= min3 min2) (< k N) (<= (+ min1 min3) (+ min2 (select A (+ (- 1) N))))) (or (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (<= (+ min1 1) min3) (< (+ 2 i) N) (< j M) (= (select A i) min3) (< k N)) (or (< (+ 2 i) N) (< j M) (= min1 min2) (< k N) (<= (+ (select A (+ (- 1) N)) 1) min1) (= min1 min3) (<= (select A i) (select A (+ (- 1) N)))) (or (<= 0 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (= min1 min2) (< k N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (not (= min1 0)) (< (+ 2 i) N) (< j M) (= (select A i) min3) (< k N) (<= 0 (select A i))) (or (= min1 0) (< (+ 2 i) N) (< j M) (= min1 min2) (< k N) (<= (+ (select A (+ (- 1) N)) 1) min1)) (or (not (= min1 0)) (< (+ 2 i) N) (< j M) (< k N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N))) (<= 0 (select A i))) (or (< j M) (< k N) (<= (+ 2 i) N)) (or (= min1 0) (< (+ 2 i) N) (< j M) (= min1 min2) (< k N) (= min3 (select A (+ (- 1) N)))) (or (<= (+ min3 1) min2) (< (+ 2 i) N) (< j M) (= min3 min2) (< k N) (<= (+ min1 1) (select A i))) (or (not (= min1 0)) (<= (+ min1 1) min3) (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) 0) (< k N) (= min1 min3) (= min3 (select A (+ (- 1) N))))), 26199#(and (or (<= min2 min3) (< j M) (< k N) (<= (+ i 1) N) (= min1 min3)) (or (<= (+ min3 1) min2) (< j M) (= min1 min2) (< k N) (<= (+ i 1) N))), 26205#(and (or (<= (+ min3 1) min2) (< j M) (= min3 min2) (= min1 min2) (<= (+ 2 i) N)) (or (<= (+ min3 1) min2) (< j M) (<= (+ min1 min3) (+ (select A i) min2)) (= min3 min2) (<= (+ 2 i) N)) (or (< j M) (= (select A i) min3) (<= min1 min3) (<= (+ 2 i) N)) (or (<= min1 (select A i)) (< j M) (= (select A i) min3) (<= (+ 2 i) N)) (or (< j M) (= min1 min2) (= min1 min3) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N))), 26207#(and (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< j M) (= min3 min2) (= min1 min2) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (< j M) (= min1 min2) (= min1 min3) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (<= min1 (select A i)) (< j M) (= (select A i) min3) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (not (< (select A k) min3)) (= min1 min2) (= min1 (select A k)) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N) (<= min1 (select A k))) (or (not (< k N)) (<= min1 (select A i)) (< j M) (not (< (select A k) min3)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (= min2 (select A k)) (< j M) (not (< (select A k) min3)) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ min1 (select A k)) (+ (select A i) min2))) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< j M) (<= (+ min1 min3) (+ (select A i) min2)) (= min3 min2) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (<= min1 min3) (< (+ k 1) N) (<= (+ (select A i) 1) min1) (<= (+ 2 i) N)) (or (not (< k N)) (= min2 (select A k)) (< j M) (not (< (select A k) min3)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ 2 i) N))), 26230#(and (or (<= (+ 3 i) N) (< (+ j 1) M) (<= min1 (select A i)) (= (select A i) min3) (< k N) (<= (+ (select A (+ i 1)) 1) (select A i)) (<= M j)) (or (<= (+ 3 i) N) (< (+ j 1) M) (= min3 (select A (+ i 1))) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (not (< j M)) (< k N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (= min3 (select A (+ i 1))) (not (< j M)) (< k N) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (<= (+ min3 1) (select A j)) (< k N) (= (select A j) min3) (<= (+ min1 1) (select A i))) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ min3 1) (select A j)) (< k N) (<= min2 (select A j)) (= (select A j) min3) (= (select A j) min1) (<= M j)) (or (= min1 0) (< (+ j 1) M) (<= (+ min1 1) min3) (< (+ 2 i) N) (not (< j M)) (< k N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ min1 min3) (+ (select A j) (select A (+ i 1)))) (<= (+ min3 1) (select A j)) (< k N) (= (select A j) min3) (<= M j)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A (+ i 1)) 1) min1) (< (select A j) min2) (not (< j M)) (= min1 min2) (< k N) (< (select A i) min1) (= min1 min3)) (or (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (< (+ 2 i) N) (< (select A j) min2) (not (< j M)) (= min1 min2) (< k N)) (or (<= (+ min3 1) min2) (< (+ j 1) M) (< (+ 2 i) N) (= min3 min2) (not (< j M)) (< k N) (<= (+ min1 1) (select A i))) (or (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (<= (+ min1 1) min3) (< (+ 2 i) N) (= (select A i) min3) (not (< j M)) (< k N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A (+ i 1)) 1) min1) (not (< j M)) (< k N) (< (select A i) min1) (= min1 min3) (not (< (select A j) min2)) (= (select A j) min1)) (or (<= (+ 3 i) N) (< (+ j 1) M) (= min3 (select A (+ i 1))) (<= min1 min3) (not (< j M)) (< k N) (< (select A i) min1)) (or (= min1 0) (< (+ j 1) M) (< (+ 2 i) N) (< (select A j) min2) (not (< j M)) (= min1 min2) (< k N) (<= (+ (select A (+ (- 1) N)) 1) min1)) (or (< (+ j 1) M) (not (< j M)) (< k N) (<= (+ 2 i) N)) (or (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (< k N) (not (< (select A j) min2)) (= (select A j) min1)) (or (= min1 0) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (< k N) (<= (+ (select A (+ (- 1) N)) 1) min1) (not (< (select A j) min2)) (= (select A j) min1)) (or (<= (+ 3 i) N) (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A j) min2) (= min3 min2) (= min1 min2) (< k N) (<= M j)) (or (<= (+ 3 i) N) (<= (+ min3 1) min2) (< (+ j 1) M) (= min3 min2) (< k N) (<= (+ min1 min3) (+ min2 (select A (+ i 1)))) (<= M j))), 26211#(and (or (< (select A k) min3) (not (< k N)) (not (= min1 0)) (<= (+ min1 1) min3) (< (+ 2 i) N) (<= (+ (select A i) 1) 0) (= min1 min3) (< (+ k 1) N) (= min3 (select A (+ (- 1) N)))) (or (not (< k N)) (< (+ 2 i) N) (not (< (select A k) min3)) (= min1 min2) (= min1 (select A k)) (<= (+ (select A (+ (- 1) N)) 1) min1) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< (+ 2 i) N) (= min3 min2) (< (+ k 1) N) (<= (+ min1 1) (select A i))) (or (not (< k N)) (= min1 0) (< (+ 2 i) N) (= min1 min2) (<= (+ (select A (+ (- 1) N)) 1) min1) (< (+ k 1) N)) (or (not (< k N)) (= min2 (select A k)) (< (+ 2 i) N) (not (< (select A k) min3)) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ min1 (select A k)) (+ min2 (select A (+ (- 1) N))))) (or (< (select A k) min3) (not (< k N)) (not (= min1 0)) (< (+ 2 i) N) (< (+ k 1) N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N))) (<= 0 (select A i))) (or (< (select A k) min3) (not (< k N)) (< (+ 2 i) N) (= min1 min2) (<= (+ (select A (+ (- 1) N)) 1) min1) (= min1 min3) (< (+ k 1) N) (<= (select A i) (select A (+ (- 1) N)))) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (< (select A k) min3) (not (< k N)) (<= (+ min3 1) min2) (< (+ 2 i) N) (= min3 min2) (= min1 min2) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ 2 i) N) (<= (+ (select A i) 1) 0) (= min1 min2) (= min1 min3) (< (+ k 1) N)) (or (not (< k N)) (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ 2 i) N) (= min1 min2) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (= min1 0) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (<= (+ min1 1) min3) (< (+ 2 i) N) (= (select A i) min3) (< (+ k 1) N)) (or (< (select A k) min3) (not (< k N)) (= min1 0) (<= (+ min1 1) min3) (< (+ 2 i) N) (< (+ k 1) N) (= min3 (select A (+ (- 1) N))) (<= (select A i) (select A (+ (- 1) N)))) (or (not (< k N)) (= min2 (select A k)) (< (+ 2 i) N) (not (< (select A k) min3)) (<= (+ (select A k) 1) min2) (< (+ k 1) N) (<= (+ min1 1) (select A i))) (or (< (select A k) min3) (not (< k N)) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (not (= min1 0)) (< (+ 2 i) N) (= (select A i) min3) (< (+ k 1) N) (<= 0 (select A i))) (or (not (< k N)) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ 2 i) N) (not (< (select A k) min3)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ min1 1) (select A k)))), 26223#(and (or (<= min2 min3) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (< k N) (= min1 min3)) (or (< (+ j 1) M) (not (< j M)) (< k N) (= min1 min3) (not (< (select A j) min2)) (<= (select A j) min3)) (or (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (< k N)) (or (< (+ j 1) M) (not (< j M)) (<= (+ min3 1) (select A j)) (< k N) (not (< (select A j) min2)) (= (select A j) min1))), 26226#(and (or (<= (+ min3 1) min2) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (< k N) (< i N)) (or (<= min2 min3) (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (< k N) (= min1 min3) (< i N)) (or (< (+ j 1) M) (not (< j M)) (<= (+ min3 1) (select A j)) (< k N) (not (< (select A j) min2)) (< i N) (= (select A j) min1)) (or (< (+ j 1) M) (not (< j M)) (< k N) (= min1 min3) (not (< (select A j) min2)) (< i N) (<= (select A j) min3))), 26198#(and (or (<= min2 min3) (< j M) (= min1 min3) (< i N)) (or (<= (+ min3 1) min2) (< j M) (= min1 min2) (< i N)))] [2022-03-15 22:16:32,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 22:16:32,067 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:32,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 22:16:32,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=4767, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 22:16:32,068 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:17:17,933 WARN L244 SmtUtils]: Removed 116 from assertion stack [2022-03-15 22:17:17,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:17:17,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3177 ImplicationChecksByTransitivity, 56.1s TimeCoverageRelationStatistics Valid=1551, Invalid=9791, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 22:17:17,934 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 230 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:17,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 0 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:17:17,935 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:17:17,943 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:17:17,952 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:17:17,955 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:17:18,143 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:17:18,143 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (740states) and FLOYD_HOARE automaton (currently 38 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 258 for 361ms.. [2022-03-15 22:17:18,145 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:17:18,145 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:17:18,145 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:17:18,148 INFO L732 BasicCegarLoop]: Path program histogram: [9, 7, 1, 1, 1] [2022-03-15 22:17:18,150 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:17:18,150 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:17:18,154 INFO L202 PluginConnector]: Adding new model min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:17:18 BasicIcfg [2022-03-15 22:17:18,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:17:18,154 INFO L158 Benchmark]: Toolchain (without parser) took 761022.97ms. Allocated memory was 178.3MB in the beginning and 805.3MB in the end (delta: 627.0MB). Free memory was 136.5MB in the beginning and 277.4MB in the end (delta: -140.8MB). Peak memory consumption was 488.3MB. Max. memory is 8.0GB. [2022-03-15 22:17:18,154 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 178.3MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:17:18,155 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.43ms. Allocated memory is still 178.3MB. Free memory was 136.4MB in the beginning and 134.8MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 22:17:18,157 INFO L158 Benchmark]: Boogie Preprocessor took 26.90ms. Allocated memory is still 178.3MB. Free memory was 134.8MB in the beginning and 133.9MB in the end (delta: 895.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:17:18,160 INFO L158 Benchmark]: RCFGBuilder took 233.20ms. Allocated memory is still 178.3MB. Free memory was 133.8MB in the beginning and 124.3MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:17:18,160 INFO L158 Benchmark]: TraceAbstraction took 760733.05ms. Allocated memory was 178.3MB in the beginning and 805.3MB in the end (delta: 627.0MB). Free memory was 123.9MB in the beginning and 277.4MB in the end (delta: -153.5MB). Peak memory consumption was 474.7MB. Max. memory is 8.0GB. [2022-03-15 22:17:18,161 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.14ms. Allocated memory is still 178.3MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.43ms. Allocated memory is still 178.3MB. Free memory was 136.4MB in the beginning and 134.8MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.90ms. Allocated memory is still 178.3MB. Free memory was 134.8MB in the beginning and 133.9MB in the end (delta: 895.7kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 233.20ms. Allocated memory is still 178.3MB. Free memory was 133.8MB in the beginning and 124.3MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 760733.05ms. Allocated memory was 178.3MB in the beginning and 805.3MB in the end (delta: 627.0MB). Free memory was 123.9MB in the beginning and 277.4MB in the end (delta: -153.5MB). Peak memory consumption was 474.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 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 38 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 258 for 361ms.. - 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 38 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 258 for 361ms.. - 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 38 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 258 for 361ms.. - 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 38 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 258 for 361ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 42 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 760.6s, OverallIterations: 19, TraceHistogramMax: 4, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 254.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4440 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4440 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 9.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3634 mSDsCounter, 2179 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14223 IncrementalHoareTripleChecker+Invalid, 16402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2179 mSolverCounterUnsat, 0 mSDtfsCounter, 14223 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2342 GetRequests, 921 SyntacticMatches, 46 SemanticMatches, 1374 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60088 ImplicationChecksByTransitivity, 268.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=814occurred in iteration=17, InterpolantAutomatonStates: 1002, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 4275 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 300.0s InterpolantComputationTime, 527 NumberOfCodeBlocks, 527 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 722 ConstructedInterpolants, 7 QuantifiedInterpolants, 20079 SizeOfPredicates, 54 NumberOfNonLiveVariables, 1054 ConjunctsInSsa, 225 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