/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-fun-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:03:41,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:03:41,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:03:41,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:03:41,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:03:41,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:03:41,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:03:41,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:03:41,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:03:41,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:03:41,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:03:41,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:03:41,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:03:41,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:03:41,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:03:41,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:03:41,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:03:41,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:03:41,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:03:41,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:03:41,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:03:41,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:03:41,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:03:41,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:03:41,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:03:41,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:03:41,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:03:41,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:03:41,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:03:41,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:03:41,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:03:41,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:03:41,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:03:41,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:03:41,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:03:41,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:03:41,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:03:41,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:03:41,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:03:41,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:03:41,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:03:41,366 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:03:41,387 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:03:41,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:03:41,388 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:03:41,388 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:03:41,388 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:03:41,388 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:03:41,389 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:03:41,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:03:41,389 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:03:41,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:03:41,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:03:41,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:03:41,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:03:41,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:03:41,390 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:03:41,390 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:03:41,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:03:41,390 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:03:41,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:03:41,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:03:41,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:03:41,391 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:03:41,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:03:41,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:03:41,391 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:03:41,391 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:03:41,391 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:03:41,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:03:41,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:03:41,392 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:03:41,392 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:03:41,392 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:03:41,392 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:03:41,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:03:41,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:03:41,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:03:41,637 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:03:41,638 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:03:41,639 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-fun-alt.wvr.bpl [2022-03-15 22:03:41,639 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-fun-alt.wvr.bpl' [2022-03-15 22:03:41,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:03:41,666 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:03:41,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:03:41,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:03:41,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:03:41,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:03:41" (1/1) ... [2022-03-15 22:03:41,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:03:41" (1/1) ... [2022-03-15 22:03:41,687 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:03:41,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:03:41,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:03:41,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:03:41,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:03:41,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:03:41" (1/1) ... [2022-03-15 22:03:41,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:03:41" (1/1) ... [2022-03-15 22:03:41,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:03:41" (1/1) ... [2022-03-15 22:03:41,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:03:41" (1/1) ... [2022-03-15 22:03:41,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:03:41" (1/1) ... [2022-03-15 22:03:41,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:03:41" (1/1) ... [2022-03-15 22:03:41,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:03:41" (1/1) ... [2022-03-15 22:03:41,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:03:41,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:03:41,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:03:41,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:03:41,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:03:41" (1/1) ... [2022-03-15 22:03:41,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:03:41,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:41,744 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:03:41,763 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:03:41,787 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:03:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:03:41,787 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:03:41,788 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:03:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:03:41,788 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:03:41,788 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:03:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:03:41,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:03:41,788 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 22:03:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 22:03:41,788 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 22:03:41,789 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:03:41,829 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:03:41,831 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:03:41,959 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:03:41,976 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:03:41,977 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:03:41,980 INFO L202 PluginConnector]: Adding new model max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:03:41 BoogieIcfgContainer [2022-03-15 22:03:41,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:03:41,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:03:41,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:03:41,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:03:41,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:03:41" (1/2) ... [2022-03-15 22:03:41,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb457e and model type max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:03:41, skipping insertion in model container [2022-03-15 22:03:41,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:03:41" (2/2) ... [2022-03-15 22:03:41,990 INFO L111 eAbstractionObserver]: Analyzing ICFG max-fun-alt.wvr.bpl [2022-03-15 22:03:41,997 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:03:41,997 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:03:41,997 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:03:41,997 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:03:42,050 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 22:03:42,098 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:03:42,107 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:03:42,107 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 22:03:42,120 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:03:42,132 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:03:42,135 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:03:42,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 82 flow [2022-03-15 22:03:42,166 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2022-03-15 22:03:42,166 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 22:03:42,170 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 33 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:03:42,171 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 22:03:42,455 INFO L131 LiptonReduction]: Checked pairs total: 106 [2022-03-15 22:03:42,456 INFO L133 LiptonReduction]: Total number of compositions: 12 [2022-03-15 22:03:42,462 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 22:03:42,483 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:03:42,485 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:03:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:03:42,491 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:42,492 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:42,492 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:03:42,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1022751962, now seen corresponding path program 1 times [2022-03-15 22:03:42,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:42,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563592939] [2022-03-15 22:03:42,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:42,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:42,621 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:03:42,621 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:42,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563592939] [2022-03-15 22:03:42,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563592939] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:03:42,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:03:42,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 22:03:42,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [361266101] [2022-03-15 22:03:42,624 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:42,628 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:42,643 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 22:03:42,643 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:42,930 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:03:42,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:03:42,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:42,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:03:42,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:03:42,950 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:42,989 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 22:03:42,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:03:42,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 22:03:42,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:43,001 INFO L225 Difference]: With dead ends: 45 [2022-03-15 22:03:43,002 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 22:03:43,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:03:43,009 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:43,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:03:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 22:03:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 22:03:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.7) internal successors, (108), 40 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 22:03:43,051 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 22:03:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:43,051 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 22:03:43,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 22:03:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:03:43,054 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:43,054 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:43,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:03:43,054 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:03:43,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:43,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1617420820, now seen corresponding path program 1 times [2022-03-15 22:03:43,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:43,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400712570] [2022-03-15 22:03:43,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:43,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:43,106 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:03:43,106 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:43,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400712570] [2022-03-15 22:03:43,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400712570] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:03:43,107 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:03:43,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:03:43,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1708292733] [2022-03-15 22:03:43,107 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:43,108 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:43,113 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:03:43,113 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:43,366 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:03:43,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:03:43,373 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:43,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:03:43,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:03:43,374 INFO L87 Difference]: Start difference. First operand 41 states and 108 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:03:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:43,410 INFO L93 Difference]: Finished difference Result 44 states and 116 transitions. [2022-03-15 22:03:43,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:03:43,410 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:03:43,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:43,412 INFO L225 Difference]: With dead ends: 44 [2022-03-15 22:03:43,412 INFO L226 Difference]: Without dead ends: 44 [2022-03-15 22:03:43,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:03:43,414 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:03:43,415 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:03:43,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-15 22:03:43,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2022-03-15 22:03:43,426 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:03:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-03-15 22:03:43,430 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 80 transitions. Word has length 12 [2022-03-15 22:03:43,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:43,431 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 80 transitions. [2022-03-15 22:03:43,431 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:03:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 80 transitions. [2022-03-15 22:03:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:03:43,434 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:43,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:43,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:03:43,440 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:03:43,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:43,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1327324498, now seen corresponding path program 1 times [2022-03-15 22:03:43,442 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:43,442 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562770778] [2022-03-15 22:03:43,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:43,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:43,528 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:03:43,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:43,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562770778] [2022-03-15 22:03:43,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562770778] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:03:43,529 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:03:43,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:03:43,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [278240920] [2022-03-15 22:03:43,529 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:43,530 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:43,534 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:03:43,534 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:43,687 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:03:43,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 22:03:43,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:43,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 22:03:43,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:03:43,688 INFO L87 Difference]: Start difference. First operand 31 states and 80 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:43,730 INFO L93 Difference]: Finished difference Result 48 states and 130 transitions. [2022-03-15 22:03:43,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:03:43,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 22:03:43,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:43,732 INFO L225 Difference]: With dead ends: 48 [2022-03-15 22:03:43,732 INFO L226 Difference]: Without dead ends: 48 [2022-03-15 22:03:43,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:03:43,733 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:43,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:03:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-15 22:03:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2022-03-15 22:03:43,738 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:03:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 106 transitions. [2022-03-15 22:03:43,739 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 106 transitions. Word has length 12 [2022-03-15 22:03:43,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:43,739 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 106 transitions. [2022-03-15 22:03:43,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 106 transitions. [2022-03-15 22:03:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:03:43,740 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:43,740 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:43,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 22:03:43,741 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:03:43,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:43,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1745317284, now seen corresponding path program 1 times [2022-03-15 22:03:43,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:43,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481946060] [2022-03-15 22:03:43,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:43,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:43,918 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:03:43,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:43,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481946060] [2022-03-15 22:03:43,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481946060] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:43,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866112532] [2022-03-15 22:03:43,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:43,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:43,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:43,923 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:03:43,932 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:03:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:43,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 22:03:43,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:44,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-03-15 22:03:44,335 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:03:44,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:44,435 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:03:44,435 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 47 treesize of output 43 [2022-03-15 22:03:44,582 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:03:44,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866112532] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:44,585 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:44,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-03-15 22:03:44,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1795980002] [2022-03-15 22:03:44,586 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:44,587 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:44,591 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 22:03:44,591 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:45,566 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [543#(and (or (< j M) (<= (+ max2 1) (select A k)) (= max2 max1)) (or (= max1 (select A k)) (< j M) (<= (select A k) max2)) (or (< j M) (= k 0))), 545#(and (or (< j M) (not (< max1 (select A i))) (= (select A i) max2)) (or (< j M) (< max1 (select A i)) (= max2 max1))), 544#(and (or (not (< max1 (select A i))) (= (select A i) max2)) (or (< max1 (select A i)) (= max2 max1))), 546#(and (or (< j M) (= max2 max1)) (or (< j M) (= (+ i (* (- 1) max2)) 0)) (or (< j M) (= k 0)) (or (< j M) (= max1 0))), 542#(or (< j M) (= max2 max1))] [2022-03-15 22:03:45,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:03:45,567 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:45,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:03:45,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:03:45,568 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:03:45,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:45,863 INFO L93 Difference]: Finished difference Result 76 states and 207 transitions. [2022-03-15 22:03:45,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:03:45,864 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:03:45,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:45,865 INFO L225 Difference]: With dead ends: 76 [2022-03-15 22:03:45,865 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 22:03:45,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:03:45,866 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:45,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:03:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 22:03:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-03-15 22:03:45,876 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:03:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 192 transitions. [2022-03-15 22:03:45,876 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 192 transitions. Word has length 13 [2022-03-15 22:03:45,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:45,877 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 192 transitions. [2022-03-15 22:03:45,877 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:03:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 192 transitions. [2022-03-15 22:03:45,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:03:45,879 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:45,879 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:45,904 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:03:46,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:46,080 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:03:46,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:46,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1818191762, now seen corresponding path program 2 times [2022-03-15 22:03:46,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:46,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764485254] [2022-03-15 22:03:46,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:46,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:46,138 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:03:46,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:46,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764485254] [2022-03-15 22:03:46,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764485254] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:46,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053386550] [2022-03-15 22:03:46,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:03:46,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:46,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:46,140 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:03:46,142 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:03:46,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:03:46,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:46,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:03:46,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:46,230 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:03:46,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:46,277 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:03:46,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053386550] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:46,278 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:46,278 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-03-15 22:03:46,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1985185110] [2022-03-15 22:03:46,278 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:46,279 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:46,284 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:03:46,284 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:46,933 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [851#(or (<= N i) (< (+ i 1) N)), 843#(or (<= k i) (< j M)), 865#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 862#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 852#(or (<= N (+ i 1)) (< (+ 2 i) N)), 864#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 860#(or (< j M) (< k N) (< i N)), 850#(< i N), 853#(< j M), 861#(or (<= N i) (< (+ i 1) N) (< k N)), 855#(or (<= N i) (< (+ i 1) N) (< j M)), 859#(or (< k N) (< i N)), 863#(or (< j M) (<= (+ k 1) i)), 856#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 854#(or (< j M) (< i N)), 857#(or (<= (+ k 1) N) (< j M)), 858#(or (<= (+ 2 k) N) (< j M))] [2022-03-15 22:03:46,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:03:46,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:46,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:03:46,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:03:46,935 INFO L87 Difference]: Start difference. First operand 68 states and 192 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:03:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:48,028 INFO L93 Difference]: Finished difference Result 171 states and 489 transitions. [2022-03-15 22:03:48,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 22:03:48,029 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:03:48,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:48,032 INFO L225 Difference]: With dead ends: 171 [2022-03-15 22:03:48,032 INFO L226 Difference]: Without dead ends: 171 [2022-03-15 22:03:48,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=737, Invalid=2569, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:03:48,035 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 164 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:48,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 0 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:03:48,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-03-15 22:03:48,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 98. [2022-03-15 22:03:48,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 3.2989690721649483) internal successors, (320), 97 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 320 transitions. [2022-03-15 22:03:48,049 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 320 transitions. Word has length 14 [2022-03-15 22:03:48,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:48,049 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 320 transitions. [2022-03-15 22:03:48,050 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:03:48,050 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 320 transitions. [2022-03-15 22:03:48,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:03:48,051 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:48,051 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:48,075 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:03:48,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:48,251 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:03:48,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:48,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1729849712, now seen corresponding path program 3 times [2022-03-15 22:03:48,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:48,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997348780] [2022-03-15 22:03:48,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:48,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:48,319 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:03:48,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:48,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997348780] [2022-03-15 22:03:48,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997348780] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:48,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517908999] [2022-03-15 22:03:48,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:03:48,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:48,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:48,321 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:03:48,330 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:03:48,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:03:48,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:48,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:03:48,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:48,452 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:03:48,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:48,483 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:03:48,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517908999] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:48,484 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:48,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-03-15 22:03:48,484 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1619348763] [2022-03-15 22:03:48,484 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:48,486 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:48,489 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:03:48,490 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:48,814 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1389#(or (<= N k) (< i N)), 1391#(or (<= N i) (< (+ i 1) N) (<= N k)), 1388#(< i N), 1390#(or (<= N i) (< (+ i 1) N))] [2022-03-15 22:03:48,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:03:48,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:48,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:03:48,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-03-15 22:03:48,815 INFO L87 Difference]: Start difference. First operand 98 states and 320 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:49,187 INFO L93 Difference]: Finished difference Result 216 states and 644 transitions. [2022-03-15 22:03:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 22:03:49,187 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:03:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:49,189 INFO L225 Difference]: With dead ends: 216 [2022-03-15 22:03:49,189 INFO L226 Difference]: Without dead ends: 206 [2022-03-15 22:03:49,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=772, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:03:49,190 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:49,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:03:49,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-03-15 22:03:49,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 150. [2022-03-15 22:03:49,200 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:03:49,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 497 transitions. [2022-03-15 22:03:49,201 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 497 transitions. Word has length 14 [2022-03-15 22:03:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:49,201 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 497 transitions. [2022-03-15 22:03:49,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 497 transitions. [2022-03-15 22:03:49,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:03:49,203 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:49,203 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:49,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 22:03:49,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:49,417 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:03:49,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:49,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1144577720, now seen corresponding path program 1 times [2022-03-15 22:03:49,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:49,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630044045] [2022-03-15 22:03:49,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:49,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:49,461 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:03:49,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:49,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630044045] [2022-03-15 22:03:49,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630044045] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:49,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847468683] [2022-03-15 22:03:49,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:49,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:49,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:49,463 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:03:49,494 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:03:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:49,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:03:49,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:49,541 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:03:49,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:49,581 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:03:49,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847468683] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:49,581 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:49,581 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-03-15 22:03:49,581 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [199110017] [2022-03-15 22:03:49,581 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:49,583 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:49,587 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 88 transitions. [2022-03-15 22:03:49,587 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:49,906 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [2034#(or (<= N i) (< (+ i 1) N) (< j M)), 2030#(or (< j M) (< i N)), 2031#(or (< (+ j 1) M) (<= M j)), 2029#(< j M), 2033#(or (<= N i) (<= (+ 2 i) N)), 2032#(or (< (+ j 1) M) (< i N) (<= M j))] [2022-03-15 22:03:49,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:03:49,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:49,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:03:49,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-15 22:03:49,908 INFO L87 Difference]: Start difference. First operand 150 states and 497 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:50,100 INFO L93 Difference]: Finished difference Result 204 states and 669 transitions. [2022-03-15 22:03:50,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 22:03:50,101 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 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:03:50,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:50,102 INFO L225 Difference]: With dead ends: 204 [2022-03-15 22:03:50,102 INFO L226 Difference]: Without dead ends: 204 [2022-03-15 22:03:50,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:03:50,103 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:50,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:03:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-03-15 22:03:50,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 164. [2022-03-15 22:03:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 3.312883435582822) internal successors, (540), 163 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 540 transitions. [2022-03-15 22:03:50,115 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 540 transitions. Word has length 14 [2022-03-15 22:03:50,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:50,115 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 540 transitions. [2022-03-15 22:03:50,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:50,115 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 540 transitions. [2022-03-15 22:03:50,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:03:50,120 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:50,120 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:50,145 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:03:50,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:50,339 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:03:50,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:50,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1863769352, now seen corresponding path program 2 times [2022-03-15 22:03:50,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:50,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052978576] [2022-03-15 22:03:50,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:50,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:50,400 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:50,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052978576] [2022-03-15 22:03:50,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052978576] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:50,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088194529] [2022-03-15 22:03:50,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:03:50,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:50,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:50,401 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:03:50,403 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:03:50,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:03:50,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:50,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:03:50,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:50,477 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:03:50,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:50,521 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:03:50,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088194529] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:50,522 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:50,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-03-15 22:03:50,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [911425943] [2022-03-15 22:03:50,522 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:50,524 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:50,528 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 70 transitions. [2022-03-15 22:03:50,528 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:50,803 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [2667#(or (< j M) (< i N)), 2668#(or (< (+ j 1) M) (< i N) (<= M j)), 2665#(< j M), 2666#(or (< (+ j 1) M) (<= M j))] [2022-03-15 22:03:50,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:03:50,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:50,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:03:50,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-03-15 22:03:50,804 INFO L87 Difference]: Start difference. First operand 164 states and 540 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 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:03:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:50,991 INFO L93 Difference]: Finished difference Result 229 states and 744 transitions. [2022-03-15 22:03:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 22:03:50,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 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 14 [2022-03-15 22:03:50,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:50,993 INFO L225 Difference]: With dead ends: 229 [2022-03-15 22:03:50,993 INFO L226 Difference]: Without dead ends: 229 [2022-03-15 22:03:50,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:03:50,994 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:50,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:03:50,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-03-15 22:03:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 166. [2022-03-15 22:03:51,001 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:03:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 550 transitions. [2022-03-15 22:03:51,002 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 550 transitions. Word has length 14 [2022-03-15 22:03:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:51,002 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 550 transitions. [2022-03-15 22:03:51,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 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:03:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 550 transitions. [2022-03-15 22:03:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:03:51,003 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:51,003 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:51,029 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:03:51,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:51,219 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:03:51,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:51,220 INFO L85 PathProgramCache]: Analyzing trace with hash 529259106, now seen corresponding path program 4 times [2022-03-15 22:03:51,221 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:51,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903149640] [2022-03-15 22:03:51,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:51,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:51,498 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:03:51,498 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:51,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903149640] [2022-03-15 22:03:51,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903149640] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:51,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5816891] [2022-03-15 22:03:51,499 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:03:51,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:51,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:51,504 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:03:51,505 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:03:51,534 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:03:51,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:51,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 22:03:51,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:51,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2022-03-15 22:03:52,070 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:03:52,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:52,476 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:03:52,477 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 211 treesize of output 149 [2022-03-15 22:03:53,349 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:03:53,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5816891] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:53,349 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:53,350 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-03-15 22:03:53,350 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1066284156] [2022-03-15 22:03:53,350 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:53,351 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:53,356 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 22:03:53,356 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:58,404 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [3357#(and (or (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1))), 3364#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 3365#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 3360#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1))), 3359#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2))), 3363#(and (or (< j M) (<= (+ max2 1) (select A k)) (= max2 max1)) (or (= max1 (select A k)) (< j M) (<= (select A k) max2)) (or (< j M) (= k 0)) (or (< j M) (<= (+ k 1) i))), 3356#(and (or (= max1 (select A (+ (- 1) N))) (<= (select A (+ (- 1) N)) max2) (< j M) (< (+ 2 k) N) (<= (select A (+ (- 1) N)) (select A k))) (or (= max1 (select A k)) (< j M) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (<= (select A k) max2)) (or (< j M) (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ (- 1) N))) (= max2 max1)) (or (< j M) (= k 0)) (or (<= (+ 2 k) N) (< j M))), 3361#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (= max1 (select A k)) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (< max1 (select A i)) (<= (select A k) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2))), 3368#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (not (< (select A i) (select A (+ i 1)))) (not (< max1 (select A i)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A i) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< max1 (select A i)) (<= (select A k) max2) (not (< max1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (not (< (select A i) (select A (+ i 1)))) (not (< max1 (select A i))) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (not (< (+ i 1) N)) (= max1 (select A k)) (< (+ 2 i) N) (<= (+ 2 k) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (< max1 (select A i)) (not (< max1 (select A (+ i 1)))))), 3358#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (< j M) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2))), 3355#(and (or (= max1 (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A k) max2) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< i N) (= max2 max1))), 3367#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2))), 3348#(or (<= (+ k 1) N) (< j M) (= max2 max1)), 3349#(and (or (= max1 (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A k) max2)) (or (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (= max2 max1))), 3351#(or (< j M) (< i N) (= max2 max1)), 3366#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i)))), 3354#(and (or (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< i N) (= max2 max1)) (or (= max1 (select A k)) (<= (+ 2 k) N) (<= (select A k) max2) (< i N))), 3350#(or (< i N) (= max2 max1)), 3347#(or (< j M) (= max2 max1)), 3370#(and (or (< j M) (= k i)) (or (< j M) (= max2 max1)) (or (< j M) (= k 0)) (or (< j M) (= i max2))), 3369#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (< max1 (select A i)) (<= (select A k) max2) (not (< max1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (= max1 (select A k)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (not (< (select A i) (select A (+ i 1)))) (not (< max1 (select A i))) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (< max1 (select A i)) (not (< max1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (not (< (select A i) (select A (+ i 1)))) (not (< max1 (select A i)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A i) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 3352#(or (<= (+ k 1) N) (< i N) (= max2 max1)), 3362#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (= max1 (select A k)) (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (< max1 (select A i)) (<= (select A k) max2))), 3353#(or (<= (+ k 1) N) (< j M) (< i N) (= max2 max1))] [2022-03-15 22:03:58,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:03:58,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:58,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:03:58,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1529, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:03:58,406 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:04:06,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:06,947 INFO L93 Difference]: Finished difference Result 440 states and 1352 transitions. [2022-03-15 22:04:06,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 22:04:06,948 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:04:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:06,950 INFO L225 Difference]: With dead ends: 440 [2022-03-15 22:04:06,950 INFO L226 Difference]: Without dead ends: 423 [2022-03-15 22:04:06,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3244 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1745, Invalid=8967, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 22:04:06,953 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 426 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:06,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 0 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 22:04:06,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-03-15 22:04:06,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 211. [2022-03-15 22:04:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 3.4571428571428573) internal successors, (726), 210 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 726 transitions. [2022-03-15 22:04:06,963 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 726 transitions. Word has length 15 [2022-03-15 22:04:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:06,963 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 726 transitions. [2022-03-15 22:04:06,963 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:04:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 726 transitions. [2022-03-15 22:04:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:04:06,964 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:06,964 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:06,989 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:04:07,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:07,186 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:04:07,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:07,187 INFO L85 PathProgramCache]: Analyzing trace with hash 689522916, now seen corresponding path program 5 times [2022-03-15 22:04:07,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:07,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141928014] [2022-03-15 22:04:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:07,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:04:07,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:07,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141928014] [2022-03-15 22:04:07,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141928014] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:07,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125026077] [2022-03-15 22:04:07,262 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:04:07,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:07,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:07,264 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:04:07,266 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:04:07,289 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:04:07,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:07,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:04:07,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:04:07,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:04:07,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125026077] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:07,384 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:07,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-03-15 22:04:07,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [108627221] [2022-03-15 22:04:07,384 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:07,385 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:07,390 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:04:07,390 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:08,075 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [4452#(< k N), 4462#(or (<= N i) (< k N)), 4453#(or (<= N k) (< (+ k 1) N)), 4464#(or (<= N i) (< j M)), 4468#(and (or (< j M) (= (+ max2 (* (- 1) i)) 0)) (or (< j M) (<= k max2))), 4455#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 4466#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 4457#(or (< j M) (< k N)), 4467#(or (<= N (+ i 1)) (< j M)), 4461#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 4459#(or (< j M) (<= (+ N 1) i)), 4460#(or (< j M) (<= (+ N 1) i) (< k N)), 4456#(< j M), 4458#(or (< j M) (<= N k) (< (+ k 1) N)), 4445#(or (< j M) (<= k (+ i 1))), 4454#(or (<= (+ N 1) i) (< k N)), 4465#(or (<= N i) (< j M) (< k N)), 4463#(or (<= N i) (<= N k) (< (+ k 1) N))] [2022-03-15 22:04:08,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:04:08,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:08,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:04:08,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:04:08,076 INFO L87 Difference]: Start difference. First operand 211 states and 726 transitions. Second operand has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:08,844 INFO L93 Difference]: Finished difference Result 304 states and 972 transitions. [2022-03-15 22:04:08,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:04:08,845 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:04:08,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:08,847 INFO L225 Difference]: With dead ends: 304 [2022-03-15 22:04:08,847 INFO L226 Difference]: Without dead ends: 301 [2022-03-15 22:04:08,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=698, Invalid=2608, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:04:08,848 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:08,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:04:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-03-15 22:04:08,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 211. [2022-03-15 22:04:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 3.4380952380952383) internal successors, (722), 210 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 722 transitions. [2022-03-15 22:04:08,855 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 722 transitions. Word has length 15 [2022-03-15 22:04:08,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:08,855 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 722 transitions. [2022-03-15 22:04:08,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:08,855 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 722 transitions. [2022-03-15 22:04:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:04:08,856 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:08,856 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:08,883 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:04:09,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:09,078 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:04:09,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:09,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1869207442, now seen corresponding path program 3 times [2022-03-15 22:04:09,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:09,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828590407] [2022-03-15 22:04:09,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:09,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:09,251 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:04:09,252 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:09,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828590407] [2022-03-15 22:04:09,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828590407] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:09,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032442299] [2022-03-15 22:04:09,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:04:09,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:09,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:09,253 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:04:09,254 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:04:09,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:04:09,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:09,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 22:04:09,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:09,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:04:09,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:04:09,760 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 109 treesize of output 75 [2022-03-15 22:04:09,864 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:04:09,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:10,354 INFO L353 Elim1Store]: treesize reduction 10, result has 81.8 percent of original size [2022-03-15 22:04:10,354 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 191 treesize of output 161 [2022-03-15 22:04:12,742 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:04:12,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032442299] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:12,743 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:12,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-03-15 22:04:12,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [850258749] [2022-03-15 22:04:12,743 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:12,744 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:12,748 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:04:12,748 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:15,645 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [5361#(and (or (< j M) (<= (+ max2 1) (select A k)) (< i N) (= max2 max1)) (or (= max1 (select A k)) (< j M) (<= (select A k) max2) (< i N))), 5364#(and (or (< (+ j 1) M) (not (< j M)) (< i (+ k 1))) (or (< (+ j 1) M) (not (= k i)) (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (= k i)) (not (< j M)) (= (select A j) max1)) (or (< (+ j 1) M) (<= (+ k 1) N) (<= k i) (not (< j M)))), 5353#(or (< j M) (= max2 max1)), 5359#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 5360#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (< j M) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2))), 5362#(and (or (< j M) (not (= k i)) (= max2 max1)) (or (<= (+ k 1) N) (<= k i) (< j M)) (or (< j M) (< i (+ k 1)))), 5357#(and (or (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (not (< j M)) (<= (select A k) (select A j))) (or (< (+ j 1) M) (<= (+ max2 1) (select A k)) (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max1) (<= (+ (select A j) 1) (select A k))) (or (< (+ j 1) M) (= max1 (select A k)) (not (< j M)) (< max2 (select A j)) (<= (select A k) max2))), 5355#(or (< j M) (< i N) (= max2 max1)), 5365#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i)))), 5356#(and (or (< j M) (<= (+ max2 1) (select A k)) (= max2 max1)) (or (= max1 (select A k)) (< j M) (<= (select A k) max2))), 5354#(or (< i N) (= max2 max1)), 5358#(and (or (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1))), 5363#(and (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max1) (<= (+ (select A j) 1) (select A k)) (< i N)) (or (< (+ j 1) M) (= max1 (select A k)) (not (< j M)) (< max2 (select A j)) (<= (select A k) max2) (< i N)) (or (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (not (< j M)) (< i N) (<= (select A k) (select A j))) (or (< (+ j 1) M) (<= (+ max2 1) (select A k)) (not (< j M)) (< max2 (select A j)) (< i N) (= max2 max1)))] [2022-03-15 22:04:15,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:04:15,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:15,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:04:15,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:04:15,648 INFO L87 Difference]: Start difference. First operand 211 states and 722 transitions. Second operand has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 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:04:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:20,390 INFO L93 Difference]: Finished difference Result 658 states and 1870 transitions. [2022-03-15 22:04:20,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 22:04:20,391 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:04:20,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:20,394 INFO L225 Difference]: With dead ends: 658 [2022-03-15 22:04:20,394 INFO L226 Difference]: Without dead ends: 642 [2022-03-15 22:04:20,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=822, Invalid=5030, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 22:04:20,396 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 242 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:20,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 0 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:04:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-03-15 22:04:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 221. [2022-03-15 22:04:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 3.459090909090909) internal successors, (761), 220 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 761 transitions. [2022-03-15 22:04:20,406 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 761 transitions. Word has length 15 [2022-03-15 22:04:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:20,407 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 761 transitions. [2022-03-15 22:04:20,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 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:04:20,407 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 761 transitions. [2022-03-15 22:04:20,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:04:20,408 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:20,408 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:20,431 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:04:20,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 22:04:20,631 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:04:20,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:20,631 INFO L85 PathProgramCache]: Analyzing trace with hash -764809232, now seen corresponding path program 4 times [2022-03-15 22:04:20,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:20,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015415880] [2022-03-15 22:04:20,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:20,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:20,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:04:20,662 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:20,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015415880] [2022-03-15 22:04:20,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015415880] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:20,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889481233] [2022-03-15 22:04:20,662 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:04:20,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:20,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:20,664 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:04:20,670 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:04:20,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:04:20,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:20,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 22:04:20,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:04:20,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:04:20,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889481233] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:20,801 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:20,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 11 [2022-03-15 22:04:20,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1048190473] [2022-03-15 22:04:20,801 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:20,802 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:20,806 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 103 transitions. [2022-03-15 22:04:20,807 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:21,203 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [6654#(or (<= N i) (< (+ i 1) N)), 6656#(< j M), 6629#(< i N), 6658#(or (<= N i) (< (+ i 1) N) (< j M)), 6661#(or (< (+ 2 j) M) (<= M (+ j 1))), 6659#(or (<= N i) (<= (+ 2 M i) (+ N j))), 6657#(or (< j M) (< i N)), 6655#(or (<= (+ 3 i) N) (<= N i)), 6660#(or (< (+ j 1) M) (<= M j))] [2022-03-15 22:04:21,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:04:21,204 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:21,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:04:21,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:04:21,204 INFO L87 Difference]: Start difference. First operand 221 states and 761 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:21,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:21,690 INFO L93 Difference]: Finished difference Result 525 states and 1693 transitions. [2022-03-15 22:04:21,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:04:21,690 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:04:21,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:21,693 INFO L225 Difference]: With dead ends: 525 [2022-03-15 22:04:21,693 INFO L226 Difference]: Without dead ends: 525 [2022-03-15 22:04:21,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=373, Invalid=1109, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:04:21,694 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:21,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:04:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-03-15 22:04:21,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 318. [2022-03-15 22:04:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 3.526813880126183) internal successors, (1118), 317 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 1118 transitions. [2022-03-15 22:04:21,705 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 1118 transitions. Word has length 15 [2022-03-15 22:04:21,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:21,705 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 1118 transitions. [2022-03-15 22:04:21,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 1118 transitions. [2022-03-15 22:04:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:04:21,706 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:21,706 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:21,723 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:04:21,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:21,911 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:04:21,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:21,912 INFO L85 PathProgramCache]: Analyzing trace with hash -519709146, now seen corresponding path program 5 times [2022-03-15 22:04:21,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:21,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857231750] [2022-03-15 22:04:21,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:21,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:22,174 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:04:22,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:22,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857231750] [2022-03-15 22:04:22,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857231750] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:22,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443925071] [2022-03-15 22:04:22,174 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:04:22,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:22,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:22,176 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:04:22,176 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:04:22,201 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:04:22,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:22,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:04:22,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:22,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:04:22,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:04:22,647 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 115 treesize of output 75 [2022-03-15 22:04:22,791 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:04:22,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:23,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:04:23,188 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:04:23,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 187 treesize of output 157 [2022-03-15 22:04:24,700 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:04:24,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443925071] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:24,700 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:24,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-03-15 22:04:24,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1668603134] [2022-03-15 22:04:24,700 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:24,701 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:24,704 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 89 transitions. [2022-03-15 22:04:24,704 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:27,472 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [7966#(or (< i N) (= max2 max1)), 7977#(and (or (<= N (+ i 1)) (<= (+ max2 1) (select A j)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< max2 (select A j)) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (<= (+ max2 1) (select A j)) (< (+ 2 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) (select A j)) (< k N)) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (< max1 (select A (+ i 1))) (= (select A j) max1) (< max1 (select A i))) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= (select A j) (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (< max2 (select A j)) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= (select A j) (select A (+ i 1))) (< k N) (< max1 (select A i)))), 7972#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 7975#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (< max2 (select A j)) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= (select A j) (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (<= (+ max2 1) (select A j)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (<= (+ max2 1) (select A j)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) (select A j))) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (= (select A j) max1) (< max1 (select A i))) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= (select A j) (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< max2 (select A j)) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 7967#(and (or (<= (select A j) max2) (= (select A j) max1) (< i N)) (or (<= (+ max2 1) (select A j)) (< i N) (= max2 max1))), 7969#(and (or (<= (select A j) max2) (<= (+ k 1) N) (= (select A j) max1) (< i N)) (or (<= (+ max2 1) (select A j)) (<= (+ k 1) N) (< i N) (= max2 max1))), 7968#(or (< k N) (< i N) (= max2 max1)), 7976#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 7970#(and (or (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1))), 7973#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2))), 7971#(and (or (<= (select A j) max2) (< (+ i 1) N) (not (< i N)) (= (select A i) (select A j)) (not (< max1 (select A i)))) (or (<= (+ max2 1) (select A j)) (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (not (< i N)) (< max2 (select A j)) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= (select A j) max2) (< (+ i 1) N) (not (< i N)) (= (select A j) max1) (< max1 (select A i)))), 7965#(or (< k N) (= max2 max1)), 7974#(and (or (<= (+ max2 1) (select A j)) (< (+ i 1) N) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1)) (or (<= (select A j) max2) (< (+ i 1) N) (not (< i N)) (< k N) (= (select A j) max1) (< max1 (select A i))) (or (< (+ i 1) N) (not (< i N)) (< max2 (select A j)) (< k N) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= (select A j) max2) (< (+ i 1) N) (not (< i N)) (= (select A i) (select A j)) (< k N) (not (< max1 (select A i)))))] [2022-03-15 22:04:27,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:04:27,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:27,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:04:27,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:04:27,473 INFO L87 Difference]: Start difference. First operand 318 states and 1118 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:32,991 INFO L93 Difference]: Finished difference Result 708 states and 2245 transitions. [2022-03-15 22:04:32,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 22:04:32,991 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 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:04:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:32,995 INFO L225 Difference]: With dead ends: 708 [2022-03-15 22:04:32,995 INFO L226 Difference]: Without dead ends: 700 [2022-03-15 22:04:32,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 29 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1480 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=904, Invalid=4796, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 22:04:32,997 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 375 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:32,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 0 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:04:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-03-15 22:04:33,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 323. [2022-03-15 22:04:33,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 3.531055900621118) internal successors, (1137), 322 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 1137 transitions. [2022-03-15 22:04:33,008 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 1137 transitions. Word has length 15 [2022-03-15 22:04:33,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:33,008 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 1137 transitions. [2022-03-15 22:04:33,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:33,009 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 1137 transitions. [2022-03-15 22:04:33,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:04:33,010 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:33,010 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:33,032 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:04:33,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 22:04:33,223 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:04:33,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:33,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1842155728, now seen corresponding path program 6 times [2022-03-15 22:04:33,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:33,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113358632] [2022-03-15 22:04:33,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:33,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:33,287 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:04:33,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:33,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113358632] [2022-03-15 22:04:33,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113358632] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:33,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918558943] [2022-03-15 22:04:33,287 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:04:33,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:33,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:33,289 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:04:33,291 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:04:33,317 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:04:33,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:33,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:04:33,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:33,362 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:04:33,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:33,404 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:04:33,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918558943] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:33,404 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:33,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-03-15 22:04:33,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1326890136] [2022-03-15 22:04:33,405 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:33,406 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:33,410 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:04:33,410 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:34,413 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [9543#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 9532#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 9529#(or (<= N i) (< (+ i 1) N) (< k N)), 9544#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 9533#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N) (< j M)), 9531#(or (<= N i) (< (+ i 1) N) (< j M)), 9541#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)), 9521#(or (<= (+ 2 k) N) (< j M)), 9528#(or (<= N i) (< (+ i 1) N)), 9548#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N)), 9535#(or (<= (+ 2 k) i) (< j M)), 9545#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 9546#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 9519#(< j M), 9523#(or (< k N) (< i N)), 9534#(or (<= (+ 3 k) N) (< j M)), 9522#(< i N), 9542#(or (< j M) (<= (+ k 1) i)), 9530#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N)), 9527#(or (<= (+ 2 k) N) (< j M) (< i N)), 9547#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)), 9520#(or (<= (+ k 1) N) (< j M)), 9512#(or (<= k i) (< j M)), 9538#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 9537#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 9524#(or (< j M) (< i N)), 9526#(or (<= (+ 2 k) N) (< i N)), 9540#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N)), 9539#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 9525#(or (< j M) (< k N) (< i N)), 9536#(or (<= N (+ i 1)) (< (+ 2 i) N))] [2022-03-15 22:04:34,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 22:04:34,413 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:34,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 22:04:34,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1347, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 22:04:34,414 INFO L87 Difference]: Start difference. First operand 323 states and 1137 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:04:36,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:36,571 INFO L93 Difference]: Finished difference Result 622 states and 2056 transitions. [2022-03-15 22:04:36,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 22:04:36,572 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:04:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:36,576 INFO L225 Difference]: With dead ends: 622 [2022-03-15 22:04:36,576 INFO L226 Difference]: Without dead ends: 622 [2022-03-15 22:04:36,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3357 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2472, Invalid=9518, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 22:04:36,579 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 451 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:36,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 0 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:04:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2022-03-15 22:04:36,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 384. [2022-03-15 22:04:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 3.587467362924282) internal successors, (1374), 383 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1374 transitions. [2022-03-15 22:04:36,592 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1374 transitions. Word has length 16 [2022-03-15 22:04:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:36,592 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 1374 transitions. [2022-03-15 22:04:36,592 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:04:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1374 transitions. [2022-03-15 22:04:36,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:04:36,593 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:36,594 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:36,619 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:04:36,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 22:04:36,817 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:04:36,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:36,818 INFO L85 PathProgramCache]: Analyzing trace with hash -772947566, now seen corresponding path program 7 times [2022-03-15 22:04:36,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:36,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051390424] [2022-03-15 22:04:36,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:36,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:36,875 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:04:36,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:36,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051390424] [2022-03-15 22:04:36,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051390424] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:36,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914242415] [2022-03-15 22:04:36,875 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:04:36,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:36,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:36,876 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:04:36,877 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:04:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:36,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:04:36,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:36,989 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:04:36,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:37,020 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:04:37,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914242415] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:37,020 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:37,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-15 22:04:37,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [501255134] [2022-03-15 22:04:37,021 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:37,022 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:37,027 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:04:37,027 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:37,532 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [11184#(or (<= N k) (< i N)), 11187#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 11190#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 11189#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 11182#(< i N), 11185#(or (<= N i) (< (+ i 1) N) (<= N k)), 11188#(or (<= N (+ i 1)) (< (+ 2 i) N)), 11183#(or (<= N i) (< (+ i 1) N)), 11186#(or (<= N (+ k 1)) (< i N))] [2022-03-15 22:04:37,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:04:37,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:37,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:04:37,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-03-15 22:04:37,533 INFO L87 Difference]: Start difference. First operand 384 states and 1374 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:38,262 INFO L93 Difference]: Finished difference Result 1085 states and 3837 transitions. [2022-03-15 22:04:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:04:38,263 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:04:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:38,268 INFO L225 Difference]: With dead ends: 1085 [2022-03-15 22:04:38,268 INFO L226 Difference]: Without dead ends: 1063 [2022-03-15 22:04:38,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=944, Invalid=2716, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 22:04:38,270 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 228 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:38,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 0 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:04:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2022-03-15 22:04:38,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 504. [2022-03-15 22:04:38,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 3.63220675944334) internal successors, (1827), 503 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1827 transitions. [2022-03-15 22:04:38,291 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1827 transitions. Word has length 16 [2022-03-15 22:04:38,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:38,291 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 1827 transitions. [2022-03-15 22:04:38,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:38,291 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1827 transitions. [2022-03-15 22:04:38,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:04:38,292 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:38,293 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:38,314 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:04:38,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 22:04:38,511 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:04:38,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:38,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2110966522, now seen corresponding path program 6 times [2022-03-15 22:04:38,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:38,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168724340] [2022-03-15 22:04:38,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:38,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:38,575 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:04:38,575 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:38,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168724340] [2022-03-15 22:04:38,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168724340] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:38,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752825031] [2022-03-15 22:04:38,575 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:04:38,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:38,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:38,580 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:04:38,605 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:04:38,613 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 22:04:38,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:38,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:04:38,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:38,666 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:04:38,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:38,712 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:04:38,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752825031] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:38,713 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:38,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 22:04:38,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [960355015] [2022-03-15 22:04:38,713 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:38,714 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:38,719 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 22:04:38,719 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:39,473 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [13462#(< j M), 13458#(< i N), 13476#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 13459#(or (<= N i) (< (+ i 1) N)), 13468#(or (<= N (+ k 1)) (< j M)), 13472#(or (< (+ j 1) M) (<= i (+ k 1)) (<= M j)), 13467#(or (<= N i) (< (+ i 1) N) (< j M) (<= N k)), 13477#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= N k)), 13466#(or (< j M) (<= N k) (< i N)), 13469#(or (< j M) (<= i (+ k 1))), 13465#(or (< j M) (<= N k)), 13474#(or (<= N (+ i 1)) (< (+ 2 i) N)), 13460#(or (<= N k) (< i N)), 13461#(or (<= N i) (< (+ i 1) N) (<= N k)), 13463#(or (< j M) (< i N)), 13470#(or (< j M) (<= i k)), 13473#(or (< (+ j 1) M) (<= i k) (<= M j)), 13475#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 13471#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 13464#(or (<= N i) (< (+ i 1) N) (< j M))] [2022-03-15 22:04:39,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:04:39,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:39,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:04:39,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:04:39,474 INFO L87 Difference]: Start difference. First operand 504 states and 1827 transitions. Second operand has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 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:04:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:41,370 INFO L93 Difference]: Finished difference Result 1352 states and 4675 transitions. [2022-03-15 22:04:41,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 22:04:41,370 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 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 16 [2022-03-15 22:04:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:41,377 INFO L225 Difference]: With dead ends: 1352 [2022-03-15 22:04:41,377 INFO L226 Difference]: Without dead ends: 1338 [2022-03-15 22:04:41,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3252 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2305, Invalid=8825, Unknown=0, NotChecked=0, Total=11130 [2022-03-15 22:04:41,381 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 351 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:41,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 0 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:04:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2022-03-15 22:04:41,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 682. [2022-03-15 22:04:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 3.922173274596182) internal successors, (2671), 681 states have internal predecessors, (2671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 2671 transitions. [2022-03-15 22:04:41,409 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 2671 transitions. Word has length 16 [2022-03-15 22:04:41,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:41,410 INFO L470 AbstractCegarLoop]: Abstraction has 682 states and 2671 transitions. [2022-03-15 22:04:41,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 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:04:41,410 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 2671 transitions. [2022-03-15 22:04:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:04:41,412 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:41,412 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:41,436 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:04:41,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 22:04:41,635 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:04:41,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash -687661098, now seen corresponding path program 7 times [2022-03-15 22:04:41,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:41,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105362606] [2022-03-15 22:04:41,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:41,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:41,690 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:04:41,691 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:41,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105362606] [2022-03-15 22:04:41,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105362606] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:41,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446305407] [2022-03-15 22:04:41,691 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:04:41,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:41,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:41,692 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:04:41,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 22:04:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:41,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:04:41,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:41,795 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:04:41,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:41,861 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:04:41,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446305407] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:41,861 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:41,861 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 13 [2022-03-15 22:04:41,861 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1457117067] [2022-03-15 22:04:41,861 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:41,862 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:41,868 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 22:04:41,868 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:42,769 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [16463#(or (< j M) (< k N) (< i N)), 16453#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 16467#(or (< j M) (<= (+ k 1) i)), 16451#(or (<= N i) (< (+ i 1) N)), 16470#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 16468#(or (< (+ j 1) M) (<= (+ k 1) i) (<= M j)), 16459#(< j M), 16454#(or (< k N) (< i N)), 16466#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 16462#(or (< j M) (< i N)), 16452#(or (<= N (+ i 1)) (< (+ 2 i) N)), 16460#(or (<= (+ k 1) N) (< j M)), 16458#(or (<= N i) (<= k (+ i 1))), 16469#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 16461#(or (<= (+ 2 k) N) (< j M)), 16465#(or (<= N i) (< (+ i 1) N) (< j M)), 16473#(or (<= (+ k j) (+ M i 1)) (<= N i)), 16456#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 16471#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 16457#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 16472#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 16450#(< i N), 16464#(or (< (+ j 1) M) (<= (+ 2 k) N) (<= M j)), 16455#(or (<= N i) (< (+ i 1) N) (< k N))] [2022-03-15 22:04:42,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:04:42,769 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:42,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:04:42,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:04:42,770 INFO L87 Difference]: Start difference. First operand 682 states and 2671 transitions. Second operand has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:47,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:47,264 INFO L93 Difference]: Finished difference Result 2095 states and 6909 transitions. [2022-03-15 22:04:47,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2022-03-15 22:04:47,264 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:04:47,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:47,274 INFO L225 Difference]: With dead ends: 2095 [2022-03-15 22:04:47,274 INFO L226 Difference]: Without dead ends: 2095 [2022-03-15 22:04:47,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11774 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5679, Invalid=27993, Unknown=0, NotChecked=0, Total=33672 [2022-03-15 22:04:47,278 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 485 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 1869 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:47,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 0 Invalid, 2163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1869 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:04:47,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2022-03-15 22:04:47,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 946. [2022-03-15 22:04:47,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 945 states have (on average 4.061375661375662) internal successors, (3838), 945 states have internal predecessors, (3838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 3838 transitions. [2022-03-15 22:04:47,320 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 3838 transitions. Word has length 16 [2022-03-15 22:04:47,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:47,320 INFO L470 AbstractCegarLoop]: Abstraction has 946 states and 3838 transitions. [2022-03-15 22:04:47,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 3838 transitions. [2022-03-15 22:04:47,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:04:47,329 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:47,329 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:47,345 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:04:47,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:47,531 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:04:47,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:47,532 INFO L85 PathProgramCache]: Analyzing trace with hash 416737112, now seen corresponding path program 8 times [2022-03-15 22:04:47,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:47,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392977626] [2022-03-15 22:04:47,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:47,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:04:47,566 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:47,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392977626] [2022-03-15 22:04:47,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392977626] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:47,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323902344] [2022-03-15 22:04:47,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:04:47,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:47,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:47,567 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:04:47,575 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:04:47,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:04:47,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:47,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:04:47,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:04:47,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:04:47,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323902344] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:47,732 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:47,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2022-03-15 22:04:47,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1749542502] [2022-03-15 22:04:47,733 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:47,734 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:47,739 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 133 transitions. [2022-03-15 22:04:47,739 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:48,249 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [20858#(or (<= N i) (<= (+ 2 i) N)), 20864#(or (<= N i) (<= (+ M i 1) (+ N j))), 20861#(or (< j M) (< i N)), 20865#(or (<= N (+ i 1)) (<= (+ 2 M i) (+ N j))), 20856#(< j M), 20859#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 20862#(or (<= N i) (< (+ i 1) N) (< j M)), 20860#(or (< (+ 2 j) M) (<= M (+ j 1))), 20857#(or (< (+ j 1) M) (<= M j)), 20863#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M))] [2022-03-15 22:04:48,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:04:48,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:48,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:04:48,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:04:48,250 INFO L87 Difference]: Start difference. First operand 946 states and 3838 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 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:04:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:49,112 INFO L93 Difference]: Finished difference Result 2684 states and 9854 transitions. [2022-03-15 22:04:49,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 22:04:49,112 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 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 16 [2022-03-15 22:04:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:49,125 INFO L225 Difference]: With dead ends: 2684 [2022-03-15 22:04:49,125 INFO L226 Difference]: Without dead ends: 2684 [2022-03-15 22:04:49,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=594, Invalid=1956, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 22:04:49,126 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:49,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:04:49,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2022-03-15 22:04:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 1140. [2022-03-15 22:04:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 4.183494293239684) internal successors, (4765), 1139 states have internal predecessors, (4765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 4765 transitions. [2022-03-15 22:04:49,168 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 4765 transitions. Word has length 16 [2022-03-15 22:04:49,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:49,168 INFO L470 AbstractCegarLoop]: Abstraction has 1140 states and 4765 transitions. [2022-03-15 22:04:49,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 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:04:49,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 4765 transitions. [2022-03-15 22:04:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:04:49,171 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:49,171 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:49,194 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:04:49,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 22:04:49,388 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:04:49,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:49,388 INFO L85 PathProgramCache]: Analyzing trace with hash 661837198, now seen corresponding path program 9 times [2022-03-15 22:04:49,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:49,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911603319] [2022-03-15 22:04:49,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:49,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:49,445 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:04:49,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:49,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911603319] [2022-03-15 22:04:49,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911603319] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:49,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912300643] [2022-03-15 22:04:49,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:04:49,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:49,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:49,447 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:04:49,454 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:04:49,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:04:49,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:49,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:04:49,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:49,565 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:04:49,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:49,658 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:04:49,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912300643] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:49,658 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:49,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-03-15 22:04:49,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1860209033] [2022-03-15 22:04:49,658 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:49,659 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:49,664 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 108 transitions. [2022-03-15 22:04:49,664 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:50,672 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [26003#(or (<= N i) (< (+ i 1) N) (< j M)), 26000#(or (<= N i) (< (+ i 1) N) (< k N)), 25998#(< k N), 26015#(or (<= (+ 2 k j) (+ N M)) (< i N)), 26002#(or (<= (+ j 1) M) (< i N)), 26007#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 25997#(or (<= N (+ i 1)) (< (+ 2 i) N)), 26005#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 26010#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 26001#(or (< k N) (<= (+ j 1) M)), 25999#(or (< k N) (< i N)), 25996#(or (<= N i) (< (+ i 1) N)), 26020#(or (<= N (+ 2 i)) (<= (+ 2 k j) (+ N M)) (< (+ 3 i) N)), 26012#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 26014#(or (<= (+ 2 j) M) (<= N i) (< (+ i 1) N)), 26006#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 26017#(or (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N)), 26009#(or (< j M) (< k N) (< i N)), 26008#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 26004#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 26013#(or (<= (+ 2 j) M) (< i N)), 26018#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k j) (+ N M))), 26011#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 25995#(< i N), 26016#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k j) (+ N M))), 26019#(or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N))] [2022-03-15 22:04:50,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 22:04:50,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:50,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 22:04:50,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1688, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:04:50,673 INFO L87 Difference]: Start difference. First operand 1140 states and 4765 transitions. Second operand has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:53,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:53,994 INFO L93 Difference]: Finished difference Result 2135 states and 7891 transitions. [2022-03-15 22:04:53,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-03-15 22:04:53,994 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:04:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:54,006 INFO L225 Difference]: With dead ends: 2135 [2022-03-15 22:04:54,006 INFO L226 Difference]: Without dead ends: 2135 [2022-03-15 22:04:54,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7397 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4412, Invalid=19768, Unknown=0, NotChecked=0, Total=24180 [2022-03-15 22:04:54,009 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 390 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:54,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [390 Valid, 0 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:04:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2022-03-15 22:04:54,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1312. [2022-03-15 22:04:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1311 states have (on average 4.276125095347063) internal successors, (5606), 1311 states have internal predecessors, (5606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:54,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 5606 transitions. [2022-03-15 22:04:54,053 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 5606 transitions. Word has length 16 [2022-03-15 22:04:54,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:54,053 INFO L470 AbstractCegarLoop]: Abstraction has 1312 states and 5606 transitions. [2022-03-15 22:04:54,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:54,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 5606 transitions. [2022-03-15 22:04:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:04:54,057 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:54,058 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:54,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 22:04:54,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:54,271 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:04:54,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:54,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1488485624, now seen corresponding path program 10 times [2022-03-15 22:04:54,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:54,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506384458] [2022-03-15 22:04:54,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:54,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:54,313 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:04:54,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:54,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506384458] [2022-03-15 22:04:54,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506384458] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:54,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098325695] [2022-03-15 22:04:54,313 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:04:54,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:54,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:54,315 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:04:54,319 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:04:54,342 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:04:54,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:54,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:04:54,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:54,428 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:04:54,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:54,513 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:04:54,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098325695] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:54,513 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:54,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:04:54,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [460853456] [2022-03-15 22:04:54,513 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:54,514 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:54,517 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 100 transitions. [2022-03-15 22:04:54,517 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:54,986 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [31118#(or (<= N i) (< (+ i 1) N) (< j M)), 31122#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 31119#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 31112#(or (<= N (+ i 1)) (< (+ 2 i) N)), 31113#(or (<= N k) (< i N)), 31116#(< j M), 31121#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 31115#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 31117#(or (< j M) (< i N)), 31111#(or (<= N i) (< (+ i 1) N)), 31114#(or (<= N i) (< (+ i 1) N) (<= N k)), 31120#(or (<= (+ N M) (+ k j 1)) (< i N)), 31110#(< i N)] [2022-03-15 22:04:54,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:04:54,986 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:54,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:04:54,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:04:54,987 INFO L87 Difference]: Start difference. First operand 1312 states and 5606 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:56,454 INFO L93 Difference]: Finished difference Result 4192 states and 16930 transitions. [2022-03-15 22:04:56,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 22:04:56,454 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:04:56,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:56,474 INFO L225 Difference]: With dead ends: 4192 [2022-03-15 22:04:56,474 INFO L226 Difference]: Without dead ends: 4137 [2022-03-15 22:04:56,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2282 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1701, Invalid=6131, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 22:04:56,476 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 280 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:56,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 0 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:04:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4137 states. [2022-03-15 22:04:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4137 to 1974. [2022-03-15 22:04:56,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1974 states, 1973 states have (on average 4.596553471870249) internal successors, (9069), 1973 states have internal predecessors, (9069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 9069 transitions. [2022-03-15 22:04:56,564 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 9069 transitions. Word has length 16 [2022-03-15 22:04:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:56,564 INFO L470 AbstractCegarLoop]: Abstraction has 1974 states and 9069 transitions. [2022-03-15 22:04:56,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:56,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 9069 transitions. [2022-03-15 22:04:56,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:04:56,571 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:56,571 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:56,595 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:04:56,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:56,796 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:04:56,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:56,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2034886336, now seen corresponding path program 11 times [2022-03-15 22:04:56,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:56,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626992308] [2022-03-15 22:04:56,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:56,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:56,838 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:04:56,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:56,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626992308] [2022-03-15 22:04:56,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626992308] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:56,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066769806] [2022-03-15 22:04:56,839 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:04:56,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:56,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:56,840 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:04:56,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 22:04:56,862 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:04:56,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:56,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:04:56,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:56,952 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:04:56,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:57,037 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:04:57,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066769806] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:57,037 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:57,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:04:57,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2036466463] [2022-03-15 22:04:57,037 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:57,038 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:57,042 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 98 transitions. [2022-03-15 22:04:57,042 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:57,502 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [39488#(or (<= N i) (< (+ i 1) N)), 39499#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 39495#(or (<= (+ N M) (+ k j 1)) (< i N)), 39490#(or (<= N i) (< (+ i 1) N) (<= M j)), 39498#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 39497#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 39489#(or (< i N) (<= M j)), 39491#(or (<= N (+ i 1)) (< (+ 2 i) N)), 39496#(or (<= N i) (< (+ i 1) N) (< k N)), 39493#(< k N), 39494#(or (< k N) (< i N)), 39487#(< i N), 39492#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j))] [2022-03-15 22:04:57,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:04:57,503 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:57,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:04:57,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:04:57,504 INFO L87 Difference]: Start difference. First operand 1974 states and 9069 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:59,439 INFO L93 Difference]: Finished difference Result 4098 states and 16712 transitions. [2022-03-15 22:04:59,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 22:04:59,439 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:04:59,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:59,451 INFO L225 Difference]: With dead ends: 4098 [2022-03-15 22:04:59,452 INFO L226 Difference]: Without dead ends: 4039 [2022-03-15 22:04:59,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4860 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2783, Invalid=11259, Unknown=0, NotChecked=0, Total=14042 [2022-03-15 22:04:59,454 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 383 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:59,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 0 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:04:59,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4039 states. [2022-03-15 22:04:59,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4039 to 2108. [2022-03-15 22:04:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 2107 states have (on average 4.643569055529189) internal successors, (9784), 2107 states have internal predecessors, (9784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 9784 transitions. [2022-03-15 22:04:59,536 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 9784 transitions. Word has length 16 [2022-03-15 22:04:59,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:59,536 INFO L470 AbstractCegarLoop]: Abstraction has 2108 states and 9784 transitions. [2022-03-15 22:04:59,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:59,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 9784 transitions. [2022-03-15 22:04:59,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:04:59,543 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:59,543 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:59,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 22:04:59,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:59,766 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:04:59,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:59,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1272142052, now seen corresponding path program 8 times [2022-03-15 22:04:59,767 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:59,767 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642181945] [2022-03-15 22:04:59,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:59,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:05:00,216 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:05:00,216 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:05:00,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642181945] [2022-03-15 22:05:00,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642181945] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:05:00,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296211237] [2022-03-15 22:05:00,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:05:00,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:05:00,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:05:00,224 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:05:00,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 22:05:00,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:05:00,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:05:00,251 WARN L261 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 22:05:00,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:05:01,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 153 [2022-03-15 22:05:01,335 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:05:01,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:05:02,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:05:02,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:05:02,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:05:02,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:05:02,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:05:02,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:05:02,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:05:02,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:05:02,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:05:02,674 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:05:02,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 983 treesize of output 505 [2022-03-15 22:05:03,853 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:05:03,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296211237] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:05:03,854 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:05:03,854 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 22:05:03,854 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [737213492] [2022-03-15 22:05:03,854 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:05:03,855 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:05:03,862 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 173 transitions. [2022-03-15 22:05:03,862 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:05:22,270 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [48136#(and (or (= max1 (select A k)) (< j M) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (<= (select A k) max2)) (or (< j M) (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ (- 1) N))) (= max2 max1)) (or (<= (+ 2 k) N) (< j M)) (or (= max1 (select A (+ (- 1) N))) (< j M) (< (+ 2 k) N) (<= (select A k) max2) (<= (select A (+ (- 1) N)) (select A k))) (or (= max1 (select A (+ (- 1) N))) (<= (select A (+ (- 1) N)) max2) (< j M) (<= (+ max2 1) (select A k)) (< (+ 2 k) N))), 48123#(or (<= (+ k 1) N) (< j M) (< i N) (= max2 max1)), 48141#(and (or (= max1 (select A k)) (< j M) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (<= (select A k) max2) (< i N)) (or (= max1 (select A (+ (- 1) N))) (<= (select A (+ (- 1) N)) max2) (< j M) (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (< i N)) (or (<= (+ 2 k) N) (< j M) (< i N)) (or (< j M) (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ (- 1) N))) (< i N) (= max2 max1)) (or (= max1 (select A (+ (- 1) N))) (< j M) (< (+ 2 k) N) (<= (select A k) max2) (<= (select A (+ (- 1) N)) (select A k)) (< i N))), 48133#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= max1 (select A k)) (< max1 (select A (+ 2 i))) (<= (+ 2 k) N) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 k) N) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2) (<= (select A (+ 2 i)) max1))), 48116#(or (<= (+ k 1) N) (< i N) (= max2 max1)), 48140#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (= max1 (select A k)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (<= (select A k) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= (select A i) max1) (<= (select A (+ i 1)) (select A i)) (<= (select A k) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 48122#(or (<= (+ k 1) N) (< j M) (= max2 max1)), 48144#(and (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= (select A (+ k 1)) max2) (< (+ 2 i) N) (< j M) (< max2 (select A k)) (= (select A (+ k 1)) max1) (< max1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (<= (+ max2 1) (select A (+ k 1))) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (< j M) (< max2 (select A k)) (<= (+ max2 1) (select A (+ k 1))) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< max2 (select A k)) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A (+ k 1))) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (<= (+ 3 k) N) (= max1 (select A k)) (< (+ 2 i) N) (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (= (select A (+ k 1)) max1) (< max1 (select A (+ i 1))) (<= (select A k) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M))), 48149#(and (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (= max1 (select A k)) (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (<= (select A k) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A (+ k 1)) max2) (< j M) (< max2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A (+ k 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< j M) (<= (select A i) max1) (< max2 (select A k)) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< max2 (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A (+ k 1)) max2) (< max1 (select A (+ 2 i))) (< j M) (< max2 (select A k)) (< (+ 3 i) N) (= (select A (+ k 1)) max1)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (= (select A (+ k 1)) max1) (<= (select A k) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< j M) (< max2 (select A k)) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< max2 (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (<= (select A k) max2))), 48143#(and (or (= max1 (select A k)) (< j M) (< (+ 2 k) i) (<= (select A k) max2) (<= (+ (select A k) 1) (select A (+ (- 1) i)))) (or (<= (+ 2 k) i) (< j M)) (or (< j M) (= k 0)) (or (< j M) (<= (+ max2 1) (select A k)) (< (+ 2 k) i) (<= (+ max2 1) (select A (+ (- 1) i))) (= max2 max1)) (or (< j M) (<= (+ max2 1) (select A k)) (= (select A (+ (- 1) i)) max1) (<= (select A (+ (- 1) i)) max2) (< (+ 2 k) i)) (or (<= (select A (+ (- 1) i)) (select A k)) (< j M) (= (select A (+ (- 1) i)) max1) (< (+ 2 k) i) (<= (select A k) max2))), 48119#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2))), 48146#(and (or (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ 2 i)) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 48139#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (= max1 (select A k)) (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (< max1 (select A i)) (<= (select A k) max2))), 48148#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (= max1 (select A k)) (< max1 (select A (+ 2 i))) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A i)) (<= (select A k) max2))), 48129#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ i 1)) (= max1 (select A k)) (< (+ 2 i) N) (<= (+ 2 k) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A i) max1) (<= (select A (+ i 1)) (select A i)) (<= (select A k) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (<= (select A k) max2))), 48126#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 48142#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N))) (or (< (+ i 1) N) (< j M) (not (< i N)) (< (+ 2 k) N) (not (< max1 (select A i))) (<= (+ max2 1) (select A (+ (- 1) N))) (= (select A i) max2)) (or (< (+ i 1) N) (< j M) (<= (+ max2 1) (select A k)) (not (< i N)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ (- 1) N))) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (< j M) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (= (select A i) (select A k)) (not (< max1 (select A i)))) (or (= max1 (select A (+ (- 1) N))) (<= (select A (+ (- 1) N)) max2) (< (+ i 1) N) (< j M) (<= (+ max2 1) (select A k)) (not (< i N)) (< (+ 2 k) N) (< max1 (select A i))) (or (= max1 (select A (+ (- 1) N))) (< (+ i 1) N) (< j M) (not (< i N)) (< (+ 2 k) N) (< max1 (select A i)) (<= (select A k) max2) (<= (select A (+ (- 1) N)) (select A k))) (or (= max1 (select A k)) (< (+ i 1) N) (< j M) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (< max1 (select A i)) (<= (select A k) max2))), 48145#(and (or (< j M) (<= (+ max2 1) (select A k)) (= max2 max1)) (or (= max1 (select A k)) (< j M) (<= (select A k) max2)) (or (< j M) (= k 0)) (or (< j M) (<= (+ k 1) i))), 48128#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2))), 48120#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (= max1 (select A k)) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (< max1 (select A i)) (<= (select A k) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2))), 48134#(and (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (+ (select A k) 1) (select A (+ k 1))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (<= (select A k) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (= max1 (select A k)) (<= (+ (select A k) 1) (select A (+ k 1))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (<= (select A k) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< max2 (select A k)) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A (+ k 1)) max2) (< max1 (select A (+ 2 i))) (< max2 (select A k)) (< (+ 3 i) N) (= (select A (+ k 1)) max1)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< max2 (select A k)) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A i) max1) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A (+ k 1)) max2) (< max2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A (+ k 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< max2 (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (= (select A (+ k 1)) max1) (<= (select A k) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< max2 (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 48125#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 48117#(and (or (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< i N) (= max2 max1)) (or (= max1 (select A k)) (<= (+ 2 k) N) (<= (select A k) max2) (< i N))), 48131#(and (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1))), 48135#(and (or (= max1 (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A k) max2)) (or (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (= max2 max1))), 48150#(and (or (< j M) (= k i)) (or (< j M) (= max2 max1)) (or (< j M) (= k 0)) (or (< j M) (= i max2))), 48138#(and (or (= max1 (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A k) max2) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< i N) (= max2 max1))), 48113#(or (< j M) (= max2 max1)), 48115#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (< j M) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2))), 48147#(and (or (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ 2 i)) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< j M) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 48124#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1))), 48112#(and (or (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1))), 48130#(and (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= (select A (+ k 1)) max2) (< (+ 2 i) N) (< max2 (select A k)) (= (select A (+ k 1)) max1) (< max1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (= (select A (+ k 1)) max1) (< max1 (select A (+ i 1))) (<= (select A k) max2)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A (+ k 1))) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (<= (select A i) max1) (< max2 (select A k)) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (< max2 (select A k)) (<= (+ max2 1) (select A (+ k 1))) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (<= (select A i) max1) (<= (+ max2 1) (select A (+ k 1))) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (<= (+ 3 k) N) (= max1 (select A k)) (< (+ 2 i) N) (<= (+ (select A k) 1) (select A (+ k 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N))), 48118#(and (or (<= (+ 2 k) N) (< i N)) (or (= max1 (select A (+ (- 1) N))) (<= (select A (+ (- 1) N)) max2) (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (< i N)) (or (= max1 (select A (+ (- 1) N))) (< (+ 2 k) N) (<= (select A k) max2) (<= (select A (+ (- 1) N)) (select A k)) (< i N)) (or (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ (- 1) N))) (< i N) (= max2 max1)) (or (= max1 (select A k)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (<= (select A k) max2) (< i N))), 48127#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i)))), 48132#(and (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2))), 48121#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (= (select A i) (select A k)) (not (< max1 (select A i)))) (or (= max1 (select A (+ (- 1) N))) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (< max1 (select A i)) (<= (select A k) max2) (<= (select A (+ (- 1) N)) (select A k))) (or (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (not (< max1 (select A i))) (<= (+ max2 1) (select A (+ (- 1) N))) (= (select A i) max2)) (or (= max1 (select A (+ (- 1) N))) (<= (select A (+ (- 1) N)) max2) (< (+ i 1) N) (<= (+ max2 1) (select A k)) (not (< i N)) (< (+ 2 k) N) (< max1 (select A i))) (or (= max1 (select A k)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (< max1 (select A i)) (<= (select A k) max2)) (or (< (+ i 1) N) (<= (+ max2 1) (select A k)) (not (< i N)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ (- 1) N))) (< max1 (select A i)) (= max2 max1))), 48111#(or (< i N) (= max2 max1)), 48114#(or (< j M) (< i N) (= max2 max1)), 48137#(and (or (<= (+ (select A (+ (- 2) N)) 1) (select A (+ (- 1) N))) (< j M) (<= (+ max2 1) (select A k)) (= (select A (+ (- 2) N)) max1) (<= (select A (+ (- 2) N)) max2) (< (+ 3 k) N)) (or (< j M) (= k 0) (< (+ 3 k) N)) (or (<= (+ 3 k) N) (< j M)) (or (= max1 (select A (+ (- 1) N))) (<= (select A (+ (- 1) N)) max2) (< j M) (<= (+ max2 1) (select A (+ (- 2) N))) (<= (+ max2 1) (select A k)) (< (+ 3 k) N)) (or (= max1 (select A (+ (- 1) N))) (< j M) (< (+ 3 k) N) (<= (select A k) max2) (<= (select A (+ (- 1) N)) (select A k)) (<= (+ (select A k) 1) (select A (+ (- 2) N)))) (or (= max1 (select A (+ (- 1) N))) (< j M) (<= (+ max2 1) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= (select A (+ (- 2) N)) max2) (< (+ 3 k) N)) (or (< j M) (<= (+ max2 1) (select A (+ (- 2) N))) (<= (+ max2 1) (select A k)) (<= (+ max2 1) (select A (+ (- 1) N))) (< (+ 3 k) N) (= max2 max1)) (or (= max1 (select A k)) (< j M) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (< (+ 3 k) N) (<= (select A k) max2) (<= (+ (select A k) 1) (select A (+ (- 2) N)))) (or (<= (+ (select A (+ (- 2) N)) 1) (select A (+ (- 1) N))) (< j M) (= (select A (+ (- 2) N)) max1) (<= (select A (+ (- 2) N)) (select A k)) (< (+ 3 k) N) (<= (select A k) max2)) (or (= max1 (select A (+ (- 1) N))) (< j M) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= (select A (+ (- 2) N)) (select A k)) (< (+ 3 k) N) (<= (select A k) max2)))] [2022-03-15 22:05:22,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 22:05:22,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:05:22,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 22:05:22,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=3544, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:05:22,272 INFO L87 Difference]: Start difference. First operand 2108 states and 9784 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:06:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:27,562 INFO L93 Difference]: Finished difference Result 3018 states and 12763 transitions. [2022-03-15 22:06:27,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2022-03-15 22:06:27,562 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:06:27,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:27,588 INFO L225 Difference]: With dead ends: 3018 [2022-03-15 22:06:27,588 INFO L226 Difference]: Without dead ends: 2976 [2022-03-15 22:06:27,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 31 SyntacticMatches, 13 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19053 ImplicationChecksByTransitivity, 67.5s TimeCoverageRelationStatistics Valid=7675, Invalid=44081, Unknown=0, NotChecked=0, Total=51756 [2022-03-15 22:06:27,592 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 929 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:27,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [929 Valid, 0 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 2552 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 22:06:27,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2022-03-15 22:06:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2215. [2022-03-15 22:06:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 2214 states have (on average 4.625112917795844) internal successors, (10240), 2214 states have internal predecessors, (10240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 10240 transitions. [2022-03-15 22:06:27,653 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 10240 transitions. Word has length 17 [2022-03-15 22:06:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:27,653 INFO L470 AbstractCegarLoop]: Abstraction has 2215 states and 10240 transitions. [2022-03-15 22:06:27,654 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:06:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 10240 transitions. [2022-03-15 22:06:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:06:27,661 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:27,662 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:27,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 22:06:27,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:27,883 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:06:27,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:27,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2114457254, now seen corresponding path program 9 times [2022-03-15 22:06:27,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:27,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508197737] [2022-03-15 22:06:27,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:27,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:27,959 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:27,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508197737] [2022-03-15 22:06:27,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508197737] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:27,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236140380] [2022-03-15 22:06:27,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:06:27,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:27,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:27,964 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:06:27,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 22:06:27,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:06:27,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:27,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:06:27,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:28,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:28,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236140380] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:28,103 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:28,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-03-15 22:06:28,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1906655426] [2022-03-15 22:06:28,103 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:28,105 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:28,112 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:06:28,112 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:29,389 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [56062#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 56041#(or (<= N (+ k 1)) (< (+ 2 k) N)), 56045#(or (<= N i) (< k N)), 56066#(and (or (< j M) (= (+ max2 (* (- 1) i)) 0)) (or (< j M) (<= k max2))), 56064#(or (<= N (+ 2 i)) (< j M)), 56061#(or (<= N (+ i 1)) (< j M) (< k N)), 56058#(or (<= N (+ k 1)) (< j M) (<= (+ N 1) i) (< (+ 2 k) N)), 56049#(or (<= N (+ k 1)) (<= (+ N 1) i) (< (+ 2 k) N)), 56048#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 56055#(or (<= N i) (< j M)), 56057#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 56029#(or (< j M) (<= k (+ i 1))), 56053#(or (< j M) (<= (+ N 1) i) (< k N)), 56060#(or (<= N (+ i 1)) (< j M)), 56042#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 56050#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N)), 56059#(or (<= N (+ k 1)) (<= N i) (< j M) (< (+ 2 k) N)), 56056#(or (<= N i) (< j M) (< k N)), 56044#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 56051#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N)), 56036#(< k N), 56047#(or (<= N (+ i 1)) (< k N)), 56040#(or (< j M) (<= N k) (< (+ k 1) N)), 56065#(or (< j M) (<= k (+ 2 i))), 56038#(or (< j M) (< k N)), 56046#(or (<= N i) (<= N k) (< (+ k 1) N)), 56063#(or (<= N (+ k 1)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N)), 56037#(< j M), 56054#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 56039#(or (<= N k) (< (+ k 1) N)), 56043#(or (<= (+ N 1) i) (< k N)), 56052#(or (< j M) (<= (+ N 1) i))] [2022-03-15 22:06:29,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 22:06:29,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:29,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 22:06:29,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1765, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:06:29,390 INFO L87 Difference]: Start difference. First operand 2215 states and 10240 transitions. Second operand has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 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:06:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:31,551 INFO L93 Difference]: Finished difference Result 2815 states and 12315 transitions. [2022-03-15 22:06:31,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-15 22:06:31,552 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 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 17 [2022-03-15 22:06:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:31,563 INFO L225 Difference]: With dead ends: 2815 [2022-03-15 22:06:31,563 INFO L226 Difference]: Without dead ends: 2799 [2022-03-15 22:06:31,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3307 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2699, Invalid=10411, Unknown=0, NotChecked=0, Total=13110 [2022-03-15 22:06:31,565 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 315 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:31,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 0 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:06:31,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2022-03-15 22:06:31,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2316. [2022-03-15 22:06:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2316 states, 2315 states have (on average 4.6030237580993525) internal successors, (10656), 2315 states have internal predecessors, (10656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 10656 transitions. [2022-03-15 22:06:31,635 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 10656 transitions. Word has length 17 [2022-03-15 22:06:31,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:31,636 INFO L470 AbstractCegarLoop]: Abstraction has 2316 states and 10656 transitions. [2022-03-15 22:06:31,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 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:06:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 10656 transitions. [2022-03-15 22:06:31,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:06:31,643 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:31,643 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:31,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 22:06:31,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 22:06:31,855 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:06:31,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2888034, now seen corresponding path program 12 times [2022-03-15 22:06:31,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:31,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536965082] [2022-03-15 22:06:31,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:31,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:32,187 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:06:32,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:32,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536965082] [2022-03-15 22:06:32,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536965082] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:32,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270241190] [2022-03-15 22:06:32,188 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:06:32,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:32,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:32,189 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:06:32,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 22:06:32,214 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:06:32,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:32,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:06:32,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:33,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:06:33,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:06:33,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:06:33,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 153 [2022-03-15 22:06:33,263 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:06:33,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:34,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:06:34,814 INFO L353 Elim1Store]: treesize reduction 38, result has 73.0 percent of original size [2022-03-15 22:06:34,815 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 6 new quantified variables, introduced 14 case distinctions, treesize of input 903 treesize of output 543 [2022-03-15 22:06:55,219 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:06:55,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270241190] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:55,219 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:55,219 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 22:06:55,219 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1431418456] [2022-03-15 22:06:55,219 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:55,220 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:55,225 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 163 transitions. [2022-03-15 22:06:55,225 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:07:05,831 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [63788#(and (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (< (+ j 1) M) (<= (select A i) max1) (not (< j M)) (< max2 (select A j)) (= (select A i) max2)) (or (< (+ j 1) M) (<= (+ k 1) N) (not (< j M))) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max1) (<= (+ max1 1) (select A i))) (or (< (+ j 1) M) (<= (+ i 1) k) (not (< j M))) (or (< (+ j 1) M) (not (< max2 (select A j))) (<= (select A i) max1) (not (< j M)) (= (select A i) (select A j)))), 63779#(and (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max1) (<= (+ (select A j) 1) (select A k)) (< i N)) (or (< (+ j 1) M) (= max1 (select A k)) (not (< j M)) (< max2 (select A j)) (<= (select A k) max2) (< i N)) (or (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (not (< j M)) (< i N) (<= (select A k) (select A j))) (or (< (+ j 1) M) (<= (+ max2 1) (select A k)) (not (< j M)) (< max2 (select A j)) (< i N) (= max2 max1))), 63790#(and (or (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (<= (+ max1 1) (select A i)) (<= (select A (+ j 1)) max2)) (or (<= (+ i 1) k) (< (+ 2 j) M) (<= M (+ j 1))) (or (<= (select A i) max1) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A i) (select A (+ j 1))) (<= (select A (+ j 1)) max2)) (or (< max2 (select A (+ j 1))) (<= (select A i) max1) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A i) max2)) (or (<= (select A j) max2) (<= (select A (+ j 1)) (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (<= (+ max1 1) (select A i))) (or (<= (+ k 1) N) (< (+ 2 j) M) (<= M (+ j 1))) (or (<= (select A j) max2) (<= (select A i) max1) (= (select A i) (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (< (select A j) (select A (+ j 1)))) (or (<= (select A j) max2) (<= (select A (+ j 1)) (select A j)) (<= (select A i) max1) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A i) (select A (+ j 1)))) (or (< max2 (select A (+ j 1))) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= (select A j) max2) (< (+ 2 j) M) (= (select A j) max1) (<= M (+ j 1)) (< (select A j) (select A (+ j 1))) (<= (+ max1 1) (select A i)))), 63773#(and (or (< j M) (<= (+ max2 1) (select A k)) (= max2 max1)) (or (= max1 (select A k)) (< j M) (<= (select A k) max2))), 63785#(and (or (< j M) (not (= k i)) (= max2 max1)) (or (<= (+ k 1) N) (<= k i) (< j M)) (or (< j M) (< i (+ k 1)))), 63791#(and (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1))), 63775#(and (or (<= (select A j) max2) (<= (select A (+ j 1)) (select A j)) (<= (+ (select A (+ j 1)) 1) (select A k)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A (+ j 1)) max1)) (or (<= (select A j) max2) (<= (select A k) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (= max1 (select A k)) (< (+ 2 j) M) (<= M (+ j 1))) (or (<= (select A k) (select A (+ j 1))) (= max1 (select A k)) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (<= (select A (+ j 1)) max2)) (or (<= (+ (select A (+ j 1)) 1) (select A k)) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (<= (select A (+ j 1)) max2)) (or (< max2 (select A (+ j 1))) (<= (+ max2 1) (select A k)) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= max2 max1)) (or (<= (select A j) max2) (< (+ 2 j) M) (= (select A j) max1) (<= M (+ j 1)) (< (select A j) (select A (+ j 1))) (<= (+ (select A j) 1) (select A k))) (or (<= (select A j) max2) (= max1 (select A k)) (< (+ 2 j) M) (<= M (+ j 1)) (< (select A j) (select A (+ j 1))) (<= (select A k) (select A j))) (or (= max1 (select A k)) (< max2 (select A (+ j 1))) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (<= (select A k) max2))), 63781#(and (or (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1))), 63786#(and (or (< j M) (<= (select A i) max1) (= (select A i) max2)) (or (< j M) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= (+ k 1) N) (< j M)) (or (<= (+ i 1) k) (< j M))), 63787#(and (or (< (+ j 1) M) (not (< j M)) (< i (+ k 1))) (or (< (+ j 1) M) (not (= k i)) (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (= k i)) (not (< j M)) (= (select A j) max1)) (or (< (+ j 1) M) (<= (+ k 1) N) (<= k i) (not (< j M)))), 63789#(and (or (< max2 (select A (+ j 1))) (not (= k i)) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= max2 max1)) (or (< (+ 2 j) M) (<= M (+ j 1)) (< i (+ k 1))) (or (<= (select A j) max2) (<= (select A (+ j 1)) (select A j)) (not (= k i)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A (+ j 1)) max1)) (or (<= (select A j) max2) (not (= k i)) (< (+ 2 j) M) (= (select A j) max1) (<= M (+ j 1)) (< (select A j) (select A (+ j 1)))) (or (not (= k i)) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (<= (select A (+ j 1)) max2)) (or (<= (+ k 1) N) (<= k i) (< (+ 2 j) M) (<= M (+ j 1)))), 63774#(and (or (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (not (< j M)) (<= (select A k) (select A j))) (or (< (+ j 1) M) (<= (+ max2 1) (select A k)) (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max1) (<= (+ (select A j) 1) (select A k))) (or (< (+ j 1) M) (= max1 (select A k)) (not (< j M)) (< max2 (select A j)) (<= (select A k) max2))), 63776#(or (< i N) (= max2 max1)), 63777#(or (< j M) (< i N) (= max2 max1)), 63772#(or (< j M) (= max2 max1)), 63780#(and (or (<= (select A j) max2) (= max1 (select A k)) (< (+ 2 j) M) (<= M (+ j 1)) (< (select A j) (select A (+ j 1))) (< i N) (<= (select A k) (select A j))) (or (= max1 (select A k)) (< max2 (select A (+ j 1))) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (<= (select A k) max2) (< i N)) (or (<= (select A j) max2) (< (+ 2 j) M) (= (select A j) max1) (<= M (+ j 1)) (< (select A j) (select A (+ j 1))) (<= (+ (select A j) 1) (select A k)) (< i N)) (or (<= (select A j) max2) (<= (select A k) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (= max1 (select A k)) (< (+ 2 j) M) (<= M (+ j 1)) (< i N)) (or (<= (+ (select A (+ j 1)) 1) (select A k)) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (< i N) (<= (select A (+ j 1)) max2)) (or (<= (select A k) (select A (+ j 1))) (= max1 (select A k)) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (< i N) (<= (select A (+ j 1)) max2)) (or (<= (select A j) max2) (<= (select A (+ j 1)) (select A j)) (<= (+ (select A (+ j 1)) 1) (select A k)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (< i N)) (or (< max2 (select A (+ j 1))) (<= (+ max2 1) (select A k)) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (< i N) (= max2 max1))), 63792#(and (or (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ 2 i)) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 63783#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (< j M) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2))), 63778#(and (or (< j M) (<= (+ max2 1) (select A k)) (< i N) (= max2 max1)) (or (= max1 (select A k)) (< j M) (<= (select A k) max2) (< i N))), 63784#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i)))), 63782#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))))] [2022-03-15 22:07:05,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:07:05,831 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:07:05,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:07:05,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1787, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:07:05,832 INFO L87 Difference]: Start difference. First operand 2316 states and 10656 transitions. Second operand has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:29,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:07:29,681 INFO L93 Difference]: Finished difference Result 3926 states and 15244 transitions. [2022-03-15 22:07:29,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-03-15 22:07:29,681 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:07:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:07:29,690 INFO L225 Difference]: With dead ends: 3926 [2022-03-15 22:07:29,690 INFO L226 Difference]: Without dead ends: 3894 [2022-03-15 22:07:29,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4971 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=2326, Invalid=14704, Unknown=0, NotChecked=0, Total=17030 [2022-03-15 22:07:29,691 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 350 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 2103 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 2103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:07:29,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 0 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 2103 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 22:07:29,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3894 states. [2022-03-15 22:07:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3894 to 2434. [2022-03-15 22:07:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2433 states have (on average 4.577887381833128) internal successors, (11138), 2433 states have internal predecessors, (11138), 0 states have call successors, (0), 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:07:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 11138 transitions. [2022-03-15 22:07:29,771 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 11138 transitions. Word has length 17 [2022-03-15 22:07:29,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:07:29,771 INFO L470 AbstractCegarLoop]: Abstraction has 2434 states and 11138 transitions. [2022-03-15 22:07:29,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 11138 transitions. [2022-03-15 22:07:29,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:07:29,778 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:07:29,778 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:07:29,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 22:07:30,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 22:07:30,003 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:07:30,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:07:30,004 INFO L85 PathProgramCache]: Analyzing trace with hash -778125788, now seen corresponding path program 13 times [2022-03-15 22:07:30,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:07:30,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514213815] [2022-03-15 22:07:30,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:07:30,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:07:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:07:30,337 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:07:30,337 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:07:30,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514213815] [2022-03-15 22:07:30,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514213815] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:07:30,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879291148] [2022-03-15 22:07:30,338 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:07:30,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:07:30,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:07:30,339 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:07:30,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 22:07:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:07:30,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:07:30,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:07:33,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:07:33,623 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:07:33,623 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 239 treesize of output 169 [2022-03-15 22:07:33,869 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:07:33,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:07:37,240 INFO L353 Elim1Store]: treesize reduction 24, result has 83.0 percent of original size [2022-03-15 22:07:37,240 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 835 treesize of output 541 [2022-03-15 22:10:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:10:46,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879291148] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:10:46,842 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:10:46,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2022-03-15 22:10:46,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1100407512] [2022-03-15 22:10:46,842 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:10:46,843 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:10:46,849 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 133 transitions. [2022-03-15 22:10:46,849 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:11:01,121 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [72891#(and (or (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (not (= (select A j) max2)) (= max2 max1) (<= M j)) (or (<= (select A j) max2) (< (+ i 1) N) (not (< i N)) (= (select A i) (select A j)) (not (< max1 (select A i))) (<= M j)) (or (< (+ i 1) N) (not (< i N)) (< max2 (+ (select A j) 1)) (< max1 (select A i)) (= max2 max1) (<= M j)) (or (< (+ i 1) N) (not (< i N)) (< max2 (+ (select A j) 1)) (not (< max1 (select A i))) (<= M j) (= (select A i) max2)) (or (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (not (= (select A j) max2)) (<= M j) (= (select A i) max2)) (or (<= (select A j) max2) (< (+ i 1) N) (not (< i N)) (= (select A j) max1) (< max1 (select A i)) (<= M j))), 72895#(and (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1))), 72884#(and (or (= max1 (select A k)) (< max2 (select A j)) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (<= (select A (+ j 1)) max2)) (or (<= (select A (+ j 1)) (select A j)) (not (< max2 (select A j))) (<= (select A (+ j 1)) (select A k)) (<= M (+ j 1)) (= (select A (+ j 1)) max1)) (or (not (< max2 (select A j))) (= (select A j) max1) (<= M (+ j 1)) (<= (+ (select A j) 1) (select A (+ j 1))) (<= (+ (select A j) 1) (select A k))) (or (<= (select A (+ j 1)) (select A k)) (< max2 (select A j)) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (<= (select A (+ j 1)) max2)) (or (<= (select A (+ j 1)) (select A j)) (= max1 (select A k)) (not (< max2 (select A j))) (<= M (+ j 1)) (= (select A (+ j 1)) max1)) (or (<= (select A k) (select A (+ j 1))) (= max1 (select A k)) (not (< max2 (select A j))) (<= M (+ j 1)) (<= (select A k) (select A j))) (or (<= (select A k) (select A (+ j 1))) (= max1 (select A k)) (< max2 (select A j)) (<= M (+ j 1)) (<= (select A k) max2)) (or (<= (+ max2 1) (select A k)) (< max2 (select A j)) (<= (+ max2 1) (select A (+ j 1))) (<= M (+ j 1)) (= max2 max1))), 72898#(and (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2))), 72885#(and (or (<= (select A (+ j 1)) (select A j)) (= max1 (select A k)) (not (< max2 (select A j))) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (< i N)) (or (not (< max2 (select A j))) (= (select A j) max1) (<= M (+ j 1)) (<= (+ (select A j) 1) (select A (+ j 1))) (<= (+ (select A j) 1) (select A k)) (< i N)) (or (<= (+ max2 1) (select A k)) (< max2 (select A j)) (<= (+ max2 1) (select A (+ j 1))) (<= M (+ j 1)) (< i N) (= max2 max1)) (or (<= (select A k) (select A (+ j 1))) (= max1 (select A k)) (< max2 (select A j)) (<= M (+ j 1)) (<= (select A k) max2) (< i N)) (or (<= (select A k) (select A (+ j 1))) (= max1 (select A k)) (not (< max2 (select A j))) (<= M (+ j 1)) (< i N) (<= (select A k) (select A j))) (or (<= (select A (+ j 1)) (select A k)) (< max2 (select A j)) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (< i N) (<= (select A (+ j 1)) max2)) (or (= max1 (select A k)) (< max2 (select A j)) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (< i N) (<= (select A (+ j 1)) max2)) (or (<= (select A (+ j 1)) (select A j)) (not (< max2 (select A j))) (<= (select A (+ j 1)) (select A k)) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (< i N))), 72892#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 72888#(and (or (<= (select A j) max2) (= (select A j) max1) (< i N) (<= M j)) (or (< max2 (+ (select A j) 1)) (< i N) (= max2 max1) (<= M j)) (or (< i N) (not (= (select A j) max2)) (= max2 max1) (<= M j))), 72893#(and (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (= (select A j) max1) (< max1 (select A i)) (<= M j)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (not (= (select A j) max2)) (<= M j) (= (select A i) max2)) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) (select A j)) (<= M j)) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= (select A j) (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (<= M j)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (< max2 (+ (select A j) 1)) (= max2 (select A (+ i 1))) (< max1 (select A i)) (<= M j)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< max2 (+ (select A j) 1)) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (<= M j)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (not (= (select A j) max2)) (<= M j)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i)) (not (= (select A j) max2)) (<= M j)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< max2 (+ (select A j) 1)) (< (select A i) (select A (+ i 1))) (<= M j) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (not (= (select A j) max2)) (= max2 max1) (<= M j)) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= (select A j) (select A (+ i 1))) (< max1 (select A i)) (<= M j)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max2 (+ (select A j) 1)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1) (<= M j))), 72882#(or (< i N) (= max2 max1)), 72889#(or (< k N) (< i N) (= max2 max1)), 72886#(and (or (<= (+ k 1) N) (<= k i) (<= (+ M i) (+ N j)) (not (< j M))) (or (not (= k i)) (<= (+ M i) (+ N j)) (not (< j M)) (< max2 (select A j)) (<= (+ max2 1) (select A (+ j 1))) (= max2 max1)) (or (<= (select A (+ j 1)) (select A j)) (not (< max2 (select A j))) (not (= k i)) (<= (+ M i) (+ N j)) (not (< j M)) (= (select A (+ j 1)) max1)) (or (not (< max2 (select A j))) (not (= k i)) (<= (+ M i) (+ N j)) (not (< j M)) (= (select A j) max1) (<= (+ (select A j) 1) (select A (+ j 1)))) (or (not (= k i)) (<= (+ M i) (+ N j)) (not (< j M)) (< max2 (select A j)) (= (select A (+ j 1)) max1) (<= (select A (+ j 1)) max2)) (or (<= (+ M i) (+ 2 k j)) (<= (+ M i) (+ N j)) (not (< j M)) (< i (+ k 1)))), 72896#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 72890#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2))), 72887#(or (< k N) (= max2 max1)), 72894#(and (or (< i (+ 2 j)) (not (< j M))) (or (<= (+ M 1) N) (not (< j M))) (or (not (= (+ j 1) i)) (not (< j M)) (<= (+ M i) (+ k j 1))) (or (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (<= (+ k 1) N) (not (= (+ j 1) i)) (not (< j M))) (or (not (< max2 (select A j))) (not (< j M)) (= (select A j) max1))), 72897#(and (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) (select A j)) (<= M j)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (= (select A j) max2)) (<= M j) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2) (not (= (select A j) max2)) (<= M j)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< max2 (+ (select A j) 1)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i)) (<= M j)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< max2 (+ (select A j) 1)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (<= M j) (= (select A i) max2)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< max2 (+ (select A j) 1)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (<= M j)) (or (<= N (+ 2 i)) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2) (not (= (select A j) max2)) (<= M j)) (or (<= (select A j) max2) (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (<= M j)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (not (= (select A j) max2)) (= max2 max1) (<= M j)) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) (select A j)) (<= M j)) (or (<= (select A j) max2) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A j)) (<= M j)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i)) (not (= (select A j) max2)) (<= M j)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (not (= (select A j) max2)) (<= M j)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1) (not (= (select A j) max2)) (<= M j)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (not (= (select A j) max2)) (<= M j)) (or (<= N (+ 2 i)) (<= (select A i) max1) (< max2 (+ (select A j) 1)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2) (<= M j)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< max2 (+ (select A j) 1)) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= M j)) (or (<= (select A j) max2) (<= N (+ 2 i)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A (+ 2 i)) max1) (= (select A (+ 2 i)) (select A j)) (<= M j)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< max2 (+ (select A j) 1)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2) (<= M j)) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) (select A j)) (<= M j)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< max2 (+ (select A j) 1)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1) (<= M j)) (or (<= (select A j) max2) (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (= (select A j) max1) (< max1 (select A i)) (<= M j)) (or (<= N (+ 2 i)) (< max2 (+ (select A j) 1)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1) (<= M j)) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< max1 (select A i)) (<= M j))), 72883#(and (or (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1)))] [2022-03-15 22:11:01,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:11:01,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:11:01,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:11:01,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1672, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:11:01,122 INFO L87 Difference]: Start difference. First operand 2434 states and 11138 transitions. Second operand has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 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:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:12:15,572 INFO L93 Difference]: Finished difference Result 5058 states and 18765 transitions. [2022-03-15 22:12:15,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2022-03-15 22:12:15,572 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 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:12:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:12:15,583 INFO L225 Difference]: With dead ends: 5058 [2022-03-15 22:12:15,583 INFO L226 Difference]: Without dead ends: 5015 [2022-03-15 22:12:15,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15895 ImplicationChecksByTransitivity, 74.7s TimeCoverageRelationStatistics Valid=6739, Invalid=36317, Unknown=0, NotChecked=0, Total=43056 [2022-03-15 22:12:15,585 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 602 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:12:15,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 0 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 22:12:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5015 states. [2022-03-15 22:12:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5015 to 2545. [2022-03-15 22:12:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2544 states have (on average 4.559748427672956) internal successors, (11600), 2544 states have internal predecessors, (11600), 0 states have call successors, (0), 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:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 11600 transitions. [2022-03-15 22:12:15,678 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 11600 transitions. Word has length 17 [2022-03-15 22:12:15,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:12:15,678 INFO L470 AbstractCegarLoop]: Abstraction has 2545 states and 11600 transitions. [2022-03-15 22:12:15,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 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:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 11600 transitions. [2022-03-15 22:12:15,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:12:15,685 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:12:15,685 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:12:15,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 22:12:15,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:12:15,895 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:12:15,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:12:15,896 INFO L85 PathProgramCache]: Analyzing trace with hash 157231774, now seen corresponding path program 14 times [2022-03-15 22:12:15,896 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:12:15,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695846133] [2022-03-15 22:12:15,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:12:15,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:12:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:16,232 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:12:16,233 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:12:16,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695846133] [2022-03-15 22:12:16,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695846133] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:12:16,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532471657] [2022-03-15 22:12:16,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:12:16,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:12:16,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:12:16,236 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:12:16,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 22:12:16,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:12:16,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:12:16,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 22:12:16,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:12:17,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:12:17,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:12:17,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:12:17,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:12:17,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:12:17,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:12:17,135 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 251 treesize of output 153 [2022-03-15 22:12:17,328 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:12:17,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:12:18,877 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 22:12:18,877 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 907 treesize of output 527 [2022-03-15 22:12:58,084 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:12:58,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532471657] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:12:58,084 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:12:58,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 22:12:58,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1613907562] [2022-03-15 22:12:58,085 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:12:58,085 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:12:58,091 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:12:58,091 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:16,414 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 33 new interpolants: [83514#(or (<= (+ k 1) N) (< j M) (= max2 max1)), 83499#(and (or (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1))), 83503#(and (or (<= N (+ 2 i)) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A i) max2))), 83502#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i)))), 83506#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2))), 83527#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (= max1 (select A k)) (< max1 (select A (+ 2 i))) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 k) N) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2))), 83525#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (< max1 (select A i)) (<= (select A k) max2) (not (< max1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (= max1 (select A k)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (not (< (select A i) (select A (+ i 1)))) (not (< max1 (select A i))) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (< max1 (select A i)) (not (< max1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (not (< (select A i) (select A (+ i 1)))) (not (< max1 (select A i)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A i) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 83524#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2))), 83515#(and (or (= max1 (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A k) max2)) (or (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (= max2 max1))), 83516#(and (or (< j M) (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (= max2 max1)) (or (= max1 (select A k)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ (- 1) N))) (= max2 max1)) (or (= max1 (select A k)) (< j M) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (= max2 max1)) (or (<= (+ 2 k) N) (< j M)) (or (= max1 (select A (+ (- 1) N))) (<= (select A (+ (- 1) N)) max2) (< j M) (<= (+ max2 1) (select A k)) (< (+ 2 k) N)) (or (= max1 (select A (+ (- 1) N))) (= max1 (select A k)) (< j M) (< (+ 2 k) N) (<= (select A k) max2)) (or (= max1 (select A (+ (- 1) N))) (< j M) (< (+ 2 k) N) (<= (select A (+ (- 1) N)) (select A k)) (= max2 max1)) (or (= max1 (select A k)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ (- 1) N))) (<= (select A k) max2))), 83496#(or (< j M) (= max2 max1)), 83519#(and (or (= max1 (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A k) max2) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< i N) (= max2 max1))), 83501#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 83512#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 k) N) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= max1 (select A k)) (< max1 (select A (+ 2 i))) (<= (+ 2 k) N) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2) (<= (select A (+ 2 i)) max1))), 83518#(or (<= (+ k 1) N) (< j M) (< i N) (= max2 max1)), 83511#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (not (< (select A i) (select A (+ i 1)))) (not (< max1 (select A i)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A i) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< max1 (select A i)) (<= (select A k) max2) (not (< max1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (not (< (select A i) (select A (+ i 1)))) (not (< max1 (select A i))) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (not (< (+ i 1) N)) (= max1 (select A k)) (< (+ 2 i) N) (<= (+ 2 k) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (< max1 (select A i)) (not (< max1 (select A (+ i 1)))))), 83507#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 83504#(and (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< j M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= N (+ 2 i)) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i)))), 83513#(and (or (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< i k) (not (< i N))) (or (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (not (< i N)) (<= k (+ i 1)))), 83523#(and (or (< (+ j 1) M) (<= (+ max2 1) (select A k)) (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (< (+ j 1) M) (= 0 (+ (* (- 1) (select A k)) max1)) (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (= 0 (+ (* (- 1) (select A k)) max1)) (not (< j M)) (= (select A j) max1)) (or (< (+ j 1) M) (not (< j M)) (<= (select A k) max1)) (or (< (+ j 1) M) (<= (+ k 1) i) (not (< j M))) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max1) (<= (+ (select A j) 1) (select A k)))), 83498#(or (< j M) (< i N) (= max2 max1)), 83521#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (= max1 (select A k)) (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (< max1 (select A i)) (<= (select A k) max2))), 83510#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (= max1 (select A k)) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (< max1 (select A i)) (<= (select A k) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2))), 83497#(or (< i N) (= max2 max1)), 83509#(and (or (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< i N) (= max2 max1)) (or (= max1 (select A k)) (<= (+ 2 k) N) (<= (select A k) max2) (< i N))), 83505#(or (<= (+ k 1) N) (< i N) (= max2 max1)), 83517#(and (or (= max1 (select A (+ (- 1) N))) (< (+ j 1) M) (not (< max2 (select A j))) (< (+ 2 k) N) (not (< j M)) (= (select A j) max1) (<= (select A (+ (- 1) N)) (select A k))) (or (= max1 (select A (+ (- 1) N))) (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (< (+ 2 k) N) (not (< j M)) (<= (select A k) (select A j))) (or (< (+ j 1) M) (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (< (+ j 1) M) (= max1 (select A k)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A j) 1) (select A (+ (- 1) N))) (= (select A j) max1)) (or (< (+ j 1) M) (= max1 (select A k)) (< (+ 2 k) N) (not (< j M)) (< max2 (select A j)) (<= (+ max2 1) (select A (+ (- 1) N))) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (not (< j M)) (= (select A j) max1) (<= (+ (select A j) 1) (select A k))) (or (= max1 (select A (+ (- 1) N))) (< (+ j 1) M) (<= (select A (+ (- 1) N)) max2) (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (not (< j M)) (< max2 (select A j))) (or (< (+ j 1) M) (= max1 (select A k)) (< (+ 2 k) N) (not (< j M)) (< max2 (select A j)) (<= (+ max2 1) (select A (+ (- 1) N))) (<= (select A k) max2)) (or (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (not (< j M)) (= (select A j) max1)) (or (= max1 (select A (+ (- 1) N))) (< (+ j 1) M) (not (< max2 (select A j))) (< (+ 2 k) N) (not (< j M)) (<= (select A (+ (- 1) N)) (select A j)) (<= (+ (select A j) 1) (select A k))) (or (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A j) 1) (select A (+ (- 1) N))) (<= (select A k) (select A j))) (or (= max1 (select A (+ (- 1) N))) (< (+ j 1) M) (= max1 (select A k)) (< (+ 2 k) N) (not (< j M)) (< max2 (select A j)) (<= (select A k) max2)) (or (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M))) (or (= max1 (select A (+ (- 1) N))) (< (+ j 1) M) (< (+ 2 k) N) (not (< j M)) (< max2 (select A j)) (<= (select A (+ (- 1) N)) (select A k)) (= max2 max1))), 83520#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1))), 83508#(and (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (not (< max1 (select A i))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2))), 83528#(and (or (< i k) (not (< i N))) (or (not (= (+ i 1) k)) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (<= (+ k j) (+ M i 1)) (not (< i N))) (or (not (= (+ i 1) k)) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2))), 83500#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (< j M) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2))), 83522#(and (or (< j M) (<= (+ max2 1) (select A k)) (= max2 max1)) (or (< j M) (<= (select A k) max1)) (or (< j M) (= 0 (+ (* (- 1) (select A k)) max1)) (= max2 max1)) (or (< j M) (<= (+ k 1) i))), 83526#(and (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< j M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (not (< max1 (select A i))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< j M) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)))] [2022-03-15 22:13:16,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 22:13:16,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:16,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 22:13:16,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2932, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:13:16,416 INFO L87 Difference]: Start difference. First operand 2545 states and 11600 transitions. Second operand has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 0 states have call successors, (0), 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:46,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:46,750 INFO L93 Difference]: Finished difference Result 5503 states and 20409 transitions. [2022-03-15 22:14:46,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 269 states. [2022-03-15 22:14:46,750 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 0 states have call successors, (0), 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:14:46,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:46,761 INFO L225 Difference]: With dead ends: 5503 [2022-03-15 22:14:46,761 INFO L226 Difference]: Without dead ends: 5379 [2022-03-15 22:14:46,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 36 SyntacticMatches, 13 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34094 ImplicationChecksByTransitivity, 90.0s TimeCoverageRelationStatistics Valid=12912, Invalid=81030, Unknown=0, NotChecked=0, Total=93942 [2022-03-15 22:14:46,765 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1058 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 4818 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 4818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:46,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1058 Valid, 0 Invalid, 5166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 4818 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-03-15 22:14:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2022-03-15 22:14:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 2641. [2022-03-15 22:14:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2641 states, 2640 states have (on average 4.573484848484848) internal successors, (12074), 2640 states have internal predecessors, (12074), 0 states have call successors, (0), 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:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 12074 transitions. [2022-03-15 22:14:46,854 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 12074 transitions. Word has length 17 [2022-03-15 22:14:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:46,854 INFO L470 AbstractCegarLoop]: Abstraction has 2641 states and 12074 transitions. [2022-03-15 22:14:46,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 0 states have call successors, (0), 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:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 12074 transitions. [2022-03-15 22:14:46,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:14:46,861 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:46,862 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:46,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-03-15 22:14:47,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:47,082 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:47,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:47,082 INFO L85 PathProgramCache]: Analyzing trace with hash -965868444, now seen corresponding path program 15 times [2022-03-15 22:14:47,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:47,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753419604] [2022-03-15 22:14:47,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:47,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:47,872 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:47,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753419604] [2022-03-15 22:14:47,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753419604] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:47,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164277958] [2022-03-15 22:14:47,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:14:47,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:47,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:47,874 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:14:47,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 22:14:47,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:14:47,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:47,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:14:47,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:52,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:14:52,400 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:14:52,400 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 239 treesize of output 169 [2022-03-15 22:14:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:52,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:55,555 INFO L353 Elim1Store]: treesize reduction 24, result has 83.0 percent of original size [2022-03-15 22:14:55,556 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 847 treesize of output 541 Received shutdown request... [2022-03-15 22:16:21,724 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 22:16:21,726 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:16:21,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:21,746 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:16:21,746 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:16:21,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 22:16:21,926 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 3 for 21ms.. [2022-03-15 22:16:21,928 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:16:21,928 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:16:21,928 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:16:21,929 INFO L732 BasicCegarLoop]: Path program histogram: [15, 9, 1, 1, 1] [2022-03-15 22:16:21,931 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:16:21,931 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:16:21,933 INFO L202 PluginConnector]: Adding new model max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:16:21 BasicIcfg [2022-03-15 22:16:21,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:16:21,933 INFO L158 Benchmark]: Toolchain (without parser) took 760266.98ms. Allocated memory was 183.5MB in the beginning and 798.0MB in the end (delta: 614.5MB). Free memory was 141.1MB in the beginning and 296.5MB in the end (delta: -155.4MB). Peak memory consumption was 619.1MB. Max. memory is 8.0GB. [2022-03-15 22:16:21,933 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.29ms. Allocated memory is still 183.5MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:16:21,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.64ms. Allocated memory is still 183.5MB. Free memory was 141.1MB in the beginning and 139.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:16:21,934 INFO L158 Benchmark]: Boogie Preprocessor took 23.07ms. Allocated memory is still 183.5MB. Free memory was 139.5MB in the beginning and 138.6MB in the end (delta: 906.8kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:16:21,934 INFO L158 Benchmark]: RCFGBuilder took 265.65ms. Allocated memory is still 183.5MB. Free memory was 138.5MB in the beginning and 129.1MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:16:21,934 INFO L158 Benchmark]: TraceAbstraction took 759949.96ms. Allocated memory was 183.5MB in the beginning and 798.0MB in the end (delta: 614.5MB). Free memory was 128.5MB in the beginning and 296.5MB in the end (delta: -168.0MB). Peak memory consumption was 606.5MB. Max. memory is 8.0GB. [2022-03-15 22:16:21,935 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.29ms. Allocated memory is still 183.5MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.64ms. Allocated memory is still 183.5MB. Free memory was 141.1MB in the beginning and 139.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.07ms. Allocated memory is still 183.5MB. Free memory was 139.5MB in the beginning and 138.6MB in the end (delta: 906.8kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 265.65ms. Allocated memory is still 183.5MB. Free memory was 138.5MB in the beginning and 129.1MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 759949.96ms. Allocated memory was 183.5MB in the beginning and 798.0MB in the end (delta: 614.5MB). Free memory was 128.5MB in the beginning and 296.5MB in the end (delta: -168.0MB). Peak memory consumption was 606.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 36 PlacesBefore, 25 PlacesAfterwards, 29 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 106, positive conditional: 0, positive unconditional: 106, 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: 66, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 106, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 66, unknown conditional: 0, unknown unconditional: 66] , 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: 65]: 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 3 for 21ms.. - TimeoutResultAtElement [Line: 58]: 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 3 for 21ms.. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 21ms.. - TimeoutResultAtElement [Line: 58]: 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 3 for 21ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 42 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 759.8s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.1s, AutomataDifference: 295.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7790 SdHoareTripleChecker+Valid, 18.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7790 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 15.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6645 mSDsCounter, 3273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26662 IncrementalHoareTripleChecker+Invalid, 29935 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3273 mSolverCounterUnsat, 0 mSDtfsCounter, 26662 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3523 GetRequests, 1086 SyntacticMatches, 112 SemanticMatches, 2325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120344 ImplicationChecksByTransitivity, 296.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2641occurred in iteration=26, InterpolantAutomatonStates: 1879, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 18539 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 278.1s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 1034 ConstructedInterpolants, 10 QuantifiedInterpolants, 26118 SizeOfPredicates, 81 NumberOfNonLiveVariables, 1486 ConjunctsInSsa, 340 ConjunctsInUnsatCore, 72 InterpolantComputations, 3 PerfectInterpolantSequences, 150/485 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