/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/mts-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:11:23,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:11:23,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:11:23,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:11:23,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:11:23,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:11:23,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:11:23,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:11:23,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:11:23,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:11:23,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:11:23,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:11:23,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:11:23,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:11:23,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:11:23,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:11:23,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:11:23,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:11:23,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:11:23,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:11:23,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:11:23,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:11:23,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:11:23,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:11:23,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:11:23,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:11:23,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:11:23,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:11:23,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:11:23,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:11:23,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:11:23,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:11:23,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:11:23,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:11:23,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:11:23,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:11:23,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:11:23,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:11:23,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:11:23,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:11:23,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:11:23,574 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:11:23,598 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:11:23,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:11:23,602 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:11:23,603 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:11:23,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:11:23,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:11:23,603 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:11:23,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:11:23,604 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:11:23,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:11:23,604 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:11:23,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:11:23,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:11:23,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:11:23,605 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:11:23,605 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:11:23,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:11:23,605 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:11:23,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:11:23,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:11:23,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:11:23,605 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:11:23,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:11:23,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:11:23,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:11:23,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:11:23,606 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:11:23,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:11:23,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:11:23,606 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:11:23,606 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:11:23,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:11:23,606 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:11:23,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:11:23,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:11:23,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:11:23,795 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:11:23,799 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:11:23,800 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/mts-array.wvr.bpl [2022-03-15 22:11:23,801 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/mts-array.wvr.bpl' [2022-03-15 22:11:23,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:11:23,842 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:11:23,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:11:23,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:11:23,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:11:23,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "mts-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:11:23" (1/1) ... [2022-03-15 22:11:23,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "mts-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:11:23" (1/1) ... [2022-03-15 22:11:23,860 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:11:23,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:11:23,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:11:23,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:11:23,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:11:23,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "mts-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:11:23" (1/1) ... [2022-03-15 22:11:23,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "mts-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:11:23" (1/1) ... [2022-03-15 22:11:23,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "mts-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:11:23" (1/1) ... [2022-03-15 22:11:23,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "mts-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:11:23" (1/1) ... [2022-03-15 22:11:23,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "mts-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:11:23" (1/1) ... [2022-03-15 22:11:23,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "mts-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:11:23" (1/1) ... [2022-03-15 22:11:23,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "mts-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:11:23" (1/1) ... [2022-03-15 22:11:23,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:11:23,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:11:23,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:11:23,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:11:23,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mts-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:11:23" (1/1) ... [2022-03-15 22:11:23,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:11:23,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:11:23,914 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:11:23,945 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:11:23,955 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:11:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:11:23,956 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:11:23,956 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:11:23,956 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:11:23,956 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:11:23,956 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:11:23,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:11:23,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:11:23,956 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 22:11:23,956 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 22:11:23,956 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 22:11:23,957 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:11:23,992 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:11:23,993 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:11:24,084 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:11:24,097 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:11:24,097 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:11:24,101 INFO L202 PluginConnector]: Adding new model mts-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:11:24 BoogieIcfgContainer [2022-03-15 22:11:24,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:11:24,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:11:24,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:11:24,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:11:24,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "mts-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:11:23" (1/2) ... [2022-03-15 22:11:24,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44752989 and model type mts-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:11:24, skipping insertion in model container [2022-03-15 22:11:24,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "mts-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:11:24" (2/2) ... [2022-03-15 22:11:24,123 INFO L111 eAbstractionObserver]: Analyzing ICFG mts-array.wvr.bpl [2022-03-15 22:11:24,126 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:11:24,126 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:11:24,126 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:11:24,126 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:11:24,156 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 22:11:24,185 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:11:24,192 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:11:24,192 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 22:11:24,199 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:11:24,205 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:11:24,207 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:11:24,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 82 flow [2022-03-15 22:11:24,224 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2022-03-15 22:11:24,224 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 22:11:24,234 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 5. Compared 32 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:11:24,235 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 22:11:24,511 INFO L131 LiptonReduction]: Checked pairs total: 124 [2022-03-15 22:11:24,511 INFO L133 LiptonReduction]: Total number of compositions: 12 [2022-03-15 22:11:24,516 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 22:11:24,538 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:11:24,539 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:11:24,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:11:24,544 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:11:24,544 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:11:24,545 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:11:24,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:11:24,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1475306377, now seen corresponding path program 1 times [2022-03-15 22:11:24,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:11:24,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630488707] [2022-03-15 22:11:24,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:11:24,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:11:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:11:24,651 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:11:24,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:11:24,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630488707] [2022-03-15 22:11:24,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630488707] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:11:24,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:11:24,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:11:24,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1588725111] [2022-03-15 22:11:24,654 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:11:24,656 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:11:24,699 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 22:11:24,699 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:11:24,822 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:11:24,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:11:24,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:11:24,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:11:24,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:11:24,845 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, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:11:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:11:24,876 INFO L93 Difference]: Finished difference Result 31 states and 80 transitions. [2022-03-15 22:11:24,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:11:24,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 22:11:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:11:24,885 INFO L225 Difference]: With dead ends: 31 [2022-03-15 22:11:24,885 INFO L226 Difference]: Without dead ends: 31 [2022-03-15 22:11:24,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 4 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:11:24,891 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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:11:24,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 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:11:24,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-03-15 22:11:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-03-15 22:11:24,920 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:11:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-03-15 22:11:24,921 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 80 transitions. Word has length 11 [2022-03-15 22:11:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:11:24,921 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 80 transitions. [2022-03-15 22:11:24,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:11:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 80 transitions. [2022-03-15 22:11:24,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:11:24,922 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:11:24,922 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:11:24,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:11:24,923 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:11:24,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:11:24,924 INFO L85 PathProgramCache]: Analyzing trace with hash -990973182, now seen corresponding path program 1 times [2022-03-15 22:11:24,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:11:24,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593309068] [2022-03-15 22:11:24,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:11:24,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:11:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:11:24,982 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:11:24,982 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:11:24,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593309068] [2022-03-15 22:11:24,983 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593309068] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:11:24,983 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:11:24,983 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:11:24,983 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2076247188] [2022-03-15 22:11:24,983 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:11:24,984 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:11:24,986 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:11:24,987 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:11:25,164 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:11:25,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:11:25,172 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:11:25,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:11:25,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:11:25,173 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:11:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:11:25,201 INFO L93 Difference]: Finished difference Result 40 states and 106 transitions. [2022-03-15 22:11:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:11:25,202 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:11:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:11:25,203 INFO L225 Difference]: With dead ends: 40 [2022-03-15 22:11:25,203 INFO L226 Difference]: Without dead ends: 40 [2022-03-15 22:11:25,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 4 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:11:25,204 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:11:25,204 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:11:25,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-15 22:11:25,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-03-15 22:11:25,208 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:11:25,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 106 transitions. [2022-03-15 22:11:25,208 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 106 transitions. Word has length 12 [2022-03-15 22:11:25,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:11:25,209 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 106 transitions. [2022-03-15 22:11:25,209 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:11:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 106 transitions. [2022-03-15 22:11:25,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:11:25,210 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:11:25,210 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:11:25,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:11:25,210 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:11:25,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:11:25,211 INFO L85 PathProgramCache]: Analyzing trace with hash -655362975, now seen corresponding path program 1 times [2022-03-15 22:11:25,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:11:25,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118956721] [2022-03-15 22:11:25,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:11:25,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:11:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:11:25,571 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:11:25,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:11:25,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118956721] [2022-03-15 22:11:25,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118956721] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:11:25,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739900568] [2022-03-15 22:11:25,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:11:25,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:11:25,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:11:25,576 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:11:25,580 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:11:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:11:25,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 22:11:25,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:11:25,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:11:25,932 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2022-03-15 22:11:26,010 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:11:26,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:11:26,220 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:11:26,220 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 107 treesize of output 95 [2022-03-15 22:11:26,659 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:11:26,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739900568] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:11:26,659 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:11:26,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 13 [2022-03-15 22:11:26,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1602321284] [2022-03-15 22:11:26,659 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:11:26,661 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:11:26,664 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 22:11:26,664 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:11:28,008 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [395#(and (or (= mts3 (+ (select A i) mts1)) (< (+ (select A i) mts1) 0)) (<= (+ sum mts2) mts3) (or (not (< (+ (select A i) mts1) 0)) (= mts3 0))), 396#(and (or (< j M) (<= (+ sum mts2) mts3)) (or (= mts3 (+ (select A i) mts1)) (< j M) (< (+ (select A i) mts1) 0)) (or (not (< (+ (select A i) mts1) 0)) (< j M) (= mts3 0))), 397#(and (or (< j M) (<= mts3 mts1)) (or (<= 0 i) (< j M)) (or (< j M) (<= i k)) (or (< j M) (<= (+ sum i mts2) 0)) (or (< j M) (<= mts1 mts3)) (or (< j M) (<= i 0)) (or (< j M) (< k (+ i 1))) (or (< j M) (<= 0 (+ sum i mts2))) (or (< j M) (< 0 (+ mts1 1))) (or (<= mts1 0) (< j M))), 394#(and (or (<= (+ sum mts2 (select A k) 1) 0) (< j M) (<= (+ sum mts2) mts3)) (or (< j M) (= mts1 (select A k)) (<= (+ mts3 (select A k) 1) 0)) (or (< j M) (<= mts3 (+ sum mts2)) (<= (+ mts3 (select A k) 1) 0)) (or (<= 0 (+ sum mts2)) (< j M) (<= (+ mts3 (select A k) 1) 0)) (or (< j M) (= mts1 0) (<= 1 (+ sum mts2 (select A k)))) (or (< j M) (<= (+ sum mts2) 0) (<= (+ mts3 (select A k) 1) 0))), 393#(and (or (< j M) (= mts3 mts1)) (or (< j M) (<= (+ sum mts2) mts3)))] [2022-03-15 22:11:28,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:11:28,009 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:11:28,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:11:28,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:11:28,009 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:11:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:11:28,246 INFO L93 Difference]: Finished difference Result 76 states and 207 transitions. [2022-03-15 22:11:28,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:11:28,246 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:11:28,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:11:28,247 INFO L225 Difference]: With dead ends: 76 [2022-03-15 22:11:28,247 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 22:11:28,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:11:28,248 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:11:28,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:11:28,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 22:11:28,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-03-15 22:11:28,254 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:11:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 192 transitions. [2022-03-15 22:11:28,254 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 192 transitions. Word has length 13 [2022-03-15 22:11:28,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:11:28,254 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 192 transitions. [2022-03-15 22:11:28,254 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:11:28,255 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 192 transitions. [2022-03-15 22:11:28,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:11:28,255 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:11:28,255 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:11:28,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 22:11:28,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:11:28,465 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:11:28,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:11:28,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1158618850, now seen corresponding path program 2 times [2022-03-15 22:11:28,466 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:11:28,466 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792594342] [2022-03-15 22:11:28,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:11:28,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:11:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:11:28,495 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:11:28,495 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:11:28,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792594342] [2022-03-15 22:11:28,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792594342] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:11:28,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050443186] [2022-03-15 22:11:28,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:11:28,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:11:28,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:11:28,497 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:11:28,498 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:11:28,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:11:28,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:11:28,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:11:28,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:11:28,578 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:11:28,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:11:28,604 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:11:28,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050443186] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:11:28,605 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:11:28,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-03-15 22:11:28,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1554011559] [2022-03-15 22:11:28,605 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:11:28,606 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:11:28,610 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:11:28,611 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:11:28,875 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [701#(or (<= N k) (< i N)), 700#(< i N), 702#(or (<= N i) (< (+ i 1) N)), 703#(or (<= N i) (< (+ i 1) N) (<= N k))] [2022-03-15 22:11:28,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:11:28,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:11:28,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:11:28,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-03-15 22:11:28,876 INFO L87 Difference]: Start difference. First operand 68 states and 192 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 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:11:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:11:29,083 INFO L93 Difference]: Finished difference Result 149 states and 405 transitions. [2022-03-15 22:11:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 22:11:29,083 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 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:11:29,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:11:29,085 INFO L225 Difference]: With dead ends: 149 [2022-03-15 22:11:29,085 INFO L226 Difference]: Without dead ends: 139 [2022-03-15 22:11:29,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2022-03-15 22:11:29,086 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:11:29,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:11:29,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-03-15 22:11:29,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 97. [2022-03-15 22:11:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 3.0625) internal successors, (294), 96 states have internal predecessors, (294), 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:11:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 294 transitions. [2022-03-15 22:11:29,093 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 294 transitions. Word has length 14 [2022-03-15 22:11:29,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:11:29,094 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 294 transitions. [2022-03-15 22:11:29,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 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:11:29,094 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 294 transitions. [2022-03-15 22:11:29,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:11:29,094 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:11:29,095 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:11:29,115 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:11:29,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 22:11:29,311 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:11:29,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:11:29,311 INFO L85 PathProgramCache]: Analyzing trace with hash -412340120, now seen corresponding path program 3 times [2022-03-15 22:11:29,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:11:29,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870956148] [2022-03-15 22:11:29,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:11:29,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:11:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:11:29,350 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:11:29,350 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:11:29,350 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870956148] [2022-03-15 22:11:29,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870956148] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:11:29,350 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398925625] [2022-03-15 22:11:29,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:11:29,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:11:29,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:11:29,352 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:11:29,353 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:11:29,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:11:29,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:11:29,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:11:29,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:11:29,412 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:11:29,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:11:29,446 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:11:29,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398925625] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:11:29,447 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:11:29,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-03-15 22:11:29,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1818247589] [2022-03-15 22:11:29,447 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:11:29,448 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:11:29,452 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:11:29,452 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:11:29,908 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [1166#(or (<= N i) (< (+ i 1) N) (< k N)), 1173#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 1163#(or (<= N i) (< (+ i 1) N)), 1171#(or (< j M) (<= (+ k 1) i)), 1160#(< i N), 1153#(or (<= k i) (< j M)), 1167#(or (<= (+ k 1) N) (< j M)), 1168#(or (< j M) (< k N) (< i N)), 1162#(or (< j M) (< i N)), 1161#(< j M), 1170#(or (<= (+ 2 k) N) (< j M)), 1165#(or (< k N) (< i N)), 1169#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 1174#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 1175#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 1172#(or (<= N (+ i 1)) (< (+ 2 i) N)), 1164#(or (<= N i) (< (+ i 1) N) (< j M))] [2022-03-15 22:11:29,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:11:29,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:11:29,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:11:29,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:11:29,909 INFO L87 Difference]: Start difference. First operand 97 states and 294 transitions. Second operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:11:30,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:11:30,829 INFO L93 Difference]: Finished difference Result 257 states and 741 transitions. [2022-03-15 22:11:30,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 22:11:30,829 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:11:30,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:11:30,831 INFO L225 Difference]: With dead ends: 257 [2022-03-15 22:11:30,831 INFO L226 Difference]: Without dead ends: 257 [2022-03-15 22:11:30,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=3031, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 22:11:30,833 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 248 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:11:30,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 0 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:11:30,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-03-15 22:11:30,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 150. [2022-03-15 22:11:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 3.335570469798658) internal successors, (497), 149 states have internal predecessors, (497), 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:11:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 497 transitions. [2022-03-15 22:11:30,842 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 497 transitions. Word has length 14 [2022-03-15 22:11:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:11:30,842 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 497 transitions. [2022-03-15 22:11:30,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:11:30,843 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 497 transitions. [2022-03-15 22:11:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:11:30,844 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:11:30,844 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:11:30,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 22:11:31,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:11:31,060 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:11:31,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:11:31,060 INFO L85 PathProgramCache]: Analyzing trace with hash -308693385, now seen corresponding path program 1 times [2022-03-15 22:11:31,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:11:31,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499638792] [2022-03-15 22:11:31,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:11:31,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:11:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:11:31,091 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:11:31,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:11:31,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499638792] [2022-03-15 22:11:31,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499638792] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:11:31,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833671122] [2022-03-15 22:11:31,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:11:31,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:11:31,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:11:31,108 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:11:31,109 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:11:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:11:31,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:11:31,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:11:31,170 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:11:31,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:11:31,197 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:11:31,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833671122] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:11:31,197 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:11:31,197 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-03-15 22:11:31,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1791623931] [2022-03-15 22:11:31,198 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:11:31,199 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:11:31,202 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 110 transitions. [2022-03-15 22:11:31,202 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:11:31,630 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [1898#(or (<= N i) (<= (+ 2 i) N)), 1897#(or (< (+ j 1) M) (< i N) (<= M j)), 1900#(or (< j M) (<= (+ 2 i) N)), 1899#(or (<= N i) (< (+ i 1) N) (< j M)), 1896#(or (< j M) (< i N)), 1894#(< j M), 1902#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 1895#(or (< (+ j 1) M) (<= M j)), 1901#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j))] [2022-03-15 22:11:31,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 22:11:31,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:11:31,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 22:11:31,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-03-15 22:11:31,631 INFO L87 Difference]: Start difference. First operand 150 states and 497 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 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:11:31,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:11:31,799 INFO L93 Difference]: Finished difference Result 223 states and 735 transitions. [2022-03-15 22:11:31,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 22:11:31,799 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 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:11:31,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:11:31,800 INFO L225 Difference]: With dead ends: 223 [2022-03-15 22:11:31,800 INFO L226 Difference]: Without dead ends: 223 [2022-03-15 22:11:31,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:11:31,801 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:11:31,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:11:31,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-03-15 22:11:31,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 166. [2022-03-15 22:11:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.3333333333333335) internal successors, (550), 165 states have internal predecessors, (550), 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:11:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 550 transitions. [2022-03-15 22:11:31,808 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 550 transitions. Word has length 14 [2022-03-15 22:11:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:11:31,808 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 550 transitions. [2022-03-15 22:11:31,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 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:11:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 550 transitions. [2022-03-15 22:11:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:11:31,809 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:11:31,809 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:11:31,826 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:11:32,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:11:32,023 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:11:32,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:11:32,024 INFO L85 PathProgramCache]: Analyzing trace with hash 102392763, now seen corresponding path program 4 times [2022-03-15 22:11:32,027 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:11:32,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806151589] [2022-03-15 22:11:32,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:11:32,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:11:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:11:32,305 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:11:32,305 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:11:32,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806151589] [2022-03-15 22:11:32,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806151589] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:11:32,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877187445] [2022-03-15 22:11:32,306 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:11:32,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:11:32,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:11:32,307 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:11:32,308 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:11:32,335 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:11:32,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:11:32,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:11:32,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:11:32,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:11:32,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:11:32,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:11:32,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:11:32,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 97 [2022-03-15 22:11:32,867 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:11:32,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:11:33,495 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:11:33,496 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 359 treesize of output 249 [2022-03-15 22:11:34,777 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:11:34,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877187445] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:11:34,778 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:11:34,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 20 [2022-03-15 22:11:34,778 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1998427013] [2022-03-15 22:11:34,778 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:11:34,779 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:11:34,783 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 22:11:34,783 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:11:43,062 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [2584#(and (or (<= (+ sum mts2) mts3) (< k N) (< i N)) (or (= mts3 mts1) (< k N) (< i N))), 2593#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= mts3 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= 0 (+ (select A i) mts1)) (= mts3 (select A (+ i 1))) (< (select A (+ i 1)) 0)) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (< j M) (= (+ (select A i) mts1 (select A (+ i 1))) mts3) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (+ sum mts2) mts3)) (or (<= N (+ i 1)) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (< j M) (= mts3 0) (<= 0 (+ (select A i) mts1)))), 2585#(and (or (< j M) (= mts3 mts1) (< k N) (< i N)) (or (< j M) (<= (+ sum mts2) mts3) (< k N) (< i N))), 2600#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= mts3 0) (= (+ sum mts2 (select A k)) 0) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= (select A (+ i 1)) 0) (<= 0 (+ mts3 (select A k))) (< (select A (+ i 1)) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= mts3 (+ sum mts2)) (= mts3 0)) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= (+ sum mts2 (select A k)) (+ (select A i) mts1 (select A (+ i 1)))) (= (+ (select A i) mts1 (select A (+ i 1))) (select A k)) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ sum mts2) mts3)) (or (<= N (+ i 1)) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= mts3 (+ sum mts2)) (= (select A k) 0) (<= 0 (+ (select A i) mts1)) (<= (+ (select A k) 1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (= (+ sum mts2 (select A k)) (select A (+ i 1))) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= mts3 (+ sum mts2)) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (<= (+ (select A k) 1) 0)) (or (<= N (+ i 1)) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= mts3 0) (<= 0 (+ (select A i) mts1)) (= (+ sum mts2 (select A k)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (<= mts3 (+ sum mts2)) (= (select A k) 0) (<= (+ (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= (select A k) 0) (= (+ sum mts2 (select A k)) 0) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= mts3 0) (= (+ sum mts2 (select A k)) (+ (select A i) mts1 (select A (+ i 1)))) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= mts3 (+ sum mts2)) (= (+ (select A i) mts1 (select A (+ i 1))) (select A k)) (<= (+ (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= mts3 0) (= (+ sum mts2 (select A k)) (select A (+ i 1))) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (<= N (+ i 1)) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= (select A k) 0) (<= 0 (+ (select A i) mts1)) (= (+ sum mts2 (select A k)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= 0 (+ mts3 (select A k))) (= (+ (select A i) mts1 (select A (+ i 1))) 0))), 2581#(and (or (<= (+ 2 k) N) (< j M) (<= mts3 (+ sum mts2)) (= mts3 0)) (or (<= (+ 2 k) N) (< j M) (<= (+ sum mts2) mts3)) (or (<= (+ 2 k) N) (< j M) (= (+ sum mts2 (select A k)) mts1) (= mts1 (select A k)) (<= (+ mts3 (select A k) 1) 0)) (or (<= (+ 2 k) N) (< j M) (= mts1 0) (<= 0 (+ mts3 (select A k)))) (or (<= (+ 2 k) N) (< j M) (= mts3 0) (= (+ sum mts2 (select A k)) mts1) (<= (+ mts3 (select A k) 1) 0)) (or (<= (+ 2 k) N) (< j M) (<= mts3 (+ sum mts2)) (= mts1 (select A k)) (<= (+ (select A k) 1) 0))), 2591#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (<= 0 (+ (select A i) mts1)) (= mts3 (select A (+ i 1))) (< (select A (+ i 1)) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ sum mts2) mts3) (< k N)) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (< k N) (= (+ (select A i) mts1 (select A (+ i 1))) mts3) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= mts3 0) (< k N) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (= mts3 0) (< k N) (<= 0 (+ (select A i) mts1)))), 2597#(and (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (= (select A k) 0) (not (< i N)) (= (+ sum mts2 (select A k)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (= (+ (select A i) mts1) (select A k)) (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (= (+ sum mts2 (select A k)) (+ (select A i) mts1)) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (<= mts3 (+ sum mts2)) (= (select A k) 0) (not (< i N)) (<= (+ (select A k) 1) 0)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (<= mts3 (+ sum mts2)) (= mts3 0) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (<= (+ sum mts2) mts3) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (= (+ (select A i) mts1) 0) (not (< i N)) (<= 0 (+ mts3 (select A k))) (< (+ (select A i) mts1) 0)) (or (= (+ (select A i) mts1) (select A k)) (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (<= mts3 (+ sum mts2)) (not (< i N)) (<= (+ (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (= mts3 0) (not (< i N)) (= (+ sum mts2 (select A k)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (= mts3 0) (not (< i N)) (= (+ sum mts2 (select A k)) (+ (select A i) mts1)) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0))), 2582#(and (or (<= (+ mts3 (select A k) (select A (+ (- 1) N)) 1) 0) (< j M) (< (+ 2 k) N) (<= (+ mts3 (select A k) 1) 0) (= mts1 (+ sum mts2 (select A k) (select A (+ (- 1) N))))) (or (< j M) (<= mts3 (+ sum mts2)) (< (+ 2 k) N) (<= (+ mts3 (select A k) 1) 0)) (or (< j M) (<= 0 (+ mts3 (select A k) (select A (+ (- 1) N)))) (= mts1 0) (< (+ 2 k) N) (<= (+ mts3 (select A k) 1) 0)) (or (< j M) (= mts1 (select A (+ (- 1) N))) (< (+ 2 k) N) (<= 0 (+ mts3 (select A k))) (<= (+ (select A (+ (- 1) N)) 1) 0)) (or (<= (+ 2 k) N) (< j M)) (or (< j M) (<= (+ sum mts2) mts3) (< (+ 2 k) N)) (or (<= 0 (select A (+ (- 1) N))) (< j M) (= mts1 0) (< (+ 2 k) N) (<= 0 (+ mts3 (select A k))))), 2596#(and (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (< j M) (= mts3 0) (not (< i N)) (< k N)) (or (< (+ i 1) N) (= mts3 (+ (select A i) mts1)) (< j M) (not (< i N)) (< k N) (< (+ (select A i) mts1) 0)) (or (< (+ i 1) N) (< j M) (<= (+ sum mts2) mts3) (not (< i N)) (< k N))), 2594#(and (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (<= (+ 2 k) N) (<= mts3 (+ sum mts2)) (= (select A k) 0) (not (< i N)) (<= (+ (select A k) 1) 0)) (or (= (+ (select A i) mts1) (select A k)) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= (+ sum mts2 (select A k)) (+ (select A i) mts1)) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (= (+ (select A i) mts1) (select A k)) (< (+ i 1) N) (<= (+ 2 k) N) (<= mts3 (+ sum mts2)) (not (< i N)) (<= (+ (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (< (+ i 1) N) (<= (+ 2 k) N) (= mts3 0) (not (< i N)) (= (+ sum mts2 (select A k)) (+ (select A i) mts1)) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (< (+ i 1) N) (<= (+ 2 k) N) (<= (+ sum mts2) mts3) (not (< i N))) (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (<= (+ 2 k) N) (= (select A k) 0) (not (< i N)) (= (+ sum mts2 (select A k)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (<= (+ 2 k) N) (= mts3 0) (not (< i N)) (= (+ sum mts2 (select A k)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (< (+ i 1) N) (<= (+ 2 k) N) (<= mts3 (+ sum mts2)) (= mts3 0) (not (< i N))) (or (< (+ i 1) N) (<= (+ 2 k) N) (= (+ (select A i) mts1) 0) (not (< i N)) (<= 0 (+ mts3 (select A k))) (< (+ (select A i) mts1) 0))), 2599#(and (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (< j M) (< k N) (= (+ (select A i) mts1 (select A (+ i 1))) mts3) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (+ sum mts2) mts3) (< k N)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= mts3 0) (< k N) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N) (<= 0 (+ (select A i) mts1)) (= mts3 (select A (+ i 1))) (< (select A (+ i 1)) 0)) (or (<= N (+ i 1)) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (< j M) (= mts3 0) (< k N) (<= 0 (+ (select A i) mts1)))), 2586#(and (or (<= (+ 2 k) N) (<= mts3 (+ sum mts2)) (= mts3 0) (< i N)) (or (<= (+ 2 k) N) (= mts1 0) (<= 0 (+ mts3 (select A k))) (< i N)) (or (<= (+ 2 k) N) (= (+ sum mts2 (select A k)) mts1) (= mts1 (select A k)) (< i N) (<= (+ mts3 (select A k) 1) 0)) (or (<= (+ 2 k) N) (= mts3 0) (= (+ sum mts2 (select A k)) mts1) (< i N) (<= (+ mts3 (select A k) 1) 0)) (or (<= (+ 2 k) N) (<= mts3 (+ sum mts2)) (= mts1 (select A k)) (<= (+ (select A k) 1) 0) (< i N)) (or (<= (+ 2 k) N) (<= (+ sum mts2) mts3) (< i N))), 2590#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ sum mts2) mts3)) (or (<= N (+ i 1)) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (= mts3 0) (<= 0 (+ (select A i) mts1))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= 0 (+ (select A i) mts1)) (= mts3 (select A (+ i 1))) (< (select A (+ i 1)) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= mts3 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (= (+ (select A i) mts1 (select A (+ i 1))) mts3) (< (+ (select A i) mts1) 0))), 2588#(and (or (< (+ i 1) N) (<= (+ sum mts2) mts3) (not (< i N))) (or (< (+ i 1) N) (= mts3 (+ (select A i) mts1)) (not (< i N)) (< (+ (select A i) mts1) 0)) (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (= mts3 0) (not (< i N)))), 2587#(and (or (<= (+ 2 k) N) (< j M) (<= (+ sum mts2) mts3) (< i N)) (or (<= (+ 2 k) N) (< j M) (= mts1 0) (<= 0 (+ mts3 (select A k))) (< i N)) (or (<= (+ 2 k) N) (< j M) (= (+ sum mts2 (select A k)) mts1) (= mts1 (select A k)) (< i N) (<= (+ mts3 (select A k) 1) 0)) (or (<= (+ 2 k) N) (< j M) (<= mts3 (+ sum mts2)) (= mts3 0) (< i N)) (or (<= (+ 2 k) N) (< j M) (= mts3 0) (= (+ sum mts2 (select A k)) mts1) (< i N) (<= (+ mts3 (select A k) 1) 0)) (or (<= (+ 2 k) N) (< j M) (<= mts3 (+ sum mts2)) (= mts1 (select A k)) (<= (+ (select A k) 1) 0) (< i N))), 2583#(and (or (< j M) (<= (+ sum mts2) mts3) (< i N)) (or (< j M) (= mts3 mts1) (< i N))), 2580#(and (or (< j M) (<= (+ sum mts2) mts3) (< k N)) (or (< j M) (= mts3 mts1) (< k N))), 2592#(and (or (< (+ i 1) N) (= mts3 (+ (select A i) mts1)) (< j M) (not (< i N)) (< (+ (select A i) mts1) 0)) (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (< j M) (= mts3 0) (not (< i N))) (or (< (+ i 1) N) (< j M) (<= (+ sum mts2) mts3) (not (< i N)))), 2598#(and (or (< j M) (<= (+ mts3 (select A k)) mts1)) (or (<= mts1 (+ sum mts2 (select A k))) (< j M) (<= (+ mts3 (select A k) 1) 0)) (or (< j M) (= mts1 0) (<= 0 (+ mts3 (select A k)))) (or (< j M) (<= (+ sum mts2) mts3)) (or (< j M) (<= (+ k 1) i))), 2578#(and (or (<= (+ sum mts2) mts3) (< i N)) (or (= mts3 mts1) (< i N))), 2589#(and (or (< (+ i 1) N) (= mts3 (+ (select A i) mts1)) (not (< i N)) (< k N) (< (+ (select A i) mts1) 0)) (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (= mts3 0) (not (< i N)) (< k N)) (or (< (+ i 1) N) (<= (+ sum mts2) mts3) (not (< i N)) (< k N))), 2601#(and (or (< j M) (<= mts3 mts1)) (or (<= 0 i) (< j M)) (or (< j M) (<= mts1 (+ sum mts2))) (or (< j M) (<= i k)) (or (< j M) (<= (+ sum mts2) mts3)) (or (< j M) (<= i 0)) (or (<= k i) (< j M))), 2579#(and (or (< j M) (= mts3 mts1)) (or (< j M) (<= (+ sum mts2) mts3))), 2595#(and (or (<= N (+ i 1)) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (<= (+ 2 k) N) (= (select A k) 0) (<= 0 (+ (select A i) mts1)) (= (+ sum mts2 (select A k)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= mts3 0) (= (+ sum mts2 (select A k)) 0) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (= (select A (+ i 1)) 0) (<= 0 (+ mts3 (select A k))) (< (select A (+ i 1)) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= (select A k) 0) (= (+ sum mts2 (select A k)) 0) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= mts3 (+ sum mts2)) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (<= (+ (select A k) 1) 0)) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (<= (+ 2 k) N) (= (+ sum mts2 (select A k)) (+ (select A i) mts1 (select A (+ i 1)))) (= (+ (select A i) mts1 (select A (+ i 1))) (select A k)) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (<= (+ 2 k) N) (= mts3 0) (= (+ sum mts2 (select A k)) (+ (select A i) mts1 (select A (+ i 1)))) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ sum mts2) mts3)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= mts3 (+ sum mts2)) (= mts3 0)) (or (<= N (+ i 1)) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (<= (+ 2 k) N) (= mts3 0) (<= 0 (+ (select A i) mts1)) (= (+ sum mts2 (select A k)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (<= (+ 2 k) N) (<= 0 (+ mts3 (select A k))) (= (+ (select A i) mts1 (select A (+ i 1))) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (= (+ sum mts2 (select A k)) (select A (+ i 1))) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (<= (+ 2 k) N) (<= mts3 (+ sum mts2)) (= (+ (select A i) mts1 (select A (+ i 1))) (select A k)) (<= (+ (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (<= (+ 2 k) N) (<= mts3 (+ sum mts2)) (= (select A k) 0) (<= 0 (+ (select A i) mts1)) (<= (+ (select A k) 1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (= mts3 0) (= (+ sum mts2 (select A k)) (select A (+ i 1))) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (<= mts3 (+ sum mts2)) (= (select A k) 0) (<= (+ (select A k) 1) 0) (< (+ (select A i) mts1) 0)))] [2022-03-15 22:11:43,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:11:43,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:11:43,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:11:43,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1768, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:11:43,064 INFO L87 Difference]: Start difference. First operand 166 states and 550 transitions. Second operand has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 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:12:03,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:12:03,659 INFO L93 Difference]: Finished difference Result 457 states and 1386 transitions. [2022-03-15 22:12:03,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 22:12:03,659 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 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:12:03,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:12:03,662 INFO L225 Difference]: With dead ends: 457 [2022-03-15 22:12:03,662 INFO L226 Difference]: Without dead ends: 436 [2022-03-15 22:12:03,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3953 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=1957, Invalid=10925, Unknown=0, NotChecked=0, Total=12882 [2022-03-15 22:12:03,665 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 501 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:12:03,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 0 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 22:12:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-03-15 22:12:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 206. [2022-03-15 22:12:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 3.419512195121951) internal successors, (701), 205 states have internal predecessors, (701), 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:12:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 701 transitions. [2022-03-15 22:12:03,672 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 701 transitions. Word has length 15 [2022-03-15 22:12:03,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:12:03,672 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 701 transitions. [2022-03-15 22:12:03,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 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:12:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 701 transitions. [2022-03-15 22:12:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:12:03,673 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:12:03,673 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:12:03,696 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:12:03,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:12:03,890 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:12:03,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:12:03,891 INFO L85 PathProgramCache]: Analyzing trace with hash 27393337, now seen corresponding path program 5 times [2022-03-15 22:12:03,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:12:03,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123965541] [2022-03-15 22:12:03,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:12:03,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:12:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:03,930 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:12:03,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123965541] [2022-03-15 22:12:03,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123965541] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:12:03,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132020603] [2022-03-15 22:12:03,931 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:12:03,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:12:03,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:12:03,932 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:12:03,933 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:12:03,959 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:12:03,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:12:03,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:12:03,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:12:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:04,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:12:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:04,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132020603] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:12:04,040 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:12:04,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-03-15 22:12:04,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1061690368] [2022-03-15 22:12:04,040 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:12:04,041 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:12:04,045 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:12:04,045 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:12:04,671 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [3708#(or (<= (+ 3 k) N) (<= N k)), 3711#(or (< j M) (<= (+ k 1) i)), 3695#(or (< j M) (<= k (+ i 1))), 3717#(or (< j M) (<= (+ k 1) i) (<= N k)), 3707#(or (<= (+ 2 k) N) (< j M)), 3705#(or (<= N i) (< (+ i 1) N)), 3718#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 3704#(or (< j M) (< i N)), 3709#(or (<= (+ 2 k) i) (<= N k)), 3710#(or (<= (+ k 1) i) (<= N k)), 3716#(or (<= k i) (< j M)), 3703#(< j M), 3715#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 3719#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 3714#(or (<= N (+ i 1)) (< (+ 2 i) N)), 3706#(or (<= N i) (< (+ i 1) N) (< j M)), 3702#(< i N), 3712#(or (<= (+ 3 k) N) (< j M) (<= N k)), 3713#(or (<= (+ 2 k) i) (< j M) (<= N k))] [2022-03-15 22:12:04,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:12:04,672 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:12:04,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:12:04,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2022-03-15 22:12:04,672 INFO L87 Difference]: Start difference. First operand 206 states and 701 transitions. Second operand has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 25 states have internal predecessors, (81), 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:12:07,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:12:07,004 INFO L93 Difference]: Finished difference Result 560 states and 1691 transitions. [2022-03-15 22:12:07,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-03-15 22:12:07,005 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 25 states have internal predecessors, (81), 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:12:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:12:07,009 INFO L225 Difference]: With dead ends: 560 [2022-03-15 22:12:07,009 INFO L226 Difference]: Without dead ends: 560 [2022-03-15 22:12:07,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2830 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1855, Invalid=8245, Unknown=0, NotChecked=0, Total=10100 [2022-03-15 22:12:07,012 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 379 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:12:07,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 0 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:12:07,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-03-15 22:12:07,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 243. [2022-03-15 22:12:07,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 3.479338842975207) internal successors, (842), 242 states have internal predecessors, (842), 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:12:07,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 842 transitions. [2022-03-15 22:12:07,023 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 842 transitions. Word has length 15 [2022-03-15 22:12:07,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:12:07,023 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 842 transitions. [2022-03-15 22:12:07,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 25 states have internal predecessors, (81), 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:12:07,023 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 842 transitions. [2022-03-15 22:12:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:12:07,025 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:12:07,026 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:12:07,053 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:12:07,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:12:07,244 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:12:07,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:12:07,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1744482578, now seen corresponding path program 2 times [2022-03-15 22:12:07,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:12:07,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842918644] [2022-03-15 22:12:07,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:12:07,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:12:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:07,770 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:12:07,770 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:12:07,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842918644] [2022-03-15 22:12:07,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842918644] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:12:07,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961440068] [2022-03-15 22:12:07,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:12:07,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:12:07,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:12:07,772 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:12:07,772 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:12:07,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:12:07,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:12:07,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:12:07,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:12:08,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:12:08,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:12:08,206 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 124 treesize of output 88 [2022-03-15 22:12:08,304 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:12:08,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:12:09,095 INFO L353 Elim1Store]: treesize reduction 10, result has 81.8 percent of original size [2022-03-15 22:12:09,095 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 385 treesize of output 319 [2022-03-15 22:13:43,399 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:13:43,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961440068] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:43,399 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:43,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-03-15 22:13:43,399 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1009977357] [2022-03-15 22:13:43,399 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:43,400 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:43,405 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 141 transitions. [2022-03-15 22:13:43,405 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:57,914 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [5018#(and (or (= (+ mts3 (select A k)) mts1) (<= (+ mts3 1) (+ sum mts2)) (< j M) (<= (+ i 1) N) (<= (+ mts3 (select A k) 1) 0)) (or (< j M) (<= (+ sum mts2) mts3) (= mts1 0) (<= 1 (+ sum mts2 (select A k))) (<= (+ i 1) N)) (or (<= (+ mts3 1) (+ sum mts2)) (< j M) (= mts1 0) (<= (+ i 1) N) (<= 0 (+ mts3 (select A k)))) (or (<= (+ sum mts2 (select A k) 1) 0) (< j M) (<= (+ sum mts2) mts3) (= (+ sum mts2 (select A k)) mts1) (<= (+ i 1) N))), 5016#(and (or (= (+ sum mts2) mts1) (< i N) (<= (+ sum mts2 1) mts3)) (or (<= (+ mts3 1) (+ sum mts2)) (= mts3 mts1) (< i N))), 5023#(and (or (<= (+ sum mts2) (+ mts3 1)) (< j M) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (<= mts1 (+ sum mts2))) (or (<= (+ sum mts2) mts1) (<= (+ sum mts2) (+ mts3 1)) (< j M) (not (= (+ (select A i) (* (- 1) (select A k))) 0))) (or (< j M) (= (+ (select A i) (* (- 1) (select A k))) 0) (< i (+ k 1))) (or (< j M) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (not (= mts1 0)) (<= mts1 mts3)) (or (<= (+ k 1) N) (< j M) (= (+ (select A i) (* (- 1) (select A k))) 0)) (or (< j M) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (<= (+ sum mts2) mts3) (not (= mts1 0))) (or (< mts2 (+ mts1 1)) (< j M) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (<= (+ sum mts2) mts3)) (or (< j M) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (not (= mts1 0)) (<= mts3 mts1)) (or (<= (+ (select A i) mts1 1) 0) (< j M) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (= (+ (select A i) mts1) 0) (<= (+ sum mts2) mts3) (<= 1 (+ (select A i) sum mts2))) (or (<= (+ sum mts2) mts1) (< j M) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (<= (+ mts3 (select A k) 1) 0)) (or (< j M) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (<= mts1 (+ sum mts2)) (<= mts1 mts3) (<= (+ mts3 (select A k) 1) 0)) (or (< j M) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (< 0 (+ mts1 1))) (or (<= mts1 0) (< j M) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (<= (+ mts3 mts1) (+ sum mts2))) (or (< j M) (not (= (+ (select A i) (* (- 1) (select A k))) 0)) (<= (+ sum mts2) mts3) (<= mts1 mts2))), 5014#(and (or (< j M) (= mts1 0) (<= 1 (+ sum mts2 (select A k))) (<= 0 (+ mts3 (select A k)))) (or (= (+ mts3 (select A k)) mts1) (<= (+ mts3 1) (+ sum mts2)) (< j M) (<= (+ mts3 (select A k) 1) 0)) (or (<= (+ sum mts2 (select A k) 1) 0) (< j M) (<= (+ sum mts2) mts3) (= (+ sum mts2 (select A k)) mts1))), 5019#(and (or (not (< (+ (select A j) mts2) 0)) (< (+ j 1) M) (not (< j M)) (= sum mts1) (<= (+ sum 1) mts3) (< i N)) (or (not (< (+ (select A j) mts2) 0)) (< (+ j 1) M) (<= (+ mts3 1) sum) (not (< j M)) (= mts3 mts1) (< i N)) (or (< (+ j 1) M) (< (+ (select A j) mts2) 0) (<= (+ mts3 1) (+ (select A j) sum mts2)) (not (< j M)) (= mts3 mts1) (< i N)) (or (< (+ j 1) M) (< (+ (select A j) mts2) 0) (not (< j M)) (= mts1 (+ (select A j) sum mts2)) (<= (+ (select A j) sum mts2 1) mts3) (< i N))), 5022#(and (or (<= (+ mts3 1) (+ sum mts2)) (< (+ i 1) N) (= mts3 (+ (select A i) mts1)) (< j M) (not (< i N)) (< (+ (select A i) mts1) 0)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= (+ sum mts2) (+ (select A i) mts1)) (<= (+ sum mts2 1) mts3) (< (+ (select A i) mts1) 0)) (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (< j M) (not (< i N)) (= (+ sum mts2) 0) (<= (+ sum mts2 1) mts3)) (or (<= (+ mts3 1) (+ sum mts2)) (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (< j M) (= mts3 0) (not (< i N)))), 5025#(and (or (< (+ j 1) M) (< (+ i 1) N) (= mts3 (+ (select A i) mts1)) (< (+ (select A j) mts2) 0) (not (< i N)) (<= (+ mts3 1) (+ (select A j) sum mts2)) (not (< j M)) (< (+ (select A i) mts1) 0)) (or (not (< (+ (select A j) mts2) 0)) (< (+ j 1) M) (< (+ i 1) N) (= mts3 (+ (select A i) mts1)) (not (< i N)) (<= (+ mts3 1) sum) (not (< j M)) (< (+ (select A i) mts1) 0)) (or (< (+ j 1) M) (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (< (+ (select A j) mts2) 0) (not (< i N)) (not (< j M)) (<= (+ (select A j) sum mts2 1) mts3) (= (+ (select A j) sum mts2) 0)) (or (not (< (+ (select A j) mts2) 0)) (< (+ j 1) M) (= sum (+ (select A i) mts1)) (< (+ i 1) N) (not (< i N)) (not (< j M)) (<= (+ sum 1) mts3) (< (+ (select A i) mts1) 0)) (or (< (+ j 1) M) (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (= mts3 0) (< (+ (select A j) mts2) 0) (not (< i N)) (<= (+ mts3 1) (+ (select A j) sum mts2)) (not (< j M))) (or (not (< (+ (select A j) mts2) 0)) (< (+ j 1) M) (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (= mts3 0) (not (< i N)) (<= (+ mts3 1) sum) (not (< j M))) (or (< (+ j 1) M) (< (+ i 1) N) (< (+ (select A j) mts2) 0) (not (< i N)) (= (+ (select A i) mts1) (+ (select A j) sum mts2)) (not (< j M)) (<= (+ (select A j) sum mts2 1) mts3) (< (+ (select A i) mts1) 0)) (or (not (< (+ (select A j) mts2) 0)) (< (+ j 1) M) (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (not (< i N)) (not (< j M)) (<= (+ sum 1) mts3) (= sum 0))), 5015#(and (or (= (+ mts3 (select A k)) mts1) (< (+ j 1) M) (< (+ (select A j) mts2) 0) (<= (+ mts3 1) (+ (select A j) sum mts2)) (not (< j M)) (<= (+ mts3 (select A k) 1) 0)) (or (= (+ (select A j) sum mts2 (select A k)) mts1) (< (+ j 1) M) (<= (+ (select A j) sum mts2 (select A k) 1) 0) (<= (+ (select A j) sum mts2) mts3) (< (+ (select A j) mts2) 0) (not (< j M))) (or (= mts1 (+ sum (select A k))) (not (< (+ (select A j) mts2) 0)) (< (+ j 1) M) (<= sum mts3) (not (< j M)) (<= (+ sum (select A k) 1) 0)) (or (< (+ j 1) M) (< (+ (select A j) mts2) 0) (= mts1 0) (not (< j M)) (<= 0 (+ mts3 (select A k))) (<= 1 (+ (select A j) sum mts2 (select A k)))) (or (= (+ mts3 (select A k)) mts1) (not (< (+ (select A j) mts2) 0)) (< (+ j 1) M) (<= (+ mts3 1) sum) (not (< j M)) (<= (+ mts3 (select A k) 1) 0)) (or (not (< (+ (select A j) mts2) 0)) (< (+ j 1) M) (<= 1 (+ sum (select A k))) (= mts1 0) (not (< j M)) (<= 0 (+ mts3 (select A k))))), 5017#(and (or (< j M) (= (+ sum mts2) mts1) (< i N) (<= (+ sum mts2 1) mts3)) (or (<= (+ mts3 1) (+ sum mts2)) (< j M) (= mts3 mts1) (< i N))), 5028#(and (or (<= 0 mts3) (< j M)) (or (<= (+ (select A i) mts1 1) 0) (< j M) (<= (+ sum mts2) (+ (select A i) mts3 mts1))) (or (< j M) (<= (+ (select A i) mts1) mts2) (<= (+ (select A i) mts1) 0)) (or (< j M) (<= 0 sum) (<= 0 (+ (select A i) mts1))) (or (< j M) (<= 0 sum) (<= (+ (select A i) mts1) 0)) (or (<= (+ k 1) N) (< j M)) (or (<= mts3 0) (< j M)) (or (<= (+ i 1) k) (< j M)) (or (< j M) (<= 0 (+ (select A i) mts1)) (= mts2 0)) (or (< j M) (<= (+ sum mts2) (+ (select A i) mts3 mts1)) (<= sum 0))), 5020#(and (or (= (+ mts3 (select A k)) mts1) (not (< (+ (select A j) mts2) 0)) (< (+ j 1) M) (<= (+ mts3 1) sum) (not (< j M)) (< i N) (<= (+ mts3 (select A k) 1) 0)) (or (= mts1 (+ sum (select A k))) (not (< (+ (select A j) mts2) 0)) (< (+ j 1) M) (<= sum mts3) (not (< j M)) (<= (+ sum (select A k) 1) 0) (< i N)) (or (< (+ j 1) M) (< (+ (select A j) mts2) 0) (= mts1 0) (not (< j M)) (<= 0 (+ mts3 (select A k))) (< i N) (<= 1 (+ (select A j) sum mts2 (select A k)))) (or (= (+ (select A j) sum mts2 (select A k)) mts1) (< (+ j 1) M) (<= (+ (select A j) sum mts2 (select A k) 1) 0) (<= (+ (select A j) sum mts2) mts3) (< (+ (select A j) mts2) 0) (not (< j M)) (< i N)) (or (not (< (+ (select A j) mts2) 0)) (< (+ j 1) M) (<= 1 (+ sum (select A k))) (= mts1 0) (not (< j M)) (<= 0 (+ mts3 (select A k))) (< i N)) (or (= (+ mts3 (select A k)) mts1) (< (+ j 1) M) (< (+ (select A j) mts2) 0) (<= (+ mts3 1) (+ (select A j) sum mts2)) (not (< j M)) (< i N) (<= (+ mts3 (select A k) 1) 0))), 5029#(and (or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (= (+ (select A j) sum mts2) (select A (+ i 1))) (< (+ (select A j) mts2) 0) (<= (+ (select A j) sum mts2 1) mts3) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (<= M j)) (or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= mts3 0) (< (+ (select A j) mts2) 0) (<= (+ mts3 1) (+ (select A j) sum mts2)) (<= M j) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= (+ sum 1) mts3) (<= 0 (+ (select A j) mts2)) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (= sum (select A (+ i 1))) (<= M j)) (or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (<= (+ sum 1) mts3) (<= 0 (+ (select A j) mts2)) (= sum 0) (<= M j) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (< (+ (select A j) mts2) 0) (<= (+ (select A j) sum mts2 1) mts3) (= (+ (select A j) sum mts2) 0) (<= M j) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ j 1) M) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (= mts3 0) (<= (+ mts3 1) sum) (<= 0 (+ (select A j) mts2)) (<= 0 (+ (select A i) mts1)) (<= M j)) (or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= mts3 0) (<= (+ mts3 1) sum) (<= 0 (+ (select A j) mts2)) (<= M j) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (< (+ (select A j) mts2) 0) (<= (+ mts3 1) (+ (select A j) sum mts2)) (<= 0 (+ (select A i) mts1)) (= mts3 (select A (+ i 1))) (< (select A (+ i 1)) 0) (<= M j)) (or (<= N (+ i 1)) (< (+ j 1) M) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (< (+ (select A j) mts2) 0) (<= (+ mts3 1) (+ (select A j) sum mts2)) (= (+ (select A i) mts1 (select A (+ i 1))) mts3) (<= M j) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ j 1) M) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (< (+ (select A j) mts2) 0) (<= (+ (select A j) sum mts2 1) mts3) (<= 0 (+ (select A i) mts1)) (= (+ (select A j) sum mts2) 0) (<= M j)) (or (<= N (+ i 1)) (< (+ j 1) M) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (<= (+ sum 1) mts3) (<= 0 (+ (select A j) mts2)) (<= 0 (+ (select A i) mts1)) (= sum 0) (<= M j)) (or (<= N (+ i 1)) (< (+ j 1) M) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (= mts3 0) (< (+ (select A j) mts2) 0) (<= (+ mts3 1) (+ (select A j) sum mts2)) (<= 0 (+ (select A i) mts1)) (<= M j)) (or (<= N (+ i 1)) (< (+ j 1) M) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (< (+ (select A j) mts2) 0) (= (+ (select A i) mts1 (select A (+ i 1))) (+ (select A j) sum mts2)) (<= (+ (select A j) sum mts2 1) mts3) (<= M j) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= (+ mts3 1) sum) (<= 0 (+ (select A j) mts2)) (<= 0 (+ (select A i) mts1)) (= mts3 (select A (+ i 1))) (< (select A (+ i 1)) 0) (<= M j)) (or (<= N (+ i 1)) (< (+ j 1) M) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (= (+ (select A i) mts1 (select A (+ i 1))) sum) (<= (+ sum 1) mts3) (<= 0 (+ (select A j) mts2)) (<= M j) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ j 1) M) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (<= (+ mts3 1) sum) (<= 0 (+ (select A j) mts2)) (= (+ (select A i) mts1 (select A (+ i 1))) mts3) (<= M j) (< (+ (select A i) mts1) 0))), 5013#(and (or (< (+ j 1) M) (< (+ (select A j) mts2) 0) (not (< j M)) (= mts1 (+ (select A j) sum mts2)) (<= (+ (select A j) sum mts2 1) mts3)) (or (not (< (+ (select A j) mts2) 0)) (< (+ j 1) M) (<= (+ mts3 1) sum) (not (< j M)) (= mts3 mts1)) (or (not (< (+ (select A j) mts2) 0)) (< (+ j 1) M) (not (< j M)) (= sum mts1) (<= (+ sum 1) mts3)) (or (< (+ j 1) M) (< (+ (select A j) mts2) 0) (<= (+ mts3 1) (+ (select A j) sum mts2)) (not (< j M)) (= mts3 mts1))), 5012#(and (or (< j M) (= (+ sum mts2) mts1) (<= (+ sum mts2 1) mts3)) (or (<= (+ mts3 1) (+ sum mts2)) (< j M) (= mts3 mts1))), 5021#(and (or (<= (+ mts3 1) (+ sum mts2)) (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (= mts3 0) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (= (+ sum mts2) (+ (select A i) mts1)) (<= (+ sum mts2 1) mts3) (< (+ (select A i) mts1) 0)) (or (<= (+ mts3 1) (+ sum mts2)) (< (+ i 1) N) (= mts3 (+ (select A i) mts1)) (not (< i N)) (< (+ (select A i) mts1) 0)) (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (not (< i N)) (= (+ sum mts2) 0) (<= (+ sum mts2 1) mts3))), 5030#(and (or (<= (+ (select A i) mts1 1) 0) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) sum mts2) (+ (select A i) mts3 mts1))) (or (not (< (+ (select A j) mts2) 0)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) mts1) 0)) (or (< (+ j 1) M) (< (+ (select A j) mts2) 0) (not (< j M)) (= (+ (select A j) mts2) 0) (<= 0 (+ (select A i) mts1))) (or (< (+ j 1) M) (<= (+ k 1) N) (not (< j M))) (or (<= mts3 0) (< (+ j 1) M) (not (< j M))) (or (< (+ j 1) M) (< (+ (select A j) mts2) 0) (not (< j M)) (<= (+ (select A i) mts1) (+ (select A j) mts2))) (or (< (+ j 1) M) (<= (+ i 1) k) (not (< j M))) (or (< (+ j 1) M) (<= 0 mts3) (not (< j M))) (or (< (+ j 1) M) (<= 0 sum) (not (< j M)) (<= (+ (select A i) mts1) 0)) (or (< (+ j 1) M) (not (< j M)) (<= sum 0)) (or (< (+ j 1) M) (<= 0 sum) (not (< j M)) (<= 0 (+ (select A i) mts1)))), 5024#(and (or (<= (+ mts3 1) (+ sum mts2)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= mts3 0) (not (< (+ (select A i) mts1 (select A (+ i 1))) 0)) (< (+ (select A i) mts1) 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (+ sum mts2) 0) (not (< (+ (select A i) mts1 (select A (+ i 1))) 0)) (<= (+ sum mts2 1) mts3) (< (+ (select A i) mts1) 0)) (or (not (< (+ i 1) N)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (= (+ sum mts2) (+ (select A i) mts1 (select A (+ i 1)))) (<= (+ sum mts2 1) mts3) (< (+ (select A i) mts1) 0)) (or (<= (+ mts3 1) (+ sum mts2)) (not (< (+ (select A i) mts1) 0)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= mts3 (select A (+ i 1))) (< (select A (+ i 1)) 0)) (or (<= (+ mts3 1) (+ sum mts2)) (not (< (+ i 1) N)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (= (+ (select A i) mts1 (select A (+ i 1))) mts3) (< (+ (select A i) mts1) 0)) (or (<= (+ mts3 1) (+ sum mts2)) (not (< (+ (select A i) mts1) 0)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= mts3 0) (not (< (select A (+ i 1)) 0))) (or (not (< (+ (select A i) mts1) 0)) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (+ sum mts2) 0) (not (< (select A (+ i 1)) 0)) (<= (+ sum mts2 1) mts3)) (or (not (< (+ (select A i) mts1) 0)) (not (< (+ i 1) N)) (= (+ sum mts2) (select A (+ i 1))) (< (+ 2 i) N) (< (select A (+ i 1)) 0) (<= (+ sum mts2 1) mts3))), 5027#(and (or (not (< (+ i 1) N)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (< j M) (= (+ sum mts2) (+ (select A i) mts1 (select A (+ i 1)))) (<= (+ sum mts2 1) mts3) (< (+ (select A i) mts1) 0)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (= (+ sum mts2) 0) (not (< (+ (select A i) mts1 (select A (+ i 1))) 0)) (<= (+ sum mts2 1) mts3) (< (+ (select A i) mts1) 0)) (or (<= (+ mts3 1) (+ sum mts2)) (not (< (+ (select A i) mts1) 0)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (= mts3 0) (not (< (select A (+ i 1)) 0))) (or (<= (+ mts3 1) (+ sum mts2)) (not (< (+ (select A i) mts1) 0)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (= mts3 (select A (+ i 1))) (< (select A (+ i 1)) 0)) (or (<= (+ mts3 1) (+ sum mts2)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (= mts3 0) (not (< (+ (select A i) mts1 (select A (+ i 1))) 0)) (< (+ (select A i) mts1) 0)) (or (not (< (+ (select A i) mts1) 0)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (= (+ sum mts2) 0) (not (< (select A (+ i 1)) 0)) (<= (+ sum mts2 1) mts3)) (or (<= (+ mts3 1) (+ sum mts2)) (not (< (+ i 1) N)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (< j M) (= (+ (select A i) mts1 (select A (+ i 1))) mts3) (< (+ (select A i) mts1) 0)) (or (not (< (+ (select A i) mts1) 0)) (not (< (+ i 1) N)) (= (+ sum mts2) (select A (+ i 1))) (< (+ 2 i) N) (< j M) (< (select A (+ i 1)) 0) (<= (+ sum mts2 1) mts3))), 5026#(and (or (not (= (select A i) (select A k))) (< (+ j 1) M) (<= mts1 (+ (select A j) mts2)) (< (+ (select A j) mts2) 0) (not (< j M))) (or (not (= (select A i) (select A k))) (<= (+ (select A j) sum mts2) mts1) (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) sum mts2) (+ mts3 1))) (or (< (+ j 1) M) (<= (+ k 1) N) (not (< j M)) (= (select A i) (select A k))) (or (not (= (select A i) (select A k))) (< (+ j 1) M) (not (< j M)) (not (= mts1 0)) (<= mts3 mts1)) (or (< (+ j 1) M) (not (< j M)) (= (select A i) (select A k)) (< i (+ k 1))) (or (<= mts1 0) (not (= (select A i) (select A k))) (< (+ j 1) M) (<= (+ mts3 mts1) (+ (select A j) sum mts2)) (not (< j M))) (or (not (= (select A i) (select A k))) (< (+ j 1) M) (not (< j M)) (not (= mts1 0)) (<= mts1 mts3)) (or (not (= (select A i) (select A k))) (not (< (+ (select A j) mts2) 0)) (< (+ j 1) M) (<= sum mts3) (not (< j M))) (or (not (= (select A i) (select A k))) (< (+ j 1) M) (not (< j M)) (< 0 (+ mts1 1))) (or (not (= (select A i) (select A k))) (< (+ j 1) M) (<= (+ (select A j) sum mts2) mts3) (not (< j M)) (not (= mts1 0))) (or (not (= (select A i) (select A k))) (<= (+ (select A j) sum mts2) mts1) (< (+ j 1) M) (not (< j M)) (<= (+ mts3 (select A k) 1) 0)) (or (<= (+ (select A i) mts1 1) 0) (not (= (select A i) (select A k))) (< (+ j 1) M) (<= 1 (+ (select A i) (select A j) sum mts2)) (= (+ (select A i) mts1) 0) (<= (+ (select A j) sum mts2) mts3) (not (< j M))) (or (not (= (select A i) (select A k))) (< (+ j 1) M) (<= mts1 (+ (select A j) sum mts2)) (not (< j M)) (<= (+ (select A j) sum mts2) (+ mts3 1))) (or (not (= (select A i) (select A k))) (< (+ j 1) M) (< (+ (select A j) mts2) (+ mts1 1)) (<= (+ (select A j) sum mts2) mts3) (not (< j M))) (or (not (= (select A i) (select A k))) (< (+ j 1) M) (<= mts1 (+ (select A j) sum mts2)) (not (< j M)) (<= mts1 mts3) (<= (+ mts3 (select A k) 1) 0)))] [2022-03-15 22:13:57,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:13:57,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:57,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:13:57,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 22:13:57,916 INFO L87 Difference]: Start difference. First operand 243 states and 842 transitions. Second operand has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 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:14:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:34,978 INFO L93 Difference]: Finished difference Result 983 states and 2708 transitions. [2022-03-15 22:14:34,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-03-15 22:14:34,978 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 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:14:34,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:34,982 INFO L225 Difference]: With dead ends: 983 [2022-03-15 22:14:34,982 INFO L226 Difference]: Without dead ends: 955 [2022-03-15 22:14:34,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 42 SyntacticMatches, 9 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3237 ImplicationChecksByTransitivity, 38.2s TimeCoverageRelationStatistics Valid=1611, Invalid=9519, Unknown=0, NotChecked=0, Total=11130 [2022-03-15 22:14:34,984 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 387 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:34,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 0 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 22:14:34,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2022-03-15 22:14:34,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 266. [2022-03-15 22:14:34,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 3.539622641509434) internal successors, (938), 265 states have internal predecessors, (938), 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:14:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 938 transitions. [2022-03-15 22:14:34,994 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 938 transitions. Word has length 15 [2022-03-15 22:14:34,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:34,994 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 938 transitions. [2022-03-15 22:14:34,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 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:14:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 938 transitions. [2022-03-15 22:14:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:14:34,995 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:34,995 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:35,013 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:14:35,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:35,213 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:14:35,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:35,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1687476081, now seen corresponding path program 3 times [2022-03-15 22:14:35,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:35,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014590729] [2022-03-15 22:14:35,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:35,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:35,239 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:14:35,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:35,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014590729] [2022-03-15 22:14:35,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014590729] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:35,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715605808] [2022-03-15 22:14:35,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:14:35,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:35,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:35,240 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:14:35,244 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:14:35,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:14:35,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:35,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:14:35,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:35,302 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:14:35,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:35,344 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:14:35,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715605808] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:35,345 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:35,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-03-15 22:14:35,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [924802368] [2022-03-15 22:14:35,345 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:35,346 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:35,350 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 147 transitions. [2022-03-15 22:14:35,350 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:35,867 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [6778#(or (< (+ j 1) M) (<= M j)), 6777#(< j M), 6785#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 6779#(< i N), 6782#(or (< (+ 2 j) M) (<= M (+ j 1))), 6783#(or (<= N i) (< (+ i 1) N)), 6781#(or (< (+ j 1) M) (< i N) (<= M j)), 6786#(or (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 6784#(or (<= N i) (< (+ i 1) N) (< j M)), 6787#(or (<= N i) (< (+ i 1) N) (< (+ 2 j) M) (<= M (+ j 1))), 6780#(or (< j M) (< i N))] [2022-03-15 22:14:35,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:14:35,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:35,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:14:35,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:14:35,868 INFO L87 Difference]: Start difference. First operand 266 states and 938 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 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:14:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:36,126 INFO L93 Difference]: Finished difference Result 566 states and 1969 transitions. [2022-03-15 22:14:36,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 22:14:36,127 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 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:14:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:36,129 INFO L225 Difference]: With dead ends: 566 [2022-03-15 22:14:36,129 INFO L226 Difference]: Without dead ends: 556 [2022-03-15 22:14:36,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:14:36,130 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:36,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:14:36,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-03-15 22:14:36,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 391. [2022-03-15 22:14:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 3.7) internal successors, (1443), 390 states have internal predecessors, (1443), 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:14:36,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1443 transitions. [2022-03-15 22:14:36,140 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1443 transitions. Word has length 15 [2022-03-15 22:14:36,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:36,140 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 1443 transitions. [2022-03-15 22:14:36,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 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:14:36,140 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1443 transitions. [2022-03-15 22:14:36,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:14:36,141 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:36,141 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:36,157 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:14:36,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 22:14:36,349 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:14:36,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:36,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1120757048, now seen corresponding path program 6 times [2022-03-15 22:14:36,350 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:36,350 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507530187] [2022-03-15 22:14:36,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:36,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:36,385 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:14:36,385 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:36,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507530187] [2022-03-15 22:14:36,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507530187] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:36,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644436391] [2022-03-15 22:14:36,385 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:14:36,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:36,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:36,387 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:14:36,388 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:14:36,411 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:14:36,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:36,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:14:36,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:36,494 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:14:36,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:36,522 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:14:36,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644436391] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:36,522 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:36,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-03-15 22:14:36,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [146017442] [2022-03-15 22:14:36,522 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:36,523 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:36,528 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:14:36,528 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:36,970 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [8263#(or (<= N i) (< (+ i 1) N)), 8264#(or (<= N k) (< i N)), 8265#(or (<= N i) (< (+ i 1) N) (<= N k)), 8266#(or (<= N (+ i 1)) (< (+ 2 i) N)), 8267#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 8269#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 8262#(< i N), 8268#(or (<= N (+ k 1)) (< i N)), 8270#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N))] [2022-03-15 22:14:36,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 22:14:36,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:36,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 22:14:36,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:14:36,971 INFO L87 Difference]: Start difference. First operand 391 states and 1443 transitions. Second operand has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 16 states have internal predecessors, (64), 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:14:37,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:37,537 INFO L93 Difference]: Finished difference Result 1105 states and 4054 transitions. [2022-03-15 22:14:37,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 22:14:37,538 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 16 states have internal predecessors, (64), 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:14:37,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:37,543 INFO L225 Difference]: With dead ends: 1105 [2022-03-15 22:14:37,543 INFO L226 Difference]: Without dead ends: 1083 [2022-03-15 22:14:37,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=672, Invalid=2084, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 22:14:37,545 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:37,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:14:37,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2022-03-15 22:14:37,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 538. [2022-03-15 22:14:37,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 3.8603351955307263) internal successors, (2073), 537 states have internal predecessors, (2073), 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:14:37,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 2073 transitions. [2022-03-15 22:14:37,561 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 2073 transitions. Word has length 16 [2022-03-15 22:14:37,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:37,561 INFO L470 AbstractCegarLoop]: Abstraction has 538 states and 2073 transitions. [2022-03-15 22:14:37,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 16 states have internal predecessors, (64), 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:14:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 2073 transitions. [2022-03-15 22:14:37,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:14:37,563 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:37,563 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:37,581 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:14:37,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:37,775 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:14:37,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:37,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1719122434, now seen corresponding path program 7 times [2022-03-15 22:14:37,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:37,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127903239] [2022-03-15 22:14:37,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:37,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:37,814 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:14:37,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:37,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127903239] [2022-03-15 22:14:37,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127903239] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:37,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723627509] [2022-03-15 22:14:37,815 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:14:37,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:37,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:37,816 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:14:37,819 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:14:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:37,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:14:37,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:37,880 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:14:37,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:37,916 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:14:37,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723627509] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:37,917 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:37,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-03-15 22:14:37,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1144520802] [2022-03-15 22:14:37,917 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:37,918 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:37,923 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:14:37,923 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:38,828 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [10623#(or (<= N i) (< (+ i 1) N)), 10637#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N)), 10606#(or (<= k i) (< j M)), 10613#(< j M), 10616#(or (<= (+ 3 k) N) (< j M)), 10638#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)), 10614#(or (<= (+ k 1) N) (< j M)), 10621#(or (< j M) (< k N) (< i N)), 10634#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 10628#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 10631#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 10622#(or (<= (+ 2 k) N) (< j M) (< i N)), 10619#(or (<= (+ 2 k) N) (< i N)), 10629#(or (<= N i) (< (+ i 1) N) (< j M)), 10626#(or (<= N i) (< (+ i 1) N) (< k N)), 10632#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 10639#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)), 10627#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 10640#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N)), 10633#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 10624#(or (<= N (+ i 1)) (< (+ 2 i) N)), 10630#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 10615#(or (<= (+ 2 k) N) (< j M)), 10636#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N) (< j M)), 10641#(or (<= (+ 2 k) i) (< j M)), 10620#(or (< j M) (< i N)), 10618#(or (< k N) (< i N)), 10617#(< i N), 10635#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N)), 10642#(or (< j M) (<= (+ k 1) i)), 10625#(or (<= N (+ 2 i)) (< (+ 3 i) N))] [2022-03-15 22:14:38,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 22:14:38,828 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:38,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 22:14:38,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1347, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 22:14:38,829 INFO L87 Difference]: Start difference. First operand 538 states and 2073 transitions. Second operand has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 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:14:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:40,845 INFO L93 Difference]: Finished difference Result 926 states and 3223 transitions. [2022-03-15 22:14:40,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-15 22:14:40,846 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 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:14:40,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:40,849 INFO L225 Difference]: With dead ends: 926 [2022-03-15 22:14:40,850 INFO L226 Difference]: Without dead ends: 926 [2022-03-15 22:14:40,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4017 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2976, Invalid=11304, Unknown=0, NotChecked=0, Total=14280 [2022-03-15 22:14:40,852 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 460 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:40,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [460 Valid, 0 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:14:40,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-03-15 22:14:40,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 613. [2022-03-15 22:14:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 612 states have (on average 3.8676470588235294) internal successors, (2367), 612 states have internal predecessors, (2367), 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:14:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 2367 transitions. [2022-03-15 22:14:40,866 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 2367 transitions. Word has length 16 [2022-03-15 22:14:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:40,866 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 2367 transitions. [2022-03-15 22:14:40,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 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:14:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 2367 transitions. [2022-03-15 22:14:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:14:40,868 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:40,868 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:40,884 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:14:41,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 22:14:41,083 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:14:41,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:41,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1830877526, now seen corresponding path program 8 times [2022-03-15 22:14:41,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:41,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831874529] [2022-03-15 22:14:41,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:41,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:41,124 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:41,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831874529] [2022-03-15 22:14:41,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831874529] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:41,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564416176] [2022-03-15 22:14:41,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:14:41,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:41,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:41,126 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:14:41,127 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:14:41,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:14:41,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:41,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:14:41,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:14:41,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:14:41,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564416176] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:41,211 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:41,211 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 10 [2022-03-15 22:14:41,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1791533659] [2022-03-15 22:14:41,211 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:41,212 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:41,216 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 133 transitions. [2022-03-15 22:14:41,216 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:42,002 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [13054#(< j M), 13064#(or (< j M) (<= (+ N 1) i)), 13060#(or (< k N) (<= (+ 2 N) i)), 13059#(or (< j M) (<= N k) (< (+ k 1) N)), 13066#(or (< j M) (<= (+ N 1) i) (< k N)), 13062#(or (< j M) (< k N) (<= (+ 2 N) i)), 13071#(or (<= N i) (< j M)), 13047#(or (<= k i) (< j M)), 13058#(or (<= N k) (< (+ k 1) N)), 13056#(or (< j M) (< k N)), 13074#(or (<= N (+ i 1)) (< j M)), 13073#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 13063#(or (< j M) (<= N k) (< (+ k 1) N) (<= (+ 2 N) i)), 13067#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 13075#(or (< j M) (<= k (+ i 1))), 13072#(or (<= N i) (< j M) (< k N)), 13055#(< k N), 13057#(or (< j M) (<= (+ 2 N) i)), 13065#(or (<= (+ N 1) i) (< k N)), 13069#(or (<= N i) (< k N)), 13061#(or (<= N k) (< (+ k 1) N) (<= (+ 2 N) i)), 13068#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 13070#(or (<= N i) (<= N k) (< (+ k 1) N))] [2022-03-15 22:14:42,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 22:14:42,003 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:42,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 22:14:42,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=862, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:14:42,003 INFO L87 Difference]: Start difference. First operand 613 states and 2367 transitions. Second operand has 32 states, 32 states have (on average 2.96875) internal successors, (95), 31 states have internal predecessors, (95), 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:14:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:43,124 INFO L93 Difference]: Finished difference Result 1075 states and 3862 transitions. [2022-03-15 22:14:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 22:14:43,124 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.96875) internal successors, (95), 31 states have internal predecessors, (95), 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:14:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:43,129 INFO L225 Difference]: With dead ends: 1075 [2022-03-15 22:14:43,129 INFO L226 Difference]: Without dead ends: 1071 [2022-03-15 22:14:43,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1402, Invalid=4918, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 22:14:43,130 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 301 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:43,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 0 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:14:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2022-03-15 22:14:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 663. [2022-03-15 22:14:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 3.8987915407854983) internal successors, (2581), 662 states have internal predecessors, (2581), 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:14:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 2581 transitions. [2022-03-15 22:14:43,146 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 2581 transitions. Word has length 16 [2022-03-15 22:14:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:43,146 INFO L470 AbstractCegarLoop]: Abstraction has 663 states and 2581 transitions. [2022-03-15 22:14:43,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.96875) internal successors, (95), 31 states have internal predecessors, (95), 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:14:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 2581 transitions. [2022-03-15 22:14:43,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:14:43,147 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:43,147 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:43,165 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:14:43,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 22:14:43,364 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:14:43,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1755580335, now seen corresponding path program 4 times [2022-03-15 22:14:43,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:43,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448671587] [2022-03-15 22:14:43,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:43,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:43,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:43,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448671587] [2022-03-15 22:14:43,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448671587] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:43,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398130516] [2022-03-15 22:14:43,397 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:14:43,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:43,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:43,398 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:14:43,399 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:14:43,422 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:14:43,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:43,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:14:43,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:43,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:43,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398130516] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:43,494 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:43,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 22:14:43,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1791381814] [2022-03-15 22:14:43,494 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:43,495 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:43,500 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 180 transitions. [2022-03-15 22:14:43,500 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:44,619 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [15680#(or (<= N k) (< i N)), 15681#(or (< j M) (< i N)), 15696#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 15682#(or (< j M) (<= N k) (< i N)), 15687#(or (<= N i) (< (+ i 1) N) (<= N k)), 15693#(or (< (+ j 1) M) (<= i k) (<= M j)), 15684#(or (< (+ j 1) M) (<= N k) (< i N) (<= M j)), 15686#(or (< (+ j 1) M) (<= i (+ k 1)) (<= M j)), 15674#(< j M), 15683#(or (< (+ j 1) M) (< i N) (<= M j)), 15672#(or (<= N i) (< (+ i 1) N)), 15685#(or (< j M) (<= i (+ k 1))), 15678#(or (<= N (+ k 1)) (< j M)), 15675#(or (< j M) (<= N k)), 15671#(< i N), 15679#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 15673#(or (<= N (+ i 1)) (< (+ 2 i) N)), 15677#(or (< (+ j 1) M) (<= N k) (<= M j)), 15698#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= N k) (<= M j)), 15688#(or (<= N i) (< (+ i 1) N) (< j M)), 15689#(or (<= N i) (< (+ i 1) N) (< j M) (<= N k)), 15690#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 15700#(or (< (+ j 1) M) (<= (+ i 1) k) (<= M j)), 15691#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= N k) (<= M j)), 15692#(or (< j M) (<= i k)), 15676#(or (< (+ j 1) M) (<= M j)), 15697#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= N k)), 15695#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 15699#(or (<= (+ i 1) k) (< j M)), 15694#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M))] [2022-03-15 22:14:44,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 22:14:44,619 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:44,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 22:14:44,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1355, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 22:14:44,620 INFO L87 Difference]: Start difference. First operand 663 states and 2581 transitions. Second operand has 38 states, 38 states have (on average 3.236842105263158) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:48,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:48,918 INFO L93 Difference]: Finished difference Result 1641 states and 5955 transitions. [2022-03-15 22:14:48,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2022-03-15 22:14:48,918 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.236842105263158) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:14:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:48,925 INFO L225 Difference]: With dead ends: 1641 [2022-03-15 22:14:48,925 INFO L226 Difference]: Without dead ends: 1581 [2022-03-15 22:14:48,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14349 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=8481, Invalid=30921, Unknown=0, NotChecked=0, Total=39402 [2022-03-15 22:14:48,930 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 436 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:48,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 0 Invalid, 1969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 1630 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:14:48,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2022-03-15 22:14:48,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 840. [2022-03-15 22:14:48,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 839 states have (on average 4.102502979737783) internal successors, (3442), 839 states have internal predecessors, (3442), 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:14:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 3442 transitions. [2022-03-15 22:14:48,973 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 3442 transitions. Word has length 16 [2022-03-15 22:14:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:48,973 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 3442 transitions. [2022-03-15 22:14:48,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.236842105263158) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 3442 transitions. [2022-03-15 22:14:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:14:48,975 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:48,975 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:48,993 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:14:49,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 22:14:49,192 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:14:49,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:49,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1196667945, now seen corresponding path program 5 times [2022-03-15 22:14:49,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:49,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619738735] [2022-03-15 22:14:49,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:49,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:49,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:49,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:49,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619738735] [2022-03-15 22:14:49,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619738735] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:49,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735382767] [2022-03-15 22:14:49,233 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:14:49,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:49,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:49,234 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:14:49,234 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:14:49,256 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:14:49,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:49,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:14:49,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:49,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:49,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:49,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735382767] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:49,367 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:49,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 12 [2022-03-15 22:14:49,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1078438569] [2022-03-15 22:14:49,367 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:49,368 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:49,373 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 172 transitions. [2022-03-15 22:14:49,373 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:50,599 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [19468#(or (< (+ j 1) M) (< k N) (< i N) (<= M j)), 19458#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 19463#(or (<= N i) (<= k (+ i 1))), 19474#(or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 3 i) N) (<= M j)), 19472#(or (<= (+ k j) (+ M i 1)) (<= N i)), 19470#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (< k N) (<= M j)), 19460#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 19448#(or (<= N (+ i 1)) (< (+ 2 i) N)), 19449#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 19467#(or (< (+ j 1) M) (< i N) (<= M j)), 19454#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 19444#(or (< k N) (< i N)), 19471#(or (< (+ j 1) M) (<= (+ k 1) i) (<= M j)), 19465#(or (< (+ j 1) M) (< k N) (<= M j)), 19453#(or (<= N i) (< (+ i 1) N) (< j M)), 19455#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 19446#(or (<= N i) (< (+ i 1) N) (< k N)), 19464#(or (< (+ j 1) M) (<= M j)), 19469#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 19450#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 19461#(or (<= (+ 2 k) N) (< j M)), 19456#(or (<= (+ k 1) N) (< j M)), 19473#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 19447#(< j M), 19466#(or (< (+ j 1) M) (<= (+ 2 k) N) (<= M j)), 19457#(or (< j M) (< k N) (< i N)), 19476#(or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 3 i) N) (< k N) (<= M j)), 19445#(or (<= N i) (< (+ i 1) N)), 19443#(< i N), 19452#(or (< j M) (< i N)), 19451#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 19462#(or (< j M) (<= (+ k 1) i)), 19475#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (< k N) (<= M j)), 19459#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N))] [2022-03-15 22:14:50,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 22:14:50,599 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:50,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 22:14:50,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1860, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 22:14:50,600 INFO L87 Difference]: Start difference. First operand 840 states and 3442 transitions. Second operand has 42 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 41 states have internal predecessors, (125), 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:14:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:57,316 INFO L93 Difference]: Finished difference Result 2317 states and 8337 transitions. [2022-03-15 22:14:57,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2022-03-15 22:14:57,316 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 41 states have internal predecessors, (125), 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:14:57,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:57,326 INFO L225 Difference]: With dead ends: 2317 [2022-03-15 22:14:57,326 INFO L226 Difference]: Without dead ends: 2315 [2022-03-15 22:14:57,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22532 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10046, Invalid=52704, Unknown=0, NotChecked=0, Total=62750 [2022-03-15 22:14:57,330 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 903 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 1900 mSolverCounterSat, 657 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 657 IncrementalHoareTripleChecker+Valid, 1900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:57,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [903 Valid, 0 Invalid, 2557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [657 Valid, 1900 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 22:14:57,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2022-03-15 22:14:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 1231. [2022-03-15 22:14:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1230 states have (on average 4.221138211382113) internal successors, (5192), 1230 states have internal predecessors, (5192), 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:14:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 5192 transitions. [2022-03-15 22:14:57,377 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 5192 transitions. Word has length 16 [2022-03-15 22:14:57,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:57,377 INFO L470 AbstractCegarLoop]: Abstraction has 1231 states and 5192 transitions. [2022-03-15 22:14:57,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 41 states have internal predecessors, (125), 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:14:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 5192 transitions. [2022-03-15 22:14:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:14:57,381 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:57,381 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:57,402 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:14:57,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 22:14:57,587 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:14:57,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2114087282, now seen corresponding path program 6 times [2022-03-15 22:14:57,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:57,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578493592] [2022-03-15 22:14:57,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:57,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:57,614 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:14:57,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:57,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578493592] [2022-03-15 22:14:57,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578493592] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:57,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913770146] [2022-03-15 22:14:57,614 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:14:57,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:57,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:57,615 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:14:57,616 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:14:57,640 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:14:57,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:57,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:14:57,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:57,682 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:14:57,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:57,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913770146] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:57,733 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:57,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-03-15 22:14:57,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1884284831] [2022-03-15 22:14:57,733 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:57,734 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:57,740 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 189 transitions. [2022-03-15 22:14:57,740 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:58,746 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [24769#(or (< j M) (<= (+ 2 i) N)), 24771#(or (< (+ j 1) M) (< i N) (<= M j)), 24778#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 24774#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 24781#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ 2 j) M) (<= M (+ j 1))), 24767#(or (<= N i) (<= (+ 2 i) N)), 24776#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 24779#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 24775#(or (<= N i) (< (+ i 1) N) (< (+ 2 j) M) (<= M (+ j 1))), 24780#(or (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 24772#(or (< (+ 2 j) M) (<= M (+ j 1))), 24770#(or (< (+ j 1) M) (<= M j)), 24773#(or (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 24768#(or (<= N i) (< (+ i 1) N) (< j M)), 24777#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 24766#(or (< j M) (< i N)), 24765#(< j M)] [2022-03-15 22:14:58,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:14:58,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:58,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:14:58,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2022-03-15 22:14:58,747 INFO L87 Difference]: Start difference. First operand 1231 states and 5192 transitions. Second operand has 24 states, 24 states have (on average 4.041666666666667) internal successors, (97), 23 states have internal predecessors, (97), 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:14:59,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:59,250 INFO L93 Difference]: Finished difference Result 1992 states and 8238 transitions. [2022-03-15 22:14:59,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 22:14:59,250 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.041666666666667) internal successors, (97), 23 states have internal predecessors, (97), 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:14:59,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:59,260 INFO L225 Difference]: With dead ends: 1992 [2022-03-15 22:14:59,260 INFO L226 Difference]: Without dead ends: 1992 [2022-03-15 22:14:59,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=573, Invalid=1779, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 22:14:59,261 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 249 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:59,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 0 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:14:59,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2022-03-15 22:14:59,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1449. [2022-03-15 22:14:59,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1448 states have (on average 4.267955801104972) internal successors, (6180), 1448 states have internal predecessors, (6180), 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:14:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 6180 transitions. [2022-03-15 22:14:59,292 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 6180 transitions. Word has length 16 [2022-03-15 22:14:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:59,292 INFO L470 AbstractCegarLoop]: Abstraction has 1449 states and 6180 transitions. [2022-03-15 22:14:59,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.041666666666667) internal successors, (97), 23 states have internal predecessors, (97), 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:14:59,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 6180 transitions. [2022-03-15 22:14:59,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:14:59,295 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:59,295 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:59,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 22:14:59,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:59,515 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:14:59,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:59,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1753222497, now seen corresponding path program 9 times [2022-03-15 22:14:59,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:59,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62544310] [2022-03-15 22:14:59,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:59,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:00,773 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:15:00,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:00,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62544310] [2022-03-15 22:15:00,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62544310] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:00,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032873365] [2022-03-15 22:15:00,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:15:00,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:00,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:00,775 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:15:00,775 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:15:00,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:15:00,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:00,803 WARN L261 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 22:15:00,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:02,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:15:02,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:15:02,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:15:02,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:15:02,802 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:15:02,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 331 treesize of output 247 [2022-03-15 22:15:17,233 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:15:17,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:32,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:15:32,336 INFO L353 Elim1Store]: treesize reduction 24, result has 75.3 percent of original size [2022-03-15 22:15:32,337 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 5 new quantified variables, introduced 14 case distinctions, treesize of input 910 treesize of output 560 [2022-03-15 22:16:54,669 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:16:54,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032873365] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:54,670 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:54,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2022-03-15 22:16:54,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1176483698] [2022-03-15 22:16:54,670 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:54,671 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:54,677 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 173 transitions. [2022-03-15 22:16:54,677 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:17,989 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [29868#(and (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (< j M) (= (+ (select A (+ k 1)) mts3 (select A k)) 0) (<= 0 (+ (select A i) mts1))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (+ sum mts2) mts3) (< (+ 2 k) N)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (< j M) (<= 0 (select A (+ k 1))) (not (< (+ mts3 (select A k)) 0)) (= (+ (select A i) mts1 (select A (+ i 1))) 0)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (< (+ 2 i) N) (< j M) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= (+ (select A (+ k 1)) mts3 (select A k)) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (< j M) (= (+ (select A (+ k 1)) mts3 (select A k)) (select A (+ i 1))) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (< (+ mts3 (select A k)) 0)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (= (+ (select A (+ k 1)) mts3 (select A k)) (+ (select A i) mts1 (select A (+ i 1)))) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (< j M) (< (+ mts3 (select A k)) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (< j M) (= (+ (select A i) mts1 (select A (+ i 1))) 0) (<= 0 (+ (select A (+ k 1)) mts3 (select A k))) (< (+ mts3 (select A k)) 0)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (< j M) (<= (+ (select A (+ k 1)) 1) 0) (= (select A (+ k 1)) (+ (select A i) mts1 (select A (+ i 1)))) (<= 0 (+ mts3 (select A k))) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M))), 29856#(and (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (< j M) (< k N) (= (+ (select A i) mts1 (select A (+ i 1))) mts3) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (+ sum mts2) mts3) (< k N)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= mts3 0) (< k N) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N) (<= 0 (+ (select A i) mts1)) (= mts3 (select A (+ i 1))) (< (select A (+ i 1)) 0)) (or (<= N (+ i 1)) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (< j M) (= mts3 0) (< k N) (<= 0 (+ (select A i) mts1)))), 29871#(and (or (< j M) (<= (+ mts3 (select A k) 1) 0) (<= mts1 (+ mts3 (select A k)))) (or (< j M) (<= (+ mts3 (select A k)) mts1)) (or (< j M) (= mts1 0) (<= 0 (+ mts3 (select A k)))) (or (< j M) (<= (+ sum mts2) mts3)) (or (< j M) (<= (+ k 1) i))), 29844#(and (or (< (+ i 1) N) (= mts3 (+ (select A i) mts1)) (not (< i N)) (< k N) (< (+ (select A i) mts1) 0)) (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (= mts3 0) (not (< i N)) (< k N)) (or (< (+ i 1) N) (<= (+ sum mts2) mts3) (not (< i N)) (< k N))), 29873#(and (or (<= N (+ 2 i)) (<= 0 (select A (+ i 1))) (< j M) (= mts3 0) (< (+ 3 i) N) (<= 0 (+ (select A i) mts1)) (<= 0 (select A (+ 2 i)))) (or (<= N (+ 2 i)) (< j M) (<= (+ sum mts2) mts3) (< (+ 3 i) N)) (or (<= N (+ 2 i)) (< j M) (= mts3 0) (<= 0 (+ (select A (+ 2 i)) (select A (+ i 1)))) (< (+ 3 i) N) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0)) (or (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< j M) (= mts3 0) (< (+ 3 i) N) (< (+ (select A i) mts1) 0) (<= 0 (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (< j M) (< (+ (select A (+ 2 i)) (select A (+ i 1))) 0) (= (+ (select A (+ 2 i)) (select A (+ i 1))) mts3) (< (+ 3 i) N) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0)) (or (<= N (+ 2 i)) (<= 0 (select A (+ i 1))) (< j M) (= (select A (+ 2 i)) mts3) (< (+ 3 i) N) (< (select A (+ 2 i)) 0) (<= 0 (+ (select A i) mts1))) (or (<= N (+ 2 i)) (< j M) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= mts3 0) (< (+ 3 i) N) (<= 0 (select A (+ 2 i))) (< (+ (select A i) mts1) 0)) (or (< (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0) (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< j M) (< (+ 3 i) N) (= (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) mts3) (< (+ (select A i) mts1) 0)) (or (<= N (+ 2 i)) (< j M) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= (select A (+ 2 i)) mts3) (< (+ 3 i) N) (< (select A (+ 2 i)) 0) (< (+ (select A i) mts1) 0))), 29847#(and (or (< j M) (= mts3 mts1)) (or (< j M) (<= (+ sum mts2) mts3))), 29879#(and (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< j M) (<= (+ (select A (+ k 1)) 1) 0) (< (+ 3 i) N) (<= 0 (+ mts3 (select A k))) (= (select A (+ k 1)) (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (+ (select A (+ k 1)) 1) 0) (< (+ 3 i) N) (<= 0 (+ mts3 (select A k))) (< (select A (+ i 1)) 0) (= (select A (+ k 1)) (+ (select A (+ 2 i)) (select A (+ i 1))))) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< j M) (< (+ 3 i) N) (= (+ (select A (+ k 1)) mts3 (select A k)) 0) (< (+ (select A i) mts1) 0) (<= 0 (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= 0 (select A (+ i 1))) (< j M) (< (+ 3 i) N) (< (select A (+ 2 i)) 0) (<= 0 (+ (select A i) mts1)) (< (+ mts3 (select A k)) 0) (= (select A (+ 2 i)) (+ (select A (+ k 1)) mts3 (select A k)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (< (+ (select A (+ 2 i)) (select A (+ i 1))) 0) (<= 0 (select A (+ k 1))) (< (+ 3 i) N) (not (< (+ mts3 (select A k)) 0)) (= (+ (select A (+ 2 i)) (select A (+ i 1))) 0)) (or (< (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0) (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0) (<= 0 (+ (select A (+ k 1)) mts3 (select A k))) (< (+ mts3 (select A k)) 0)) (or (< (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0) (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= 0 (select A (+ k 1))) (< (+ 3 i) N) (not (< (+ mts3 (select A k)) 0)) (= (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (< (+ (select A (+ 2 i)) (select A (+ i 1))) 0) (< (+ 3 i) N) (= (+ (select A (+ 2 i)) (select A (+ i 1))) 0) (<= 0 (+ (select A (+ k 1)) mts3 (select A k))) (< (+ mts3 (select A k)) 0)) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (<= N (+ 2 i)) (< j M) (< (+ (select A (+ 2 i)) (select A (+ i 1))) 0) (= (+ (select A (+ k 1)) mts3 (select A k)) (+ (select A (+ 2 i)) (select A (+ i 1)))) (< (+ 3 i) N) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (< (+ mts3 (select A k)) 0)) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (<= N (+ 2 i)) (<= 0 (select A (+ i 1))) (< j M) (< (+ 3 i) N) (= (+ (select A (+ k 1)) mts3 (select A k)) 0) (<= 0 (+ (select A i) mts1)) (<= 0 (select A (+ 2 i)))) (or (< (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0) (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< j M) (< (+ 3 i) N) (< (+ mts3 (select A k)) 0) (< (+ (select A i) mts1) 0) (= (+ (select A (+ k 1)) mts3 (select A k)) (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (< j M) (<= (+ sum mts2) mts3) (< (+ 2 k) N) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (<= N (+ 2 i)) (< j M) (<= 0 (+ (select A (+ 2 i)) (select A (+ i 1)))) (< (+ 3 i) N) (= (+ (select A (+ k 1)) mts3 (select A k)) 0) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (< (+ 3 i) N) (< (select A (+ 2 i)) 0) (< (+ mts3 (select A k)) 0) (= (select A (+ 2 i)) (+ (select A (+ k 1)) mts3 (select A k))) (< (+ (select A i) mts1) 0)) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (<= N (+ 2 i)) (< j M) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (< (+ 3 i) N) (= (+ (select A (+ k 1)) mts3 (select A k)) 0) (<= 0 (select A (+ 2 i))) (< (+ (select A i) mts1) 0))), 29843#(and (or (<= (+ sum mts2) mts3) (< k N) (< i N)) (or (= mts3 mts1) (< k N) (< i N))), 29876#(and (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 3 i) N) (= (+ (select A (+ k 1)) mts3 (select A k)) 0) (< (+ (select A i) mts1) 0) (<= 0 (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))))) (or (< (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0) (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ 3 i) N) (= (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0) (<= 0 (+ (select A (+ k 1)) mts3 (select A k))) (< (+ mts3 (select A k)) 0)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ (select A (+ 2 i)) (select A (+ i 1))) 0) (< (+ 3 i) N) (= (+ (select A (+ 2 i)) (select A (+ i 1))) 0) (<= 0 (+ (select A (+ k 1)) mts3 (select A k))) (< (+ mts3 (select A k)) 0)) (or (< (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0) (<= (+ 3 k) N) (<= N (+ 2 i)) (<= 0 (select A (+ k 1))) (< (+ 3 i) N) (not (< (+ mts3 (select A k)) 0)) (= (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ (select A (+ 2 i)) (select A (+ i 1))) 0) (<= 0 (select A (+ k 1))) (< (+ 3 i) N) (not (< (+ mts3 (select A k)) 0)) (= (+ (select A (+ 2 i)) (select A (+ i 1))) 0)) (or (< (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0) (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 3 i) N) (< (+ mts3 (select A k)) 0) (< (+ (select A i) mts1) 0) (= (+ (select A (+ k 1)) mts3 (select A k)) (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (+ (select A (+ k 1)) 1) 0) (< (+ 3 i) N) (<= 0 (+ mts3 (select A k))) (< (select A (+ i 1)) 0) (= (select A (+ k 1)) (+ (select A (+ 2 i)) (select A (+ i 1))))) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (<= N (+ 2 i)) (<= 0 (+ (select A (+ 2 i)) (select A (+ i 1)))) (< (+ 3 i) N) (= (+ (select A (+ k 1)) mts3 (select A k)) 0) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0)) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (<= N (+ 2 i)) (<= 0 (select A (+ i 1))) (< (+ 3 i) N) (= (+ (select A (+ k 1)) mts3 (select A k)) 0) (<= 0 (+ (select A i) mts1)) (<= 0 (select A (+ 2 i)))) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (<= N (+ 2 i)) (< (+ (select A (+ 2 i)) (select A (+ i 1))) 0) (= (+ (select A (+ k 1)) mts3 (select A k)) (+ (select A (+ 2 i)) (select A (+ i 1)))) (< (+ 3 i) N) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (< (+ mts3 (select A k)) 0)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (< (+ 3 i) N) (< (select A (+ 2 i)) 0) (< (+ mts3 (select A k)) 0) (= (select A (+ 2 i)) (+ (select A (+ k 1)) mts3 (select A k))) (< (+ (select A i) mts1) 0)) (or (<= N (+ 2 i)) (<= (+ sum mts2) mts3) (< (+ 2 k) N) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (<= (+ (select A (+ k 1)) 1) 0) (< (+ 3 i) N) (<= 0 (+ mts3 (select A k))) (= (select A (+ k 1)) (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= 0 (select A (+ i 1))) (< (+ 3 i) N) (< (select A (+ 2 i)) 0) (<= 0 (+ (select A i) mts1)) (< (+ mts3 (select A k)) 0) (= (select A (+ 2 i)) (+ (select A (+ k 1)) mts3 (select A k)))) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (<= N (+ 2 i)) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (< (+ 3 i) N) (= (+ (select A (+ k 1)) mts3 (select A k)) 0) (<= 0 (select A (+ 2 i))) (< (+ (select A i) mts1) 0))), 29880#(and (or (< j M) (<= mts3 mts1)) (or (< j M) (= i 0)) (or (< j M) (<= i k)) (or (< j M) (<= mts1 mts3)) (or (<= k i) (< j M)) (or (< j M) (<= (+ sum mts2) (+ i mts3)))), 29853#(and (or (< j M) (= mts3 mts1) (< k N) (< i N)) (or (< j M) (<= (+ sum mts2) mts3) (< k N) (< i N))), 29870#(and (or (< j M) (<= (+ sum mts2) mts3) (< (+ 2 k) i)) (or (< j M) (< (+ 2 k) i) (<= (+ (select A (+ (- 1) i)) mts3 (select A k)) mts1)) (or (< j M) (= mts1 0) (<= 0 (+ mts3 (select A k))) (< (+ 2 k) i) (<= 0 (select A (+ (- 1) i)))) (or (<= (+ 2 k) i) (< j M)) (or (< j M) (<= (select A (+ (- 1) i)) mts1) (< (+ 2 k) i)) (or (< j M) (= mts1 0) (< (+ 2 k) i) (<= mts1 (+ (select A (+ (- 1) i)) mts3 (select A k))) (<= (+ mts3 (select A k) 1) 0)) (or (< j M) (= mts1 0) (<= mts1 (select A (+ (- 1) i))) (<= 0 (+ mts3 (select A k))) (< (+ 2 k) i)) (or (<= 0 (+ (select A (+ (- 1) i)) mts3 (select A k))) (< j M) (= mts1 0) (< (+ 2 k) i) (<= (+ mts3 (select A k) 1) 0))), 29859#(and (or (<= (+ 2 k) N) (< j M) (<= (+ sum mts2) mts3) (< i N) (<= (+ mts3 (select A k) 1) 0)) (or (<= (+ 2 k) N) (< j M) (= mts1 0) (<= 0 (+ mts3 (select A k))) (< i N)) (or (= (+ mts3 (select A k)) mts1) (<= (+ 2 k) N) (< j M) (< i N) (<= (+ mts3 (select A k) 1) 0)) (or (<= (+ 2 k) N) (< j M) (<= 0 (+ mts3 (select A k))) (<= (+ sum mts2 (select A k)) 0) (< i N))), 29872#(and (or (<= N (+ 2 i)) (< (+ (select A (+ 2 i)) (select A (+ i 1))) 0) (= (+ (select A (+ 2 i)) (select A (+ i 1))) mts3) (< (+ 3 i) N) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0)) (or (<= N (+ 2 i)) (= mts3 0) (<= 0 (+ (select A (+ 2 i)) (select A (+ i 1)))) (< (+ 3 i) N) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0)) (or (<= N (+ 2 i)) (<= 0 (select A (+ i 1))) (= mts3 0) (< (+ 3 i) N) (<= 0 (+ (select A i) mts1)) (<= 0 (select A (+ 2 i)))) (or (< (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0) (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 3 i) N) (= (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) mts3) (< (+ (select A i) mts1) 0)) (or (<= N (+ 2 i)) (<= 0 (select A (+ i 1))) (= (select A (+ 2 i)) mts3) (< (+ 3 i) N) (< (select A (+ 2 i)) 0) (<= 0 (+ (select A i) mts1))) (or (<= N (+ 2 i)) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= (select A (+ 2 i)) mts3) (< (+ 3 i) N) (< (select A (+ 2 i)) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ 2 i)) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= mts3 0) (< (+ 3 i) N) (<= 0 (select A (+ 2 i))) (< (+ (select A i) mts1) 0)) (or (<= N (+ 2 i)) (<= (+ sum mts2) mts3) (< (+ 3 i) N)) (or (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (= mts3 0) (< (+ 3 i) N) (< (+ (select A i) mts1) 0) (<= 0 (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1)))))), 29855#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (<= 0 (+ (select A i) mts1)) (= mts3 (select A (+ i 1))) (< (select A (+ i 1)) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ sum mts2) mts3) (< k N)) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (< k N) (= (+ (select A i) mts1 (select A (+ i 1))) mts3) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= mts3 0) (< k N) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (= mts3 0) (< k N) (<= 0 (+ (select A i) mts1)))), 29857#(and (or (<= N (+ i 1)) (= (+ mts3 (select A k)) 0) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (<= (+ 2 k) N) (<= 0 (+ (select A i) mts1)) (<= (+ mts3 (select A k) 1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (= (select A (+ i 1)) 0) (<= 0 (+ mts3 (select A k))) (< (select A (+ i 1)) 0)) (or (<= N (+ i 1)) (= (+ mts3 (select A k)) 0) (< (+ 2 i) N) (<= (+ 2 k) N) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (= (+ mts3 (select A k)) (select A (+ i 1))) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= 0 (+ mts3 (select A k))) (<= (+ sum mts2 (select A k)) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ sum mts2) mts3) (<= (+ mts3 (select A k) 1) 0)) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0) (= (+ (select A i) mts1 (select A (+ i 1))) (+ mts3 (select A k)))) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (<= (+ 2 k) N) (<= 0 (+ mts3 (select A k))) (= (+ (select A i) mts1 (select A (+ i 1))) 0))), 29849#(and (or (< (+ i 1) N) (= mts3 (+ (select A i) mts1)) (< j M) (not (< i N)) (< (+ (select A i) mts1) 0)) (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (< j M) (= mts3 0) (not (< i N))) (or (< (+ i 1) N) (< j M) (<= (+ sum mts2) mts3) (not (< i N)))), 29878#(and (or (= (+ mts3 (select A k)) 0) (<= N (+ 2 i)) (<= 0 (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (<= 0 (+ (select A i) mts1)) (<= 0 (select A (+ 2 i))) (<= (+ mts3 (select A k) 1) 0)) (or (= (+ mts3 (select A k)) 0) (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (< (+ 3 i) N) (<= 0 (select A (+ 2 i))) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ 2 i)) (<= 0 (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (< (select A (+ 2 i)) 0) (<= 0 (+ (select A i) mts1)) (<= (+ mts3 (select A k) 1) 0) (= (select A (+ 2 i)) (+ mts3 (select A k)))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ sum mts2) mts3) (< (+ 3 i) N) (<= (+ mts3 (select A k) 1) 0)) (or (< (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0) (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) (+ mts3 (select A k))) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (= (+ mts3 (select A k)) 0) (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0) (<= 0 (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ (select A (+ 2 i)) (select A (+ i 1))) 0) (< (+ 3 i) N) (= (+ (select A (+ 2 i)) (select A (+ i 1))) (+ mts3 (select A k))) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (< (+ 3 i) N) (< (select A (+ 2 i)) 0) (<= (+ mts3 (select A k) 1) 0) (= (select A (+ 2 i)) (+ mts3 (select A k))) (< (+ (select A i) mts1) 0)) (or (= (+ mts3 (select A k)) 0) (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= 0 (+ (select A (+ 2 i)) (select A (+ i 1)))) (< (+ 3 i) N) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (<= 0 (+ mts3 (select A k))) (<= (+ sum mts2 (select A k)) 0)) (or (< (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0) (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (<= 0 (+ mts3 (select A k))) (= (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) 0) (<= 0 (+ mts3 (select A k))) (< (select A (+ 2 i)) 0)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ (select A (+ 2 i)) (select A (+ i 1))) 0) (< (+ 3 i) N) (<= 0 (+ mts3 (select A k))) (= (+ (select A (+ 2 i)) (select A (+ i 1))) 0))), 29848#(and (or (< j M) (<= (+ sum mts2) mts3) (< i N)) (or (< j M) (= mts3 mts1) (< i N))), 29854#(and (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (< j M) (= mts3 0) (not (< i N)) (< k N)) (or (< (+ i 1) N) (= mts3 (+ (select A i) mts1)) (< j M) (not (< i N)) (< k N) (< (+ (select A i) mts1) 0)) (or (< (+ i 1) N) (< j M) (<= (+ sum mts2) mts3) (not (< i N)) (< k N))), 29874#(and (or (<= N (+ 2 i)) (<= 0 (select A (+ i 1))) (= mts3 0) (< (+ 3 i) N) (< k N) (<= 0 (+ (select A i) mts1)) (<= 0 (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= mts3 0) (< (+ 3 i) N) (< k N) (<= 0 (select A (+ 2 i))) (< (+ (select A i) mts1) 0)) (or (<= N (+ 2 i)) (<= (+ sum mts2) mts3) (< (+ 3 i) N) (< k N)) (or (< (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0) (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 3 i) N) (< k N) (= (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) mts3) (< (+ (select A i) mts1) 0)) (or (<= N (+ 2 i)) (< (+ (select A (+ 2 i)) (select A (+ i 1))) 0) (= (+ (select A (+ 2 i)) (select A (+ i 1))) mts3) (< (+ 3 i) N) (< k N) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0)) (or (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (= mts3 0) (< (+ 3 i) N) (< k N) (< (+ (select A i) mts1) 0) (<= 0 (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= (select A (+ 2 i)) mts3) (< (+ 3 i) N) (< k N) (< (select A (+ 2 i)) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ 2 i)) (<= 0 (select A (+ i 1))) (= (select A (+ 2 i)) mts3) (< (+ 3 i) N) (< k N) (< (select A (+ 2 i)) 0) (<= 0 (+ (select A i) mts1))) (or (<= N (+ 2 i)) (= mts3 0) (<= 0 (+ (select A (+ 2 i)) (select A (+ i 1)))) (< (+ 3 i) N) (< k N) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0))), 29841#(and (or (<= (+ sum mts2) mts3) (< i N)) (or (= mts3 mts1) (< i N))), 29851#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= mts3 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= 0 (+ (select A i) mts1)) (= mts3 (select A (+ i 1))) (< (select A (+ i 1)) 0)) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (< j M) (= (+ (select A i) mts1 (select A (+ i 1))) mts3) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (+ sum mts2) mts3)) (or (<= N (+ i 1)) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (< j M) (= mts3 0) (<= 0 (+ (select A i) mts1)))), 29861#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ sum mts2) mts3) (<= (+ mts3 (select A k) 1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= (+ mts3 (select A k)) (select A (+ i 1))) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0) (= (+ (select A i) mts1 (select A (+ i 1))) (+ mts3 (select A k)))) (or (<= N (+ i 1)) (= (+ mts3 (select A k)) 0) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= (select A (+ i 1)) 0) (<= 0 (+ mts3 (select A k))) (< (select A (+ i 1)) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= 0 (+ mts3 (select A k))) (<= (+ sum mts2 (select A k)) 0)) (or (<= N (+ i 1)) (= (+ mts3 (select A k)) 0) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= 0 (+ (select A i) mts1)) (<= (+ mts3 (select A k) 1) 0)) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= 0 (+ mts3 (select A k))) (= (+ (select A i) mts1 (select A (+ i 1))) 0))), 29860#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (= (+ mts3 (select A k)) (+ (select A i) mts1)) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (<= (+ sum mts2) mts3) (not (< i N)) (<= (+ mts3 (select A k) 1) 0)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= 0 (+ mts3 (select A k))) (<= (+ sum mts2 (select A k)) 0)) (or (= (+ mts3 (select A k)) 0) (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= (+ mts3 (select A k) 1) 0)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (= (+ (select A i) mts1) 0) (not (< i N)) (<= 0 (+ mts3 (select A k))) (< (+ (select A i) mts1) 0))), 29867#(and (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (= (+ (select A (+ k 1)) mts3 (select A k)) (select A (+ i 1))) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (< (+ mts3 (select A k)) 0)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (<= 0 (select A (+ k 1))) (not (< (+ mts3 (select A k)) 0)) (= (+ (select A i) mts1 (select A (+ i 1))) 0)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (< (+ 2 i) N) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= (+ (select A (+ k 1)) mts3 (select A k)) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ sum mts2) mts3) (< (+ 2 k) N)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (= (+ (select A (+ k 1)) mts3 (select A k)) 0) (<= 0 (+ (select A i) mts1))) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) 0) (= (select A (+ k 1)) (+ (select A i) mts1 (select A (+ i 1)))) (<= 0 (+ mts3 (select A k))) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) mts3 (select A k) 1) 0) (= (+ (select A (+ k 1)) mts3 (select A k)) (+ (select A i) mts1 (select A (+ i 1)))) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (< (+ mts3 (select A k)) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (= (+ (select A i) mts1 (select A (+ i 1))) 0) (<= 0 (+ (select A (+ k 1)) mts3 (select A k))) (< (+ mts3 (select A k)) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N))), 29842#(and (or (< (+ i 1) N) (<= (+ sum mts2) mts3) (not (< i N))) (or (< (+ i 1) N) (= mts3 (+ (select A i) mts1)) (not (< i N)) (< (+ (select A i) mts1) 0)) (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (= mts3 0) (not (< i N)))), 29858#(and (or (<= (+ 2 k) N) (< j M) (<= 0 (+ mts3 (select A k))) (<= (+ sum mts2 (select A k)) 0)) (or (<= (+ 2 k) N) (< j M) (= mts1 0) (<= 0 (+ mts3 (select A k)))) (or (= (+ mts3 (select A k)) mts1) (<= (+ 2 k) N) (< j M) (<= (+ mts3 (select A k) 1) 0)) (or (<= (+ 2 k) N) (< j M) (<= (+ sum mts2) mts3) (<= (+ mts3 (select A k) 1) 0))), 29864#(and (or (< j M) (= mts1 (select A (+ (- 1) N))) (< (+ 2 k) N) (<= 0 (+ mts3 (select A k))) (<= (+ (select A (+ (- 1) N)) 1) 0)) (or (<= 0 (select A (+ (- 1) N))) (< j M) (<= 0 (+ mts3 (select A k) (select A (+ (- 1) N)))) (= mts1 0) (< (+ 2 k) N)) (or (<= (+ 2 k) N) (< j M)) (or (= mts1 (+ mts3 (select A k) (select A (+ (- 1) N)))) (<= (+ mts3 (select A k) (select A (+ (- 1) N)) 1) 0) (< j M) (< (+ 2 k) N) (<= (+ mts3 (select A k) 1) 0)) (or (< j M) (<= (+ sum mts2) mts3) (< (+ 2 k) N))), 29863#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (= (+ (select A i) mts1) (+ mts3 (select A k) (select A (+ (- 1) N)))) (< (+ i 1) N) (<= (+ mts3 (select A k) (select A (+ (- 1) N)) 1) 0) (not (< i N)) (< (+ 2 k) N) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (<= (+ mts3 (select A k) (select A (+ (- 1) N)) 1) 0) (not (< i N)) (< (+ 2 k) N) (= 0 (+ mts3 (select A k) (select A (+ (- 1) N))))) (or (<= 0 (select A (+ (- 1) N))) (< (+ i 1) N) (<= 0 (+ mts3 (select A k) (select A (+ (- 1) N)))) (= (+ (select A i) mts1) 0) (not (< i N)) (< (+ 2 k) N) (< (+ (select A i) mts1) 0)) (or (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (<= 0 (+ mts3 (select A k))) (<= (+ (select A (+ (- 1) N)) 1) 0) (< (+ (select A i) mts1) 0) (= (+ (select A i) mts1) (select A (+ (- 1) N)))) (or (= (select A (+ (- 1) N)) 0) (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A (+ (- 1) N)) 1) 0)) (or (< (+ i 1) N) (<= (+ sum mts2) mts3) (not (< i N)) (< (+ 2 k) N))), 29869#(and (or (<= (+ 3 k) N) (< j M)) (or (<= 0 (select A (+ (- 2) N))) (< j M) (= mts1 (select A (+ (- 1) N))) (<= 0 (+ mts3 (select A k))) (< (+ 3 k) N) (<= (+ (select A (+ (- 1) N)) 1) 0)) (or (<= 0 (+ (select A (+ (- 2) N)) mts3 (select A k))) (< j M) (= mts1 (select A (+ (- 1) N))) (< (+ 3 k) N) (<= (+ mts3 (select A k) 1) 0) (<= (+ (select A (+ (- 1) N)) 1) 0)) (or (< j M) (= mts1 (+ (select A (+ (- 2) N)) mts3 (select A k) (select A (+ (- 1) N)))) (= mts1 (select A (+ (- 1) N))) (< (+ 3 k) N) (<= (+ mts3 (select A k) 1) 0) (<= (+ (select A (+ (- 1) N)) 1) 0)) (or (<= (+ (select A (+ (- 2) N)) mts3 (select A k) (select A (+ (- 1) N)) 1) 0) (< j M) (= mts1 (+ (select A (+ (- 2) N)) mts3 (select A k) (select A (+ (- 1) N)))) (<= (+ (select A (+ (- 2) N)) mts3 (select A k)) 0) (< (+ 3 k) N) (<= (+ mts3 (select A k) 1) 0)) (or (= (+ (select A (+ (- 2) N)) (select A (+ (- 1) N))) mts1) (< j M) (= mts1 (select A (+ (- 1) N))) (<= 0 (+ mts3 (select A k))) (< (+ 3 k) N) (<= (+ (select A (+ (- 1) N)) 1) 0)) (or (<= 0 (select A (+ (- 1) N))) (< j M) (= mts1 0) (<= 0 (+ (select A (+ (- 2) N)) (select A (+ (- 1) N)))) (<= 0 (+ mts3 (select A k))) (< (+ 3 k) N)) (or (<= (+ (select A (+ (- 2) N)) (select A (+ (- 1) N)) 1) 0) (<= (select A (+ (- 2) N)) 0) (= (+ (select A (+ (- 2) N)) (select A (+ (- 1) N))) mts1) (< j M) (<= 0 (+ mts3 (select A k))) (< (+ 3 k) N)) (or (< j M) (<= (+ sum mts2) mts3) (< (+ 3 k) N)) (or (<= 0 (select A (+ (- 1) N))) (<= 0 (+ (select A (+ (- 2) N)) mts3 (select A k) (select A (+ (- 1) N)))) (< j M) (= mts1 0) (< (+ 3 k) N) (<= (+ mts3 (select A k) 1) 0))), 29852#(and (or (< j M) (<= (+ sum mts2) mts3) (< k N)) (or (< j M) (= mts3 mts1) (< k N))), 29877#(and (or (<= N (+ 2 i)) (<= 0 (select A (+ i 1))) (< j M) (= (select A (+ 2 i)) mts3) (< (+ 3 i) N) (< k N) (< (select A (+ 2 i)) 0) (<= 0 (+ (select A i) mts1))) (or (<= N (+ 2 i)) (<= 0 (select A (+ i 1))) (< j M) (= mts3 0) (< (+ 3 i) N) (< k N) (<= 0 (+ (select A i) mts1)) (<= 0 (select A (+ 2 i)))) (or (< (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0) (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< j M) (< (+ 3 i) N) (< k N) (= (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) mts3) (< (+ (select A i) mts1) 0)) (or (<= N (+ 2 i)) (< j M) (<= (+ sum mts2) mts3) (< (+ 3 i) N) (< k N)) (or (<= N (+ 2 i)) (< j M) (< (+ (select A (+ 2 i)) (select A (+ i 1))) 0) (= (+ (select A (+ 2 i)) (select A (+ i 1))) mts3) (< (+ 3 i) N) (< k N) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0)) (or (<= N (+ 2 i)) (< j M) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= mts3 0) (< (+ 3 i) N) (< k N) (<= 0 (select A (+ 2 i))) (< (+ (select A i) mts1) 0)) (or (<= N (+ 2 i)) (< j M) (= mts3 0) (<= 0 (+ (select A (+ 2 i)) (select A (+ i 1)))) (< (+ 3 i) N) (< k N) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0)) (or (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< j M) (= mts3 0) (< (+ 3 i) N) (< k N) (< (+ (select A i) mts1) 0) (<= 0 (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (< j M) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= (select A (+ 2 i)) mts3) (< (+ 3 i) N) (< k N) (< (select A (+ 2 i)) 0) (< (+ (select A i) mts1) 0))), 29846#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= (+ mts3 (select A k)) (+ (select A i) mts1)) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= 0 (+ mts3 (select A k))) (<= (+ sum mts2 (select A k)) 0)) (or (= (+ mts3 (select A k)) 0) (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= (+ mts3 (select A k) 1) 0)) (or (< (+ i 1) N) (<= (+ 2 k) N) (<= (+ sum mts2) mts3) (not (< i N)) (<= (+ mts3 (select A k) 1) 0)) (or (< (+ i 1) N) (<= (+ 2 k) N) (= (+ (select A i) mts1) 0) (not (< i N)) (<= 0 (+ mts3 (select A k))) (< (+ (select A i) mts1) 0))), 29866#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< (+ 2 k) N) (<= 0 (+ mts3 (select A k))) (<= (+ (select A (+ (- 1) N)) 1) 0) (< (+ (select A i) mts1) 0) (= (+ (select A i) mts1) (select A (+ (- 1) N)))) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N))) (or (= (select A (+ (- 1) N)) 0) (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (< j M) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A (+ (- 1) N)) 1) 0)) (or (<= 0 (select A (+ (- 1) N))) (< (+ i 1) N) (< j M) (<= 0 (+ mts3 (select A k) (select A (+ (- 1) N)))) (= (+ (select A i) mts1) 0) (not (< i N)) (< (+ 2 k) N) (< (+ (select A i) mts1) 0)) (or (= (+ (select A i) mts1) (+ mts3 (select A k) (select A (+ (- 1) N)))) (< (+ i 1) N) (<= (+ mts3 (select A k) (select A (+ (- 1) N)) 1) 0) (< j M) (not (< i N)) (< (+ 2 k) N) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (not (< (+ (select A i) mts1) 0)) (< (+ i 1) N) (<= (+ mts3 (select A k) (select A (+ (- 1) N)) 1) 0) (< j M) (not (< i N)) (< (+ 2 k) N) (= 0 (+ mts3 (select A k) (select A (+ (- 1) N))))) (or (< (+ i 1) N) (< j M) (<= (+ sum mts2) mts3) (not (< i N)) (< (+ 2 k) N))), 29850#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ sum mts2) mts3)) (or (<= N (+ i 1)) (<= 0 (select A (+ i 1))) (< (+ 2 i) N) (= mts3 0) (<= 0 (+ (select A i) mts1))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= 0 (+ (select A i) mts1)) (= mts3 (select A (+ i 1))) (< (select A (+ i 1)) 0)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (= mts3 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ i 1)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (< (+ 2 i) N) (= (+ (select A i) mts1 (select A (+ i 1))) mts3) (< (+ (select A i) mts1) 0))), 29875#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) 0) (<= 0 (+ mts3 (select A k))) (< (select A (+ 2 i)) 0)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ (select A (+ 2 i)) (select A (+ i 1))) 0) (< (+ 3 i) N) (= (+ (select A (+ 2 i)) (select A (+ i 1))) (+ mts3 (select A k))) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ (select A (+ 2 i)) (select A (+ i 1))) 0) (< (+ 3 i) N) (<= 0 (+ mts3 (select A k))) (= (+ (select A (+ 2 i)) (select A (+ i 1))) 0)) (or (< (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0) (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (<= (+ 2 k) N) (< (+ 3 i) N) (= (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) (+ mts3 (select A k))) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (= (+ mts3 (select A k)) 0) (<= N (+ 2 i)) (<= (+ 2 k) N) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (< (+ 3 i) N) (<= 0 (select A (+ 2 i))) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= 0 (+ (select A i) mts1 (select A (+ i 1)))) (< (+ 3 i) N) (< (select A (+ 2 i)) 0) (<= (+ mts3 (select A k) 1) 0) (= (select A (+ 2 i)) (+ mts3 (select A k))) (< (+ (select A i) mts1) 0)) (or (<= N (+ 2 i)) (<= 0 (select A (+ i 1))) (<= (+ 2 k) N) (< (+ 3 i) N) (< (select A (+ 2 i)) 0) (<= 0 (+ (select A i) mts1)) (<= (+ mts3 (select A k) 1) 0) (= (select A (+ 2 i)) (+ mts3 (select A k)))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (<= 0 (+ mts3 (select A k))) (<= (+ sum mts2 (select A k)) 0)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ sum mts2) mts3) (< (+ 3 i) N) (<= (+ mts3 (select A k) 1) 0)) (or (= (+ mts3 (select A k)) 0) (<= N (+ 2 i)) (<= (+ 2 k) N) (<= 0 (+ (select A (+ 2 i)) (select A (+ i 1)))) (< (+ 3 i) N) (<= 0 (+ (select A i) mts1)) (< (select A (+ i 1)) 0) (<= (+ mts3 (select A k) 1) 0)) (or (= (+ mts3 (select A k)) 0) (<= N (+ 2 i)) (< (+ (select A i) mts1 (select A (+ i 1))) 0) (<= (+ 2 k) N) (< (+ 3 i) N) (<= (+ mts3 (select A k) 1) 0) (< (+ (select A i) mts1) 0) (<= 0 (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))))) (or (< (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0) (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (<= 0 (+ mts3 (select A k))) (= (+ (select A i) (select A (+ 2 i)) mts1 (select A (+ i 1))) 0)) (or (= (+ mts3 (select A k)) 0) (<= N (+ 2 i)) (<= 0 (select A (+ i 1))) (<= (+ 2 k) N) (< (+ 3 i) N) (<= 0 (+ (select A i) mts1)) (<= 0 (select A (+ 2 i))) (<= (+ mts3 (select A k) 1) 0))), 29865#(and (or (<= 0 (select A (+ (- 1) N))) (< j M) (<= 0 (+ mts3 (select A k) (select A (+ (- 1) N)))) (= mts1 0) (< (+ 2 k) N) (< i N)) (or (= mts1 (+ mts3 (select A k) (select A (+ (- 1) N)))) (<= (+ mts3 (select A k) (select A (+ (- 1) N)) 1) 0) (< j M) (< (+ 2 k) N) (< i N) (<= (+ mts3 (select A k) 1) 0)) (or (<= (+ 2 k) N) (< j M) (< i N)) (or (< j M) (= mts1 (select A (+ (- 1) N))) (< (+ 2 k) N) (<= 0 (+ mts3 (select A k))) (< i N) (<= (+ (select A (+ (- 1) N)) 1) 0)) (or (< j M) (<= (+ sum mts2) mts3) (< (+ 2 k) N) (< i N))), 29862#(and (or (<= (+ 2 k) N) (< i N)) (or (<= (+ sum mts2) mts3) (< (+ 2 k) N) (< i N)) (or (<= 0 (select A (+ (- 1) N))) (<= 0 (+ mts3 (select A k) (select A (+ (- 1) N)))) (= mts1 0) (< (+ 2 k) N) (< i N)) (or (= mts1 (select A (+ (- 1) N))) (< (+ 2 k) N) (<= 0 (+ mts3 (select A k))) (< i N) (<= (+ (select A (+ (- 1) N)) 1) 0)) (or (= mts1 (+ mts3 (select A k) (select A (+ (- 1) N)))) (<= (+ mts3 (select A k) (select A (+ (- 1) N)) 1) 0) (< (+ 2 k) N) (< i N) (<= (+ mts3 (select A k) 1) 0))), 29845#(and (or (= (+ mts3 (select A k)) mts1) (<= (+ 2 k) N) (< i N) (<= (+ mts3 (select A k) 1) 0)) (or (<= (+ 2 k) N) (= mts1 0) (<= 0 (+ mts3 (select A k))) (< i N)) (or (<= (+ 2 k) N) (<= 0 (+ mts3 (select A k))) (<= (+ sum mts2 (select A k)) 0) (< i N)) (or (<= (+ 2 k) N) (<= (+ sum mts2) mts3) (< i N) (<= (+ mts3 (select A k) 1) 0)))] [2022-03-15 22:17:17,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 22:17:17,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:17,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 22:17:17,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=4430, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 22:17:17,990 INFO L87 Difference]: Start difference. First operand 1449 states and 6180 transitions. Second operand has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 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:18:50,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:50,350 INFO L93 Difference]: Finished difference Result 2387 states and 9098 transitions. [2022-03-15 22:18:50,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2022-03-15 22:18:50,351 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 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 17 [2022-03-15 22:18:50,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:50,361 INFO L225 Difference]: With dead ends: 2387 [2022-03-15 22:18:50,361 INFO L226 Difference]: Without dead ends: 2357 [2022-03-15 22:18:50,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 29 SyntacticMatches, 9 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17180 ImplicationChecksByTransitivity, 95.5s TimeCoverageRelationStatistics Valid=6805, Invalid=44497, Unknown=0, NotChecked=0, Total=51302 [2022-03-15 22:18:50,364 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 825 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:50,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [825 Valid, 0 Invalid, 2703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 22:18:50,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2022-03-15 22:18:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 1540. [2022-03-15 22:18:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1539 states have (on average 4.2631578947368425) internal successors, (6561), 1539 states have internal predecessors, (6561), 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:18:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 6561 transitions. [2022-03-15 22:18:50,401 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 6561 transitions. Word has length 17 [2022-03-15 22:18:50,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:50,401 INFO L470 AbstractCegarLoop]: Abstraction has 1540 states and 6561 transitions. [2022-03-15 22:18:50,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 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:18:50,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 6561 transitions. [2022-03-15 22:18:50,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:50,406 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:50,406 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:50,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:50,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 22:18:50,622 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:18:50,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:50,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1575392283, now seen corresponding path program 10 times [2022-03-15 22:18:50,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:50,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427991915] [2022-03-15 22:18:50,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:50,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:50,656 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:50,656 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:50,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427991915] [2022-03-15 22:18:50,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427991915] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:50,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712373057] [2022-03-15 22:18:50,656 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:18:50,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:50,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:50,657 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:18:50,658 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:18:50,688 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:18:50,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:50,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:18:50,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:50,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:50,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712373057] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:50,774 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:50,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 22:18:50,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [161871294] [2022-03-15 22:18:50,775 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:50,775 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:50,782 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:18:50,782 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:51,920 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [35778#(or (<= N (+ i 1)) (< (+ 2 i) N)), 35794#(or (< j M) (<= k (+ 2 i))), 35789#(or (<= N (+ k 1)) (<= (+ 2 k) i) (< j M)), 35774#(or (<= N i) (< (+ i 1) N)), 35790#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 35761#(or (< j M) (<= k (+ i 1))), 35785#(or (<= N (+ k 1)) (<= (+ 3 k) i)), 35772#(< j M), 35781#(or (<= (+ 3 k) N) (< j M) (<= N k)), 35795#(or (<= k i) (<= N k)), 35798#(or (<= N (+ k 1)) (< j M) (<= (+ k 1) i)), 35782#(or (<= (+ 2 k) i) (< j M) (<= N k)), 35784#(or (<= N (+ k 1)) (<= (+ k 4) N)), 35783#(or (< j M) (<= (+ k 1) i) (<= N k)), 35775#(or (<= N i) (< (+ i 1) N) (< j M)), 35771#(< i N), 35792#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 35793#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 35777#(or (< j M) (<= (+ k 1) i)), 35796#(or (<= N (+ k 1)) (<= (+ k 1) i)), 35780#(or (<= k i) (< j M)), 35786#(or (<= N (+ k 1)) (< j M) (<= (+ k 4) N)), 35788#(or (<= N (+ k 1)) (<= (+ 2 k) i)), 35791#(or (< (+ i 4) N) (<= N (+ 3 i))), 35768#(or (<= (+ 3 k) N) (<= N k)), 35776#(or (<= (+ 2 k) N) (< j M)), 35769#(or (<= (+ 2 k) i) (<= N k)), 35770#(or (<= (+ k 1) i) (<= N k)), 35779#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 35773#(or (< j M) (< i N)), 35797#(or (<= k i) (< j M) (<= N k)), 35787#(or (<= N (+ k 1)) (<= (+ 3 k) i) (< j M))] [2022-03-15 22:18:51,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 22:18:51,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:51,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 22:18:51,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1616, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:18:51,921 INFO L87 Difference]: Start difference. First operand 1540 states and 6561 transitions. Second operand has 40 states, 40 states have (on average 3.1) internal successors, (124), 39 states have internal predecessors, (124), 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:18:56,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:56,897 INFO L93 Difference]: Finished difference Result 2819 states and 10813 transitions. [2022-03-15 22:18:56,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-03-15 22:18:56,898 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.1) internal successors, (124), 39 states have internal predecessors, (124), 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:18:56,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:56,906 INFO L225 Difference]: With dead ends: 2819 [2022-03-15 22:18:56,906 INFO L226 Difference]: Without dead ends: 2819 [2022-03-15 22:18:56,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6218 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4032, Invalid=17724, Unknown=0, NotChecked=0, Total=21756 [2022-03-15 22:18:56,908 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 881 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:56,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [881 Valid, 0 Invalid, 2457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:18:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2022-03-15 22:18:56,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 1712. [2022-03-15 22:18:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1711 states have (on average 4.26125073056692) internal successors, (7291), 1711 states have internal predecessors, (7291), 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:18:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 7291 transitions. [2022-03-15 22:18:56,953 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 7291 transitions. Word has length 17 [2022-03-15 22:18:56,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:56,953 INFO L470 AbstractCegarLoop]: Abstraction has 1712 states and 7291 transitions. [2022-03-15 22:18:56,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.1) internal successors, (124), 39 states have internal predecessors, (124), 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:18:56,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 7291 transitions. [2022-03-15 22:18:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:56,957 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:56,957 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:56,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:57,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 22:18:57,173 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:18:57,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:57,174 INFO L85 PathProgramCache]: Analyzing trace with hash -43468756, now seen corresponding path program 7 times [2022-03-15 22:18:57,174 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:57,174 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604696677] [2022-03-15 22:18:57,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:57,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:57,925 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:18:57,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:57,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604696677] [2022-03-15 22:18:57,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604696677] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:57,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780385046] [2022-03-15 22:18:57,926 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:18:57,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:57,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:57,927 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:57,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 22:18:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:57,953 WARN L261 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 22:18:57,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:58,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:58,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:58,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:58,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:58,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:58,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:58,903 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 261 treesize of output 173 [2022-03-15 22:18:59,173 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:18:59,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:02,166 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 22:19:02,167 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 1487 treesize of output 899 Received shutdown request... [2022-03-15 22:24:47,224 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 22:24:47,226 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:24:47,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 22:24:47,246 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:24:47,246 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:24:47,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:47,430 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 7ms.. [2022-03-15 22:24:47,431 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:24:47,431 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:24:47,431 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:24:47,432 INFO L732 BasicCegarLoop]: Path program histogram: [10, 7, 1, 1] [2022-03-15 22:24:47,434 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:24:47,434 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:24:47,435 INFO L202 PluginConnector]: Adding new model mts-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:24:47 BasicIcfg [2022-03-15 22:24:47,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:24:47,436 INFO L158 Benchmark]: Toolchain (without parser) took 803593.59ms. Allocated memory was 210.8MB in the beginning and 621.8MB in the end (delta: 411.0MB). Free memory was 169.0MB in the beginning and 373.6MB in the end (delta: -204.6MB). Peak memory consumption was 428.3MB. Max. memory is 8.0GB. [2022-03-15 22:24:47,436 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 210.8MB. Free memory is still 170.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:24:47,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.22ms. Allocated memory is still 210.8MB. Free memory was 169.0MB in the beginning and 167.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 22:24:47,436 INFO L158 Benchmark]: Boogie Preprocessor took 22.70ms. Allocated memory is still 210.8MB. Free memory was 167.4MB in the beginning and 166.5MB in the end (delta: 901.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:24:47,436 INFO L158 Benchmark]: RCFGBuilder took 215.59ms. Allocated memory is still 210.8MB. Free memory was 166.3MB in the beginning and 156.8MB in the end (delta: 9.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:24:47,436 INFO L158 Benchmark]: TraceAbstraction took 803329.33ms. Allocated memory was 210.8MB in the beginning and 621.8MB in the end (delta: 411.0MB). Free memory was 156.3MB in the beginning and 373.6MB in the end (delta: -217.3MB). Peak memory consumption was 415.7MB. Max. memory is 8.0GB. [2022-03-15 22:24:47,437 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.10ms. Allocated memory is still 210.8MB. Free memory is still 170.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.22ms. Allocated memory is still 210.8MB. Free memory was 169.0MB in the beginning and 167.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.70ms. Allocated memory is still 210.8MB. Free memory was 167.4MB in the beginning and 166.5MB in the end (delta: 901.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 215.59ms. Allocated memory is still 210.8MB. Free memory was 166.3MB in the beginning and 156.8MB in the end (delta: 9.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 803329.33ms. Allocated memory was 210.8MB in the beginning and 621.8MB in the end (delta: 411.0MB). Free memory was 156.3MB in the beginning and 373.6MB in the end (delta: -217.3MB). Peak memory consumption was 415.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 36 PlacesBefore, 25 PlacesAfterwards, 29 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 3 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 124, positive: 124, positive conditional: 0, positive unconditional: 124, 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: 64, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 124, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 64, unknown conditional: 0, unknown unconditional: 64] , 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: 68]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 7ms.. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 7ms.. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 7ms.. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 7ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 42 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 803.2s, OverallIterations: 19, TraceHistogramMax: 4, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 174.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5979 SdHoareTripleChecker+Valid, 11.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5979 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4522 mSDsCounter, 2703 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17511 IncrementalHoareTripleChecker+Invalid, 20214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2703 mSolverCounterUnsat, 0 mSDtfsCounter, 17511 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2492 GetRequests, 845 SyntacticMatches, 64 SemanticMatches, 1583 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 78519 ImplicationChecksByTransitivity, 176.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1712occurred in iteration=18, InterpolantAutomatonStates: 1268, 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, 7169 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 216.6s InterpolantComputationTime, 513 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 708 ConstructedInterpolants, 19 QuantifiedInterpolants, 21740 SizeOfPredicates, 56 NumberOfNonLiveVariables, 1131 ConjunctsInSsa, 223 ConjunctsInUnsatCore, 50 InterpolantComputations, 2 PerfectInterpolantSequences, 136/337 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