/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/array-sum-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:51:24,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:51:24,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:51:24,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:51:24,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:51:24,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:51:24,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:51:24,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:51:24,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:51:24,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:51:24,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:51:24,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:51:24,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:51:24,973 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:51:24,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:51:24,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:51:24,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:51:24,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:51:24,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:51:24,980 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:51:24,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:51:24,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:51:24,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:51:24,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:51:24,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:51:24,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:51:24,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:51:24,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:51:24,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:51:24,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:51:24,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:51:24,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:51:24,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:51:24,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:51:24,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:51:24,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:51:24,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:51:24,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:51:24,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:51:24,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:51:24,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:51:24,995 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 21:51:25,024 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:51:25,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:51:25,025 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:51:25,025 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:51:25,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:51:25,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:51:25,026 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:51:25,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:51:25,026 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:51:25,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:51:25,027 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:51:25,027 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:51:25,027 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:51:25,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:51:25,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:51:25,028 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:51:25,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:51:25,028 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:51:25,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:51:25,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:51:25,028 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:51:25,028 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:51:25,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:51:25,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:51:25,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:51:25,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:51:25,029 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:51:25,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:51:25,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:51:25,029 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:51:25,029 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:51:25,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:51:25,030 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 21:51:25,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:51:25,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:51:25,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:51:25,290 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:51:25,290 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:51:25,291 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/array-sum-alt.wvr.bpl [2022-03-15 21:51:25,292 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/array-sum-alt.wvr.bpl' [2022-03-15 21:51:25,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:51:25,318 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:51:25,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:51:25,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:51:25,320 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:51:25,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:25" (1/1) ... [2022-03-15 21:51:25,337 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:25" (1/1) ... [2022-03-15 21:51:25,342 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:51:25,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:51:25,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:51:25,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:51:25,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:51:25,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:25" (1/1) ... [2022-03-15 21:51:25,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:25" (1/1) ... [2022-03-15 21:51:25,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:25" (1/1) ... [2022-03-15 21:51:25,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:25" (1/1) ... [2022-03-15 21:51:25,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:25" (1/1) ... [2022-03-15 21:51:25,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:25" (1/1) ... [2022-03-15 21:51:25,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:25" (1/1) ... [2022-03-15 21:51:25,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:51:25,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:51:25,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:51:25,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:51:25,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:25" (1/1) ... [2022-03-15 21:51:25,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:51:25,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:25,388 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 21:51:25,413 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 21:51:25,427 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:51:25,428 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:51:25,428 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:51:25,428 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:51:25,428 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:51:25,428 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:51:25,428 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:51:25,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:51:25,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:51:25,429 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:51:25,429 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:51:25,429 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:51:25,430 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 21:51:25,473 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:51:25,474 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:51:25,591 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:51:25,613 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:51:25,613 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 21:51:25,615 INFO L202 PluginConnector]: Adding new model array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:51:25 BoogieIcfgContainer [2022-03-15 21:51:25,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:51:25,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:51:25,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:51:25,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:51:25,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:51:25" (1/2) ... [2022-03-15 21:51:25,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97661ad and model type array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:51:25, skipping insertion in model container [2022-03-15 21:51:25,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:51:25" (2/2) ... [2022-03-15 21:51:25,621 INFO L111 eAbstractionObserver]: Analyzing ICFG array-sum-alt.wvr.bpl [2022-03-15 21:51:25,625 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:51:25,625 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:51:25,625 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:51:25,626 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:51:25,670 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 21:51:25,742 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:51:25,754 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 21:51:25,754 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 21:51:25,765 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:51:25,775 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 32 transitions, 88 flow [2022-03-15 21:51:25,781 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 32 transitions, 88 flow [2022-03-15 21:51:25,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 88 flow [2022-03-15 21:51:25,830 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2022-03-15 21:51:25,830 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 21:51:25,839 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2022-03-15 21:51:25,841 INFO L116 LiptonReduction]: Number of co-enabled transitions 210 [2022-03-15 21:51:26,182 INFO L131 LiptonReduction]: Checked pairs total: 178 [2022-03-15 21:51:26,183 INFO L133 LiptonReduction]: Total number of compositions: 15 [2022-03-15 21:51:26,190 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 21:51:26,219 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 21:51:26,221 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 21:51:26,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 21:51:26,226 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:26,226 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:26,227 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:26,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:26,231 INFO L85 PathProgramCache]: Analyzing trace with hash 767944004, now seen corresponding path program 1 times [2022-03-15 21:51:26,246 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:26,247 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337700359] [2022-03-15 21:51:26,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:26,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:26,455 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 21:51:26,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:26,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337700359] [2022-03-15 21:51:26,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337700359] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:51:26,457 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:51:26,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 21:51:26,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [814755511] [2022-03-15 21:51:26,459 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:26,462 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:26,487 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 21:51:26,488 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:26,868 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:51:26,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:51:26,869 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:26,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:51:26,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:51:26,889 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 21:51:26,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:26,924 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 21:51:26,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:51:26,926 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 21:51:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:26,934 INFO L225 Difference]: With dead ends: 45 [2022-03-15 21:51:26,934 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 21:51:26,936 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 21:51:26,944 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 21:51:26,946 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 21:51:26,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 21:51:26,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 21:51:26,984 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 21:51:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 21:51:26,988 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 21:51:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:26,989 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 21:51:26,989 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 21:51:26,989 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 21:51:26,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 21:51:26,991 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:26,991 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:26,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:51:26,992 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:26,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:26,994 INFO L85 PathProgramCache]: Analyzing trace with hash -953724044, now seen corresponding path program 1 times [2022-03-15 21:51:26,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:26,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396846418] [2022-03-15 21:51:26,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:26,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:27,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:27,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396846418] [2022-03-15 21:51:27,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396846418] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:51:27,038 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:51:27,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 21:51:27,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1292243020] [2022-03-15 21:51:27,038 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:27,040 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:27,043 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 21:51:27,043 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:27,363 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [225#(<= N i), 227#(< j M), 229#(or (<= N i) (< j M)), 226#(or (<= (+ k 1) N) (<= N i)), 230#(or (<= N i) (< j M) (< k N)), 228#(or (<= (+ k 1) N) (< j M))] [2022-03-15 21:51:27,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 21:51:27,373 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:27,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 21:51:27,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:51:27,374 INFO L87 Difference]: Start difference. First operand 41 states and 108 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:27,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:27,763 INFO L93 Difference]: Finished difference Result 79 states and 200 transitions. [2022-03-15 21:51:27,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:51:27,763 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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 21:51:27,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:27,765 INFO L225 Difference]: With dead ends: 79 [2022-03-15 21:51:27,765 INFO L226 Difference]: Without dead ends: 78 [2022-03-15 21:51:27,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2022-03-15 21:51:27,766 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:27,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:51:27,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-03-15 21:51:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 38. [2022-03-15 21:51:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 37 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 101 transitions. [2022-03-15 21:51:27,774 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 101 transitions. Word has length 12 [2022-03-15 21:51:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:27,774 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 101 transitions. [2022-03-15 21:51:27,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:27,775 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 101 transitions. [2022-03-15 21:51:27,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 21:51:27,775 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:27,776 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:27,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 21:51:27,776 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:27,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:27,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1764089077, now seen corresponding path program 1 times [2022-03-15 21:51:27,777 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:27,777 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179304077] [2022-03-15 21:51:27,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:27,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:27,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:27,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179304077] [2022-03-15 21:51:27,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179304077] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:27,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042578062] [2022-03-15 21:51:27,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:27,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:27,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:27,809 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 21:51:27,831 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 21:51:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:27,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:51:27,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:27,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:27,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042578062] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:27,960 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:27,960 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-03-15 21:51:27,960 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2040669559] [2022-03-15 21:51:27,960 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:27,961 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:27,964 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 21:51:27,964 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:28,219 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [480#(< k N), 481#(or (<= N k) (< (+ k 1) N))] [2022-03-15 21:51:28,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:51:28,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:28,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:51:28,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:51:28,220 INFO L87 Difference]: Start difference. First operand 38 states and 101 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:28,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:28,349 INFO L93 Difference]: Finished difference Result 95 states and 250 transitions. [2022-03-15 21:51:28,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:51:28,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 21:51:28,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:28,353 INFO L225 Difference]: With dead ends: 95 [2022-03-15 21:51:28,353 INFO L226 Difference]: Without dead ends: 95 [2022-03-15 21:51:28,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:51:28,354 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:28,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:51:28,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-03-15 21:51:28,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 68. [2022-03-15 21:51:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 2.955223880597015) internal successors, (198), 67 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 198 transitions. [2022-03-15 21:51:28,364 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 198 transitions. Word has length 12 [2022-03-15 21:51:28,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:28,364 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 198 transitions. [2022-03-15 21:51:28,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 198 transitions. [2022-03-15 21:51:28,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 21:51:28,367 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:28,367 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:28,393 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 21:51:28,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:28,583 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:28,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:28,584 INFO L85 PathProgramCache]: Analyzing trace with hash -317486244, now seen corresponding path program 1 times [2022-03-15 21:51:28,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:28,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511473012] [2022-03-15 21:51:28,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:28,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:28,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:28,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511473012] [2022-03-15 21:51:28,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511473012] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:28,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382214371] [2022-03-15 21:51:28,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:28,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:28,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:28,631 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 21:51:28,647 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 21:51:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:28,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:51:28,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:28,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:28,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382214371] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:28,758 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 21:51:28,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2022-03-15 21:51:28,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1020187743] [2022-03-15 21:51:28,758 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:28,759 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:28,762 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 56 transitions. [2022-03-15 21:51:28,762 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:28,938 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [794#(or (< (+ j 1) M) (<= M j)), 793#(< j M)] [2022-03-15 21:51:28,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:51:28,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:28,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:51:28,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:51:28,940 INFO L87 Difference]: Start difference. First operand 68 states and 198 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:29,042 INFO L93 Difference]: Finished difference Result 125 states and 326 transitions. [2022-03-15 21:51:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:51:29,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 21:51:29,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:29,045 INFO L225 Difference]: With dead ends: 125 [2022-03-15 21:51:29,045 INFO L226 Difference]: Without dead ends: 125 [2022-03-15 21:51:29,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:51:29,048 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:29,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:51:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-03-15 21:51:29,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 82. [2022-03-15 21:51:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.888888888888889) internal successors, (234), 81 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 234 transitions. [2022-03-15 21:51:29,062 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 234 transitions. Word has length 12 [2022-03-15 21:51:29,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:29,062 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 234 transitions. [2022-03-15 21:51:29,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 234 transitions. [2022-03-15 21:51:29,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:51:29,063 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:29,063 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:29,089 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 21:51:29,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 21:51:29,264 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:29,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:29,265 INFO L85 PathProgramCache]: Analyzing trace with hash -68012859, now seen corresponding path program 1 times [2022-03-15 21:51:29,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:29,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7819689] [2022-03-15 21:51:29,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:29,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:29,393 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 21:51:29,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:29,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7819689] [2022-03-15 21:51:29,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7819689] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:29,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486884475] [2022-03-15 21:51:29,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:29,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:29,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:29,400 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 21:51:29,429 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 21:51:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:29,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 21:51:29,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:29,614 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:51:29,615 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 30 [2022-03-15 21:51:29,662 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 21:51:29,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:29,709 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:29,710 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 11 treesize of output 16 [2022-03-15 21:51:29,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 21:51:29,781 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 21:51:29,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486884475] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:29,782 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:29,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-03-15 21:51:29,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [135681842] [2022-03-15 21:51:29,782 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:29,784 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:29,787 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 21:51:29,788 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:30,410 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1173#(and (or (< j M) (<= res1 (+ res2 (select A k)))) (or (< j M) (<= (+ res2 (select A k)) res1))), 1177#(and (or (< j M) (<= (+ res2 (select A k)) (+ (select A i) res1))) (or (< j M) (<= (+ (select A i) res1) (+ res2 (select A k))))), 1176#(and (<= (+ (select A i) res1) (+ res2 (select A k))) (<= (+ res2 (select A k)) (+ (select A i) res1))), 1174#(and (<= (+ (select A i) res1) res2) (< res2 (+ (select A i) res1 1))), 1175#(and (or (< j M) (<= (+ (select A i) res1) res2)) (or (< j M) (< res2 (+ (select A i) res1 1)))), 1172#(and (or (<= res1 res2) (< j M)) (or (< j M) (< res2 (+ res1 1))))] [2022-03-15 21:51:30,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:51:30,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:30,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:51:30,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:51:30,411 INFO L87 Difference]: Start difference. First operand 82 states and 234 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:30,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:30,576 INFO L93 Difference]: Finished difference Result 120 states and 337 transitions. [2022-03-15 21:51:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 21:51:30,577 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 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 21:51:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:30,578 INFO L225 Difference]: With dead ends: 120 [2022-03-15 21:51:30,578 INFO L226 Difference]: Without dead ends: 116 [2022-03-15 21:51:30,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:51:30,579 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:30,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:51:30,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-03-15 21:51:30,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-03-15 21:51:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 3.020618556701031) internal successors, (293), 97 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 293 transitions. [2022-03-15 21:51:30,585 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 293 transitions. Word has length 13 [2022-03-15 21:51:30,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:30,586 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 293 transitions. [2022-03-15 21:51:30,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:30,586 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 293 transitions. [2022-03-15 21:51:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:51:30,587 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:30,587 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:30,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 21:51:30,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:30,788 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:30,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:30,789 INFO L85 PathProgramCache]: Analyzing trace with hash 396056310, now seen corresponding path program 2 times [2022-03-15 21:51:30,789 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:30,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310478555] [2022-03-15 21:51:30,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:30,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:51:30,810 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:30,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310478555] [2022-03-15 21:51:30,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310478555] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:51:30,811 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:51:30,811 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:51:30,811 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [118661398] [2022-03-15 21:51:30,811 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:30,812 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:30,816 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 68 transitions. [2022-03-15 21:51:30,816 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:30,967 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1499#(< k N), 1498#(< i N), 1501#(or (<= N (+ k 1)) (< (+ 2 k) N)), 1500#(or (<= N k) (< (+ k 1) N))] [2022-03-15 21:51:30,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:51:30,968 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:30,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:51:30,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:51:30,968 INFO L87 Difference]: Start difference. First operand 98 states and 293 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:31,069 INFO L93 Difference]: Finished difference Result 108 states and 285 transitions. [2022-03-15 21:51:31,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:51:31,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 21:51:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:31,070 INFO L225 Difference]: With dead ends: 108 [2022-03-15 21:51:31,071 INFO L226 Difference]: Without dead ends: 104 [2022-03-15 21:51:31,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:51:31,072 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:31,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:51:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-03-15 21:51:31,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2022-03-15 21:51:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 2.8117647058823527) internal successors, (239), 85 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 239 transitions. [2022-03-15 21:51:31,090 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 239 transitions. Word has length 13 [2022-03-15 21:51:31,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:31,090 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 239 transitions. [2022-03-15 21:51:31,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:31,091 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 239 transitions. [2022-03-15 21:51:31,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:51:31,093 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:31,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:31,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 21:51:31,094 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:31,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:31,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1611732602, now seen corresponding path program 1 times [2022-03-15 21:51:31,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:31,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487824459] [2022-03-15 21:51:31,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:31,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:31,167 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 21:51:31,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:31,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487824459] [2022-03-15 21:51:31,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487824459] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:31,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899992215] [2022-03-15 21:51:31,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:31,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:31,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:31,169 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 21:51:31,170 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 21:51:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:31,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 21:51:31,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:31,268 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 15 treesize of output 11 [2022-03-15 21:51:31,291 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 21:51:31,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:31,347 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:31,348 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 11 treesize of output 16 [2022-03-15 21:51:31,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 21:51:31,372 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 21:51:31,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899992215] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:31,372 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:31,372 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-03-15 21:51:31,372 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1726479380] [2022-03-15 21:51:31,372 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:31,373 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:31,377 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 79 transitions. [2022-03-15 21:51:31,377 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:31,815 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1868#(and (<= (+ (select A i) res1) (+ (select A j) res2)) (<= (+ (select A j) res2) (+ (select A i) res1))), 1867#(and (<= (+ (select A i) res1) res2) (< res2 (+ (select A i) res1 1)))] [2022-03-15 21:51:31,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 21:51:31,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:31,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 21:51:31,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:51:31,816 INFO L87 Difference]: Start difference. First operand 86 states and 239 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:31,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:31,901 INFO L93 Difference]: Finished difference Result 116 states and 319 transitions. [2022-03-15 21:51:31,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:51:31,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 21:51:31,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:31,902 INFO L225 Difference]: With dead ends: 116 [2022-03-15 21:51:31,902 INFO L226 Difference]: Without dead ends: 112 [2022-03-15 21:51:31,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:51:31,903 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:31,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:51:31,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-03-15 21:51:31,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2022-03-15 21:51:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 2.8444444444444446) internal successors, (256), 90 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 256 transitions. [2022-03-15 21:51:31,913 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 256 transitions. Word has length 13 [2022-03-15 21:51:31,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:31,914 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 256 transitions. [2022-03-15 21:51:31,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 256 transitions. [2022-03-15 21:51:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:51:31,914 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:31,914 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:31,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 21:51:32,135 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 21:51:32,135 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:32,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:32,136 INFO L85 PathProgramCache]: Analyzing trace with hash 652778494, now seen corresponding path program 2 times [2022-03-15 21:51:32,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:32,143 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652478202] [2022-03-15 21:51:32,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:32,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:51:32,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:32,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652478202] [2022-03-15 21:51:32,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652478202] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:51:32,176 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:51:32,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:51:32,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1387337567] [2022-03-15 21:51:32,176 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:32,178 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:32,181 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 74 transitions. [2022-03-15 21:51:32,181 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:32,344 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [2173#(< i N), 2174#(or (< (+ 2 j) M) (<= M (+ j 1))), 2172#(or (< (+ j 1) M) (<= M j)), 2171#(< j M)] [2022-03-15 21:51:32,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:51:32,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:32,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:51:32,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:51:32,345 INFO L87 Difference]: Start difference. First operand 91 states and 256 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:32,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:32,433 INFO L93 Difference]: Finished difference Result 118 states and 309 transitions. [2022-03-15 21:51:32,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:51:32,434 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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 21:51:32,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:32,435 INFO L225 Difference]: With dead ends: 118 [2022-03-15 21:51:32,435 INFO L226 Difference]: Without dead ends: 112 [2022-03-15 21:51:32,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:51:32,435 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:32,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:51:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-03-15 21:51:32,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2022-03-15 21:51:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 2.9078947368421053) internal successors, (221), 76 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:32,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 221 transitions. [2022-03-15 21:51:32,439 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 221 transitions. Word has length 13 [2022-03-15 21:51:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:32,439 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 221 transitions. [2022-03-15 21:51:32,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 221 transitions. [2022-03-15 21:51:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:51:32,440 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:32,440 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:32,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 21:51:32,440 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:32,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:32,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1028598027, now seen corresponding path program 2 times [2022-03-15 21:51:32,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:32,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262296709] [2022-03-15 21:51:32,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:32,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:32,476 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 21:51:32,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:32,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262296709] [2022-03-15 21:51:32,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262296709] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:32,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679244356] [2022-03-15 21:51:32,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:51:32,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:32,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:32,478 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 21:51:32,507 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 21:51:32,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:51:32,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:32,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:51:32,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:32,560 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 21:51:32,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:32,605 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 21:51:32,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679244356] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:32,605 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:32,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-03-15 21:51:32,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1655456662] [2022-03-15 21:51:32,606 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:32,607 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:32,614 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 21:51:32,614 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:33,294 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [2550#(or (<= N i) (< j M) (< k N)), 2542#(or (<= (+ k 1) N) (< j M)), 2547#(or (<= (+ k 1) N) (<= N i)), 2544#(or (<= (+ 2 k) N) (< j M)), 2555#(or (<= N (+ i 1)) (<= (+ 2 k) N)), 2549#(or (<= N i) (< j M)), 2552#(or (<= N (+ i 1)) (< j M)), 2546#(<= N (+ i 1)), 2548#(or (<= N i) (<= (+ 2 k) N)), 2557#(or (< j M) (<= (+ k 1) i)), 2540#(or (<= (+ 2 k) N) (<= N k)), 2545#(<= N i), 2553#(or (<= N (+ i 1)) (< k N)), 2556#(or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M)), 2551#(or (<= N i) (<= (+ 2 k) N) (< j M)), 2541#(< j M), 2543#(or (<= (+ 2 k) N) (< j M) (<= N k)), 2554#(or (<= N (+ i 1)) (< j M) (< k N))] [2022-03-15 21:51:33,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:51:33,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:33,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:51:33,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:51:33,295 INFO L87 Difference]: Start difference. First operand 77 states and 221 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:34,478 INFO L93 Difference]: Finished difference Result 193 states and 544 transitions. [2022-03-15 21:51:34,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 21:51:34,479 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 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 21:51:34,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:34,480 INFO L225 Difference]: With dead ends: 193 [2022-03-15 21:51:34,480 INFO L226 Difference]: Without dead ends: 190 [2022-03-15 21:51:34,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1199, Invalid=3631, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 21:51:34,482 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 140 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:34,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 0 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:51:34,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-03-15 21:51:34,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 106. [2022-03-15 21:51:34,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 3.1809523809523808) internal successors, (334), 105 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 334 transitions. [2022-03-15 21:51:34,495 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 334 transitions. Word has length 14 [2022-03-15 21:51:34,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:34,495 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 334 transitions. [2022-03-15 21:51:34,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:34,495 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 334 transitions. [2022-03-15 21:51:34,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:51:34,496 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:34,496 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:34,520 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 21:51:34,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:34,712 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:34,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:34,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1619230100, now seen corresponding path program 3 times [2022-03-15 21:51:34,713 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:34,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673006406] [2022-03-15 21:51:34,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:34,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:34,751 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 21:51:34,751 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:34,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673006406] [2022-03-15 21:51:34,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673006406] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:34,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951746630] [2022-03-15 21:51:34,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:51:34,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:34,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:34,753 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 21:51:34,780 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 21:51:34,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:51:34,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:34,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:51:34,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:34,867 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 21:51:34,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:34,901 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 21:51:34,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951746630] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:34,902 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:34,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 8 [2022-03-15 21:51:34,903 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [736171719] [2022-03-15 21:51:34,904 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:34,905 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:34,909 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 21:51:34,909 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:35,326 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [3140#(or (<= (+ i 1) k) (<= N i)), 3138#(or (<= N (+ k 1)) (< (+ 2 k) N)), 3139#(or (<= N i) (<= (+ 2 i) N)), 3141#(or (<= N i) (<= i k)), 3137#(or (<= N k) (< (+ k 1) N)), 3136#(< k N)] [2022-03-15 21:51:35,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 21:51:35,327 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:35,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 21:51:35,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:51:35,328 INFO L87 Difference]: Start difference. First operand 106 states and 334 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:35,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:35,851 INFO L93 Difference]: Finished difference Result 259 states and 761 transitions. [2022-03-15 21:51:35,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 21:51:35,852 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 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 21:51:35,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:35,853 INFO L225 Difference]: With dead ends: 259 [2022-03-15 21:51:35,853 INFO L226 Difference]: Without dead ends: 259 [2022-03-15 21:51:35,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:51:35,854 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:35,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:51:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-03-15 21:51:35,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 175. [2022-03-15 21:51:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 3.3333333333333335) internal successors, (580), 174 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 580 transitions. [2022-03-15 21:51:35,861 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 580 transitions. Word has length 14 [2022-03-15 21:51:35,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:35,861 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 580 transitions. [2022-03-15 21:51:35,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 580 transitions. [2022-03-15 21:51:35,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:51:35,862 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:35,862 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:35,888 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 21:51:36,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:36,063 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:36,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:36,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1216303260, now seen corresponding path program 2 times [2022-03-15 21:51:36,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:36,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191079780] [2022-03-15 21:51:36,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:36,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:36,107 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 21:51:36,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:36,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191079780] [2022-03-15 21:51:36,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191079780] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:36,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617505067] [2022-03-15 21:51:36,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:51:36,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:36,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:36,109 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 21:51:36,144 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 21:51:36,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:51:36,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:36,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:51:36,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:36,216 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 21:51:36,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:36,285 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 21:51:36,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617505067] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:36,285 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:36,285 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-03-15 21:51:36,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [840356693] [2022-03-15 21:51:36,286 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:36,287 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:36,290 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 102 transitions. [2022-03-15 21:51:36,291 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:36,949 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [3883#(or (< k N) (<= (+ j 1) M)), 3892#(or (<= N (+ i 1)) (< j M)), 3894#(or (<= N i) (<= (+ 2 k j) (+ N M))), 3884#(or (<= (+ 2 j) M) (<= M j)), 3889#(<= N (+ i 1)), 3890#(or (<= N i) (< k N)), 3886#(<= N i), 3891#(or (<= N i) (< j M) (< k N)), 3882#(< k N), 3887#(or (<= N i) (<= (+ j 1) M)), 3896#(or (<= N (+ i 1)) (< j M) (< k N)), 3888#(or (<= (+ 2 j) M) (<= N i)), 3895#(or (<= N (+ i 1)) (< k N)), 3897#(or (<= N (+ i 1)) (<= (+ 2 k j) (+ N M))), 3893#(or (<= N (+ i 1)) (<= (+ 2 j) M)), 3885#(or (<= (+ 2 j) M) (< k N) (<= M j))] [2022-03-15 21:51:36,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:51:36,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:36,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:51:36,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:51:36,950 INFO L87 Difference]: Start difference. First operand 175 states and 580 transitions. Second operand has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:38,120 INFO L93 Difference]: Finished difference Result 553 states and 1601 transitions. [2022-03-15 21:51:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 21:51:38,120 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 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 21:51:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:38,123 INFO L225 Difference]: With dead ends: 553 [2022-03-15 21:51:38,123 INFO L226 Difference]: Without dead ends: 549 [2022-03-15 21:51:38,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1778 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1593, Invalid=5213, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 21:51:38,125 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 180 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:38,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 0 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:51:38,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-03-15 21:51:38,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 195. [2022-03-15 21:51:38,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 3.5257731958762886) internal successors, (684), 194 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 684 transitions. [2022-03-15 21:51:38,134 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 684 transitions. Word has length 14 [2022-03-15 21:51:38,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:38,134 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 684 transitions. [2022-03-15 21:51:38,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 684 transitions. [2022-03-15 21:51:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:51:38,135 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:38,135 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:38,152 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 21:51:38,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:38,339 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:38,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:38,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1839398348, now seen corresponding path program 3 times [2022-03-15 21:51:38,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:38,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044036190] [2022-03-15 21:51:38,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:38,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:38,371 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 21:51:38,371 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:38,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044036190] [2022-03-15 21:51:38,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044036190] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:38,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374708190] [2022-03-15 21:51:38,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:51:38,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:38,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:38,373 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 21:51:38,380 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 21:51:38,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:51:38,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:38,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:51:38,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:38,461 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 21:51:38,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:38,521 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 21:51:38,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374708190] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:38,521 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:38,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 9 [2022-03-15 21:51:38,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2139046683] [2022-03-15 21:51:38,522 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:38,523 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:38,528 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 105 transitions. [2022-03-15 21:51:38,528 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:38,952 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [5041#(or (<= N i) (<= (+ M i 1) (+ N j))), 5039#(or (< (+ 2 j) M) (<= M (+ j 1))), 5042#(or (<= N i) (<= (+ M i) (+ N j))), 5040#(or (<= N i) (<= (+ 2 i) N)), 5038#(or (< (+ j 1) M) (<= M j)), 5037#(< j M)] [2022-03-15 21:51:38,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 21:51:38,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:38,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 21:51:38,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:51:38,953 INFO L87 Difference]: Start difference. First operand 195 states and 684 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:39,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:39,490 INFO L93 Difference]: Finished difference Result 636 states and 2040 transitions. [2022-03-15 21:51:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 21:51:39,490 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 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 21:51:39,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:39,494 INFO L225 Difference]: With dead ends: 636 [2022-03-15 21:51:39,494 INFO L226 Difference]: Without dead ends: 636 [2022-03-15 21:51:39,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=937, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:51:39,495 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:39,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:51:39,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-03-15 21:51:39,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 362. [2022-03-15 21:51:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 3.6925207756232687) internal successors, (1333), 361 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:39,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 1333 transitions. [2022-03-15 21:51:39,509 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 1333 transitions. Word has length 14 [2022-03-15 21:51:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:39,509 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 1333 transitions. [2022-03-15 21:51:39,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:39,510 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 1333 transitions. [2022-03-15 21:51:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:51:39,511 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:39,511 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:39,535 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 21:51:39,732 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,SelfDestructingSolverStorable11 [2022-03-15 21:51:39,733 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:39,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:39,733 INFO L85 PathProgramCache]: Analyzing trace with hash 942163677, now seen corresponding path program 1 times [2022-03-15 21:51:39,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:39,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380515399] [2022-03-15 21:51:39,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:39,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:39,770 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 21:51:39,770 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:39,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380515399] [2022-03-15 21:51:39,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380515399] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:39,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668549504] [2022-03-15 21:51:39,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:39,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:39,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:39,772 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 21:51:39,774 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 21:51:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:39,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:51:39,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:39,854 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 21:51:39,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:39,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668549504] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:39,912 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:39,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-03-15 21:51:39,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [951912936] [2022-03-15 21:51:39,912 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:39,913 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:39,916 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 88 transitions. [2022-03-15 21:51:39,916 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:40,394 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [6532#(or (<= N k) (< (+ k 1) N)), 6537#(or (<= N i) (<= (+ 2 i) N)), 6541#(or (<= N i) (<= (+ M i) (+ k j))), 6539#(or (< j M) (< i N)), 6535#(or (< j M) (<= N k) (< (+ k 1) N)), 6540#(or (<= N i) (< (+ i 1) N) (< j M)), 6533#(< j M), 6538#(or (<= (+ i 1) k) (<= N i)), 6536#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 6531#(< k N), 6534#(or (< j M) (< k N))] [2022-03-15 21:51:40,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 21:51:40,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:40,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 21:51:40,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:51:40,395 INFO L87 Difference]: Start difference. First operand 362 states and 1333 transitions. Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:41,709 INFO L93 Difference]: Finished difference Result 1353 states and 4544 transitions. [2022-03-15 21:51:41,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 21:51:41,709 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 21:51:41,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:41,716 INFO L225 Difference]: With dead ends: 1353 [2022-03-15 21:51:41,716 INFO L226 Difference]: Without dead ends: 1353 [2022-03-15 21:51:41,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1042, Invalid=3928, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 21:51:41,718 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 162 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:41,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 0 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:51:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2022-03-15 21:51:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 506. [2022-03-15 21:51:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 3.986138613861386) internal successors, (2013), 505 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 2013 transitions. [2022-03-15 21:51:41,745 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 2013 transitions. Word has length 14 [2022-03-15 21:51:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:41,745 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 2013 transitions. [2022-03-15 21:51:41,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 2013 transitions. [2022-03-15 21:51:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:51:41,747 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:41,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:41,766 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 21:51:41,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 21:51:41,963 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:41,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:41,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1694596573, now seen corresponding path program 2 times [2022-03-15 21:51:41,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:41,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122431723] [2022-03-15 21:51:41,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:41,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:41,999 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 21:51:41,999 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:41,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122431723] [2022-03-15 21:51:41,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122431723] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:41,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801438003] [2022-03-15 21:51:41,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:51:42,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:42,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:42,001 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 21:51:42,001 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 21:51:42,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:51:42,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:42,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:51:42,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:42,088 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 21:51:42,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:42,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801438003] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:42,148 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:42,148 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-03-15 21:51:42,148 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [689430823] [2022-03-15 21:51:42,148 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:42,149 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:42,152 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 70 transitions. [2022-03-15 21:51:42,152 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:42,540 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [9101#(or (<= N i) (< k N) (<= (+ 2 i) N)), 9107#(or (<= N i) (<= (+ M i) (+ k j))), 9102#(or (< j M) (< k N)), 9098#(or (<= N i) (<= (+ 2 i) N)), 9104#(or (< (+ j 1) M) (< k N) (<= M j)), 9106#(or (<= N i) (<= (+ M i 1) (+ N j))), 9105#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 9103#(or (< (+ j 1) M) (<= M j)), 9100#(or (< k N) (< i N)), 9099#(< k N), 9097#(< j M)] [2022-03-15 21:51:42,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 21:51:42,541 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:42,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 21:51:42,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:51:42,541 INFO L87 Difference]: Start difference. First operand 506 states and 2013 transitions. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:43,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:43,794 INFO L93 Difference]: Finished difference Result 1529 states and 5217 transitions. [2022-03-15 21:51:43,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 21:51:43,795 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 21:51:43,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:43,804 INFO L225 Difference]: With dead ends: 1529 [2022-03-15 21:51:43,804 INFO L226 Difference]: Without dead ends: 1529 [2022-03-15 21:51:43,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1398 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1091, Invalid=4165, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 21:51:43,806 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:43,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:51:43,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2022-03-15 21:51:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 545. [2022-03-15 21:51:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 4.0275735294117645) internal successors, (2191), 544 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2191 transitions. [2022-03-15 21:51:43,833 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2191 transitions. Word has length 14 [2022-03-15 21:51:43,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:43,833 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 2191 transitions. [2022-03-15 21:51:43,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2191 transitions. [2022-03-15 21:51:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:51:43,835 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:43,835 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:43,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-15 21:51:44,055 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,SelfDestructingSolverStorable13 [2022-03-15 21:51:44,055 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:44,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:44,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1905860964, now seen corresponding path program 4 times [2022-03-15 21:51:44,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:44,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995423038] [2022-03-15 21:51:44,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:44,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:44,177 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 21:51:44,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:44,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995423038] [2022-03-15 21:51:44,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995423038] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:44,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487360278] [2022-03-15 21:51:44,178 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:51:44,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:44,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:44,179 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 21:51:44,179 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 21:51:44,200 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:51:44,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:44,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:51:44,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:44,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:44,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:44,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:44,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2022-03-15 21:51:44,381 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 21:51:44,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:44,495 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:51:44,495 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 21 treesize of output 46 [2022-03-15 21:51:44,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:44,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:44,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:44,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 5 [2022-03-15 21:51:44,618 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 21:51:44,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487360278] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:44,618 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:44,619 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2022-03-15 21:51:44,619 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1220002292] [2022-03-15 21:51:44,619 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:44,620 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:44,624 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 21:51:44,624 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:46,856 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [11937#(and (or (<= N i) (< res2 (+ (select A i) res1 1))) (or (<= N i) (<= (+ (select A i) res1) res2))), 11935#(and (or (<= (+ 2 k) N) (< j M) (<= (+ res2 (select A k)) res1)) (or (<= (+ 2 k) N) (< j M) (<= res1 (+ res2 (select A k))))), 11934#(and (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< j M) (<= res1 (+ (select A (+ k 1)) res2 (select A k)))) (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< j M) (< (+ (select A (+ k 1)) res2 (select A k)) (+ res1 1)))), 11930#(and (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (<= res1 (+ (select A (+ k 1)) res2 (select A k)))) (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< (+ (select A (+ k 1)) res2 (select A k)) (+ res1 1)))), 11938#(and (or (<= N (+ i 1)) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 11932#(and (or (<= (+ k 1) N) (< j M) (< res2 (+ res1 1))) (or (<= res1 res2) (<= (+ k 1) N) (< j M))), 11952#(and (or (<= (+ (select A (+ k 1)) res2 (select A k)) (+ (select A i) res1 (select A (+ i 1)))) (<= N (+ i 1)) (<= (+ 3 k) N)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A (+ k 1)) res2 (select A k)))) (or (<= N (+ i 1)) (<= (+ 2 k) N))), 11945#(and (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) res2 (select A k)) (+ (select A i) res1)) (<= N i) (< j M)) (or (<= (+ 3 k) N) (<= (+ (select A i) res1) (+ (select A (+ k 1)) res2 (select A k))) (<= N i) (< j M)) (or (<= N i) (<= (+ 2 k) N) (< j M))), 11948#(and (or (<= N (+ i 1)) (<= (+ 2 k) N) (<= (+ res2 (select A k)) (+ (select A i) res1 (select A (+ i 1))))) (or (<= N (+ i 1)) (<= (+ 2 k) N) (<= (+ (select A i) res1 (select A (+ i 1))) (+ res2 (select A k))))), 11939#(and (or (<= N i) (< k N) (<= (+ (select A i) res1) res2)) (or (<= N i) (< k N) (< res2 (+ (select A i) res1 1)))), 11940#(and (or (<= N i) (<= (+ 2 k) N) (<= (+ (select A i) res1) (+ res2 (select A k)))) (or (<= N i) (<= (+ 2 k) N) (<= (+ res2 (select A k)) (+ (select A i) res1)))), 11950#(and (or (<= N (+ i 1)) (< j M) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< j M) (< k N) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 11953#(and (or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A (+ k 1)) res2 (select A k)))) (or (<= (+ (select A (+ k 1)) res2 (select A k)) (+ (select A i) res1 (select A (+ i 1)))) (<= N (+ i 1)) (<= (+ 3 k) N) (< j M))), 11929#(and (or (not (< k N)) (<= (+ 2 k) N) (< (+ res2 (select A k)) (+ res1 1))) (or (not (< k N)) (<= (+ 2 k) N) (<= res1 (+ res2 (select A k))))), 11933#(and (or (not (< k N)) (<= (+ 2 k) N) (< j M) (<= res1 (+ res2 (select A k)))) (or (not (< k N)) (<= (+ 2 k) N) (< j M) (< (+ res2 (select A k)) (+ res1 1)))), 11941#(and (or (<= N i) (<= (+ 2 k) N)) (or (<= (+ 3 k) N) (<= (+ (select A i) res1) (+ (select A (+ k 1)) res2 (select A k))) (<= N i)) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) res2 (select A k)) (+ (select A i) res1)) (<= N i))), 11931#(and (or (<= res1 res2) (< j M)) (or (< j M) (< res2 (+ res1 1)))), 11943#(and (or (<= N i) (< j M) (< k N) (<= (+ (select A i) res1) res2)) (or (<= N i) (< j M) (< k N) (< res2 (+ (select A i) res1 1)))), 11949#(and (or (<= N (+ i 1)) (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< j M) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 11951#(and (or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M) (<= (+ res2 (select A k)) (+ (select A i) res1 (select A (+ i 1))))) (or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) (+ res2 (select A k))))), 11947#(and (or (<= N (+ i 1)) (< k N) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1))) (or (<= N (+ i 1)) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) res2))), 11936#(and (or (< j M) (<= (+ res2 (select A k) (select A (+ (- 1) N))) res1) (< (+ 2 k) N)) (or (<= (+ 2 k) N) (< j M)) (or (< j M) (< (+ 2 k) N) (<= res1 (+ res2 (select A k) (select A (+ (- 1) N)))))), 11942#(and (or (<= N i) (< j M) (<= (+ (select A i) res1) res2)) (or (<= N i) (< j M) (< res2 (+ (select A i) res1 1)))), 11946#(and (or (< j M) (<= res1 (+ res2 (select A k)))) (or (< j M) (<= (+ res2 (select A k)) res1)) (or (< j M) (<= (+ k 1) i))), 11944#(and (or (<= N i) (<= (+ 2 k) N) (< j M) (<= (+ res2 (select A k)) (+ (select A i) res1))) (or (<= N i) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) res1) (+ res2 (select A k)))))] [2022-03-15 21:51:46,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 21:51:46,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:46,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 21:51:46,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1536, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:51:46,858 INFO L87 Difference]: Start difference. First operand 545 states and 2191 transitions. Second operand has 34 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:57,395 INFO L93 Difference]: Finished difference Result 1274 states and 4341 transitions. [2022-03-15 21:51:57,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-03-15 21:51:57,396 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:51:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:57,402 INFO L225 Difference]: With dead ends: 1274 [2022-03-15 21:51:57,403 INFO L226 Difference]: Without dead ends: 1244 [2022-03-15 21:51:57,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8116 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=3929, Invalid=19941, Unknown=0, NotChecked=0, Total=23870 [2022-03-15 21:51:57,408 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 541 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:57,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [541 Valid, 0 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1777 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 21:51:57,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2022-03-15 21:51:57,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 627. [2022-03-15 21:51:57,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 626 states have (on average 4.043130990415335) internal successors, (2531), 626 states have internal predecessors, (2531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 2531 transitions. [2022-03-15 21:51:57,431 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 2531 transitions. Word has length 15 [2022-03-15 21:51:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:57,431 INFO L470 AbstractCegarLoop]: Abstraction has 627 states and 2531 transitions. [2022-03-15 21:51:57,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 2531 transitions. [2022-03-15 21:51:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:51:57,433 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:57,433 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:57,463 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 21:51:57,655 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,SelfDestructingSolverStorable14 [2022-03-15 21:51:57,655 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:57,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:57,656 INFO L85 PathProgramCache]: Analyzing trace with hash -312006299, now seen corresponding path program 5 times [2022-03-15 21:51:57,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:57,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311266204] [2022-03-15 21:51:57,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:57,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:57,689 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 21:51:57,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:57,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311266204] [2022-03-15 21:51:57,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311266204] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:57,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569067101] [2022-03-15 21:51:57,690 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:51:57,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:57,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:57,691 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 21:51:57,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 21:51:57,719 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:51:57,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:57,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:51:57,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:57,790 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 21:51:57,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:57,824 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 21:51:57,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569067101] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:57,825 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:57,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-03-15 21:51:57,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [456200464] [2022-03-15 21:51:57,825 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:57,826 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:57,830 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 21:51:57,830 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:58,242 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [14805#(or (<= (+ N 1) k) (< i N)), 14807#(or (<= N i) (< (+ i 1) N)), 14808#(or (<= N i) (< (+ i 1) N) (<= (+ N 1) k)), 14810#(< k N), 14804#(< i N), 14814#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 14811#(or (<= N i) (<= i k)), 14809#(or (<= N i) (< (+ i 1) N) (<= N k)), 14812#(or (<= N k) (< (+ k 1) N)), 14806#(or (<= N k) (< i N)), 14813#(or (<= N (+ k 1)) (< (+ 2 k) N))] [2022-03-15 21:51:58,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 21:51:58,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:58,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 21:51:58,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2022-03-15 21:51:58,243 INFO L87 Difference]: Start difference. First operand 627 states and 2531 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:58,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:58,566 INFO L93 Difference]: Finished difference Result 958 states and 3627 transitions. [2022-03-15 21:51:58,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 21:51:58,567 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 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 21:51:58,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:58,571 INFO L225 Difference]: With dead ends: 958 [2022-03-15 21:51:58,571 INFO L226 Difference]: Without dead ends: 933 [2022-03-15 21:51:58,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=334, Invalid=1148, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 21:51:58,572 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:58,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:51:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2022-03-15 21:51:58,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 720. [2022-03-15 21:51:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 4.029207232267037) internal successors, (2897), 719 states have internal predecessors, (2897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 2897 transitions. [2022-03-15 21:51:58,602 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 2897 transitions. Word has length 15 [2022-03-15 21:51:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:58,602 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 2897 transitions. [2022-03-15 21:51:58,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:58,602 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 2897 transitions. [2022-03-15 21:51:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:51:58,604 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:58,604 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:58,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-15 21:51:58,819 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,SelfDestructingSolverStorable15 [2022-03-15 21:51:58,819 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:58,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:58,820 INFO L85 PathProgramCache]: Analyzing trace with hash -685803146, now seen corresponding path program 4 times [2022-03-15 21:51:58,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:58,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912746202] [2022-03-15 21:51:58,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:58,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:58,901 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 21:51:58,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:58,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912746202] [2022-03-15 21:51:58,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912746202] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:58,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196562789] [2022-03-15 21:51:58,902 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:51:58,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:58,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:58,903 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 21:51:58,906 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 21:51:58,932 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:51:58,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:58,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:51:58,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:59,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-03-15 21:51:59,056 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 21:51:59,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:59,147 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:51:59,148 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 21 treesize of output 46 [2022-03-15 21:51:59,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:59,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:59,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:59,211 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2022-03-15 21:51:59,222 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 21:51:59,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196562789] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:59,222 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:59,222 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 21:51:59,223 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [6485805] [2022-03-15 21:51:59,223 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:59,223 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:59,227 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 136 transitions. [2022-03-15 21:51:59,227 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:00,050 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [17341#(and (<= (+ (select A j) (select A (+ j 1)) res2) (+ (select A i) res1 (select A (+ i 1)))) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2))), 17337#(and (<= (+ (select A i) res1) res2) (< res2 (+ (select A i) res1 1))), 17338#(and (<= (+ (select A i) res1 (select A (+ i 1))) res2) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1))), 17327#(and (<= (+ (select A i) res1) (+ (select A j) (select A (+ j 1)) res2)) (<= (+ (select A j) (select A (+ j 1)) res2) (+ (select A i) res1))), 17340#(and (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) res2)) (<= (+ (select A j) res2) (+ (select A i) res1 (select A (+ i 1))))), 17339#(and (<= (+ (select A i) res1) (+ (select A j) res2)) (<= (+ (select A j) res2) (+ (select A i) res1)))] [2022-03-15 21:52:00,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:52:00,050 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:52:00,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:52:00,051 INFO L87 Difference]: Start difference. First operand 720 states and 2897 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:00,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:00,303 INFO L93 Difference]: Finished difference Result 981 states and 3589 transitions. [2022-03-15 21:52:00,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 21:52:00,303 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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 21:52:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:00,308 INFO L225 Difference]: With dead ends: 981 [2022-03-15 21:52:00,308 INFO L226 Difference]: Without dead ends: 966 [2022-03-15 21:52:00,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-03-15 21:52:00,309 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:00,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:52:00,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-03-15 21:52:00,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 794. [2022-03-15 21:52:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 4.016393442622951) internal successors, (3185), 793 states have internal predecessors, (3185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3185 transitions. [2022-03-15 21:52:00,331 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3185 transitions. Word has length 15 [2022-03-15 21:52:00,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:00,331 INFO L470 AbstractCegarLoop]: Abstraction has 794 states and 3185 transitions. [2022-03-15 21:52:00,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3185 transitions. [2022-03-15 21:52:00,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:52:00,333 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:00,334 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:00,358 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 21:52:00,554 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,SelfDestructingSolverStorable16 [2022-03-15 21:52:00,555 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:00,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:00,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1583037817, now seen corresponding path program 3 times [2022-03-15 21:52:00,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:00,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973430546] [2022-03-15 21:52:00,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:00,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:00,704 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 21:52:00,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:00,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973430546] [2022-03-15 21:52:00,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973430546] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:00,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005652480] [2022-03-15 21:52:00,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:52:00,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:00,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:00,732 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 21:52:00,733 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 21:52:00,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:52:00,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:00,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:52:00,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:00,967 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:00,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2022-03-15 21:52:01,141 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 21:52:01,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:01,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:01,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:01,291 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:01,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 19 treesize of output 46 [2022-03-15 21:52:01,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:01,389 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2022-03-15 21:52:01,440 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 21:52:01,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005652480] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:01,441 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:01,441 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-03-15 21:52:01,441 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [320791184] [2022-03-15 21:52:01,441 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:01,442 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:01,446 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 21:52:01,446 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:03,193 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [20022#(and (or (<= N i) (< k N) (<= (+ (select A i) res1) res2)) (or (<= N i) (< k N) (< res2 (+ (select A i) res1 1)))), 20020#(and (or (not (< k N)) (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)) (<= res1 (+ (select A j) res2 (select A k)))) (or (not (< k N)) (< (+ (select A j) res2 (select A k)) (+ res1 1)) (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)))), 20026#(and (or (<= N (+ i 1)) (<= (+ 2 k) N) (<= (+ res2 (select A k)) (+ (select A i) res1 (select A (+ i 1))))) (or (<= N (+ i 1)) (<= (+ 2 k) N) (<= (+ (select A i) res1 (select A (+ i 1))) (+ res2 (select A k))))), 20025#(and (or (<= N i) (<= (+ 2 k) N) (<= (+ (select A i) res1) (+ res2 (select A k)))) (or (<= N i) (<= (+ 2 k) N) (<= (+ res2 (select A k)) (+ (select A i) res1)))), 20018#(and (or (<= (+ k 1) N) (< j M) (< res2 (+ res1 1))) (or (<= res1 res2) (<= (+ k 1) N) (< j M))), 20017#(and (or (<= res1 res2) (< j M)) (or (< j M) (< res2 (+ res1 1)))), 20032#(and (or (<= (+ (select A j) res2 (select A k)) (+ (select A i) res1)) (<= (+ 2 j) M) (<= N i) (<= (+ 2 k) N)) (or (<= (+ 2 j) M) (<= N i) (<= (+ 2 k) N) (<= (+ (select A i) res1) (+ (select A j) res2 (select A k))))), 20019#(and (or (not (< k N)) (<= (+ 2 k) N) (< j M) (<= res1 (+ res2 (select A k)))) (or (not (< k N)) (<= (+ 2 k) N) (< j M) (< (+ res2 (select A k)) (+ res1 1)))), 20033#(and (or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M) (<= (+ res2 (select A k)) (+ (select A i) res1 (select A (+ i 1))))) (or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) (+ res2 (select A k))))), 20029#(and (or (<= N i) (< j M) (< k N) (<= (+ (select A i) res1) res2)) (or (<= N i) (< j M) (< k N) (< res2 (+ (select A i) res1 1)))), 20031#(and (or (<= N i) (<= (+ 2 k) N) (< j M) (<= (+ res2 (select A k)) (+ (select A i) res1))) (or (<= N i) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) res1) (+ res2 (select A k))))), 20027#(and (or (<= N i) (< j M) (<= (+ (select A i) res1) res2)) (or (<= N i) (< j M) (< res2 (+ (select A i) res1 1)))), 20023#(and (or (<= N (+ i 1)) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 20024#(and (or (<= N (+ i 1)) (< k N) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1))) (or (<= N (+ i 1)) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) res2))), 20016#(and (or (not (< k N)) (<= (+ 2 k) N) (< (+ res2 (select A k)) (+ res1 1))) (or (not (< k N)) (<= (+ 2 k) N) (<= res1 (+ res2 (select A k))))), 20034#(and (or (<= N (+ i 1)) (<= (+ (select A j) res2 (select A k)) (+ (select A i) res1 (select A (+ i 1)))) (<= (+ 2 j) M) (<= (+ 2 k) N)) (or (<= N (+ i 1)) (<= (+ 2 j) M) (<= (+ 2 k) N) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) res2 (select A k))))), 20028#(and (or (<= N (+ i 1)) (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< j M) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 20030#(and (or (<= N (+ i 1)) (< j M) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< j M) (< k N) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 20021#(and (or (<= N i) (< res2 (+ (select A i) res1 1))) (or (<= N i) (<= (+ (select A i) res1) res2)))] [2022-03-15 21:52:03,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:52:03,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:03,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:52:03,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1107, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:52:03,194 INFO L87 Difference]: Start difference. First operand 794 states and 3185 transitions. Second operand has 28 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:15,041 INFO L93 Difference]: Finished difference Result 1844 states and 6023 transitions. [2022-03-15 21:52:15,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2022-03-15 21:52:15,041 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 0 states have call successors, (0), 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 21:52:15,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:15,049 INFO L225 Difference]: With dead ends: 1844 [2022-03-15 21:52:15,050 INFO L226 Difference]: Without dead ends: 1816 [2022-03-15 21:52:15,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 31 SyntacticMatches, 12 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9335 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=3653, Invalid=23079, Unknown=0, NotChecked=0, Total=26732 [2022-03-15 21:52:15,053 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 590 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1893 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:15,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 0 Invalid, 2048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1893 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 21:52:15,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2022-03-15 21:52:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 839. [2022-03-15 21:52:15,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 838 states have (on average 4.028639618138425) internal successors, (3376), 838 states have internal predecessors, (3376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 3376 transitions. [2022-03-15 21:52:15,086 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 3376 transitions. Word has length 15 [2022-03-15 21:52:15,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:15,086 INFO L470 AbstractCegarLoop]: Abstraction has 839 states and 3376 transitions. [2022-03-15 21:52:15,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 3376 transitions. [2022-03-15 21:52:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:52:15,089 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:15,089 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:15,114 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 21:52:15,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:15,303 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:15,304 INFO L85 PathProgramCache]: Analyzing trace with hash -830604921, now seen corresponding path program 4 times [2022-03-15 21:52:15,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:15,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29215525] [2022-03-15 21:52:15,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:15,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:15,431 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 21:52:15,431 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:15,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29215525] [2022-03-15 21:52:15,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29215525] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:15,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573614149] [2022-03-15 21:52:15,431 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:52:15,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:15,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:15,432 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 21:52:15,433 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 21:52:15,456 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:52:15,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:15,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:52:15,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:15,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:52:15,635 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:15,635 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-03-15 21:52:15,686 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 21:52:15,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:15,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:15,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:15,821 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:52:15,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 19 treesize of output 46 [2022-03-15 21:52:15,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:15,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2022-03-15 21:52:15,920 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 21:52:15,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573614149] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:15,920 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:15,920 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-03-15 21:52:15,921 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1737183465] [2022-03-15 21:52:15,921 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:15,922 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:15,925 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 89 transitions. [2022-03-15 21:52:15,925 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:17,437 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [23931#(and (or (<= (+ (select A j) res2 (select A k)) (+ (select A i) res1)) (<= (+ 2 j) M) (<= N i) (<= (+ 2 k) N)) (or (<= (+ 2 j) M) (<= N i) (<= (+ 2 k) N) (<= (+ (select A i) res1) (+ (select A j) res2 (select A k))))), 23925#(and (or (<= N i) (< k N) (<= (+ j 1) M) (< res2 (+ (select A i) res1 1))) (or (<= N i) (< k N) (<= (+ j 1) M) (<= (+ (select A i) res1) res2))), 23922#(and (or (<= N (+ i 1)) (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< j M) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 23915#(and (or (<= res1 res2) (< k N)) (or (< k N) (< res2 (+ res1 1)))), 23920#(and (or (<= N i) (< j M) (<= (+ (select A i) res1) res2)) (or (<= N i) (< j M) (< res2 (+ (select A i) res1 1)))), 23914#(and (or (<= (+ 2 j) M) (not (< j M)) (< (+ (select A j) res2) (+ res1 1))) (or (<= (+ 2 j) M) (not (< j M)) (<= res1 (+ (select A j) res2)))), 23916#(and (or (< k N) (<= (+ j 1) M) (< res2 (+ res1 1))) (or (<= res1 res2) (< k N) (<= (+ j 1) M))), 23926#(and (or (<= N (+ i 1)) (< j M) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< j M) (< k N) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 23919#(and (or (<= N i) (< res2 (+ (select A i) res1 1))) (or (<= N i) (<= (+ (select A i) res1) res2))), 23927#(and (or (<= (+ 2 j) M) (<= N i) (<= (+ (select A j) res2) (+ (select A i) res1))) (or (<= (+ (select A i) res1) (+ (select A j) res2)) (<= (+ 2 j) M) (<= N i))), 23921#(and (or (<= N (+ i 1)) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 23930#(and (or (<= N (+ i 1)) (<= (+ (select A j) res2) (+ (select A i) res1 (select A (+ i 1)))) (<= (+ 2 j) M) (< k N)) (or (<= N (+ i 1)) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) res2)) (<= (+ 2 j) M) (< k N))), 23928#(and (or (<= N (+ i 1)) (<= (+ (select A j) res2) (+ (select A i) res1 (select A (+ i 1)))) (<= (+ 2 j) M)) (or (<= N (+ i 1)) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) res2)) (<= (+ 2 j) M))), 23924#(and (or (<= N (+ i 1)) (< k N) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1))) (or (<= N (+ i 1)) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) res2))), 23923#(and (or (<= N i) (< k N) (<= (+ (select A i) res1) res2)) (or (<= N i) (< k N) (< res2 (+ (select A i) res1 1)))), 23932#(and (or (<= N (+ i 1)) (<= (+ (select A j) res2 (select A k)) (+ (select A i) res1 (select A (+ i 1)))) (<= (+ 2 j) M) (<= (+ 2 k) N)) (or (<= N (+ i 1)) (<= (+ 2 j) M) (<= (+ 2 k) N) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) res2 (select A k))))), 23918#(and (or (not (< k N)) (< (+ (select A j) res2 (select A k)) (+ res1 1)) (<= (+ 2 j) M) (not (< j M)) (< (+ k 1) N)) (or (not (< k N)) (<= (+ 2 j) M) (not (< j M)) (< (+ k 1) N) (<= res1 (+ (select A j) res2 (select A k))))), 23917#(and (or (<= (+ 2 j) M) (not (< j M)) (< k N) (< (+ (select A j) res2) (+ res1 1))) (or (<= (+ 2 j) M) (not (< j M)) (< k N) (<= res1 (+ (select A j) res2)))), 23929#(and (or (<= (+ 2 j) M) (<= (+ k 1) N) (<= N i) (<= (+ (select A j) res2) (+ (select A i) res1))) (or (<= (+ (select A i) res1) (+ (select A j) res2)) (<= (+ 2 j) M) (<= (+ k 1) N) (<= N i)))] [2022-03-15 21:52:17,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:52:17,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:17,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:52:17,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:52:17,438 INFO L87 Difference]: Start difference. First operand 839 states and 3376 transitions. Second operand has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:29,210 INFO L93 Difference]: Finished difference Result 1889 states and 6184 transitions. [2022-03-15 21:52:29,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2022-03-15 21:52:29,210 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 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 21:52:29,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:29,218 INFO L225 Difference]: With dead ends: 1889 [2022-03-15 21:52:29,218 INFO L226 Difference]: Without dead ends: 1858 [2022-03-15 21:52:29,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 25 SyntacticMatches, 9 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9754 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=3815, Invalid=23907, Unknown=0, NotChecked=0, Total=27722 [2022-03-15 21:52:29,221 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 676 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 2202 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 2202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:29,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [676 Valid, 0 Invalid, 2361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 2202 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 21:52:29,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2022-03-15 21:52:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 851. [2022-03-15 21:52:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 4.031764705882353) internal successors, (3427), 850 states have internal predecessors, (3427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 3427 transitions. [2022-03-15 21:52:29,251 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 3427 transitions. Word has length 15 [2022-03-15 21:52:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:29,252 INFO L470 AbstractCegarLoop]: Abstraction has 851 states and 3427 transitions. [2022-03-15 21:52:29,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 3427 transitions. [2022-03-15 21:52:29,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:52:29,254 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:29,254 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:29,279 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 21:52:29,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:29,473 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:29,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:29,473 INFO L85 PathProgramCache]: Analyzing trace with hash 684336220, now seen corresponding path program 5 times [2022-03-15 21:52:29,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:29,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938764205] [2022-03-15 21:52:29,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:29,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:52:29,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:29,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938764205] [2022-03-15 21:52:29,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938764205] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:29,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993807249] [2022-03-15 21:52:29,508 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:52:29,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:29,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:29,510 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 21:52:29,511 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 21:52:29,535 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:52:29,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:29,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:52:29,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:29,602 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 21:52:29,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:29,681 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 21:52:29,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993807249] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:29,682 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:29,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-03-15 21:52:29,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [898557847] [2022-03-15 21:52:29,682 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:29,683 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:29,687 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 131 transitions. [2022-03-15 21:52:29,687 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:30,119 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [27883#(< i N), 27886#(or (< (+ 2 j) M) (<= M (+ j 1))), 27884#(or (< (+ j 1) M) (<= M j)), 27885#(or (<= N i) (< (+ i 1) N)), 27889#(or (<= M (+ 2 j)) (< (+ 3 j) M)), 27882#(< j M), 27890#(or (<= N i) (<= (+ M i) (+ N j))), 27887#(or (< i N) (<= M j)), 27888#(or (<= N i) (< (+ i 1) N) (<= M j))] [2022-03-15 21:52:30,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 21:52:30,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:30,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 21:52:30,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:52:30,120 INFO L87 Difference]: Start difference. First operand 851 states and 3427 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 14 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:30,418 INFO L93 Difference]: Finished difference Result 1314 states and 4970 transitions. [2022-03-15 21:52:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 21:52:30,419 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 14 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:52:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:30,425 INFO L225 Difference]: With dead ends: 1314 [2022-03-15 21:52:30,425 INFO L226 Difference]: Without dead ends: 1276 [2022-03-15 21:52:30,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:52:30,426 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:30,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:52:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2022-03-15 21:52:30,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 940. [2022-03-15 21:52:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 939 states have (on average 4.104366347177849) internal successors, (3854), 939 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 3854 transitions. [2022-03-15 21:52:30,451 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 3854 transitions. Word has length 15 [2022-03-15 21:52:30,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:30,451 INFO L470 AbstractCegarLoop]: Abstraction has 940 states and 3854 transitions. [2022-03-15 21:52:30,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 14 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:30,452 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 3854 transitions. [2022-03-15 21:52:30,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:52:30,455 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:30,455 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:30,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:30,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:30,656 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1615190827, now seen corresponding path program 6 times [2022-03-15 21:52:30,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:30,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671076590] [2022-03-15 21:52:30,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:30,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:30,693 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 21:52:30,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:30,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671076590] [2022-03-15 21:52:30,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671076590] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:30,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400488501] [2022-03-15 21:52:30,694 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:52:30,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:30,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:30,695 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 21:52:30,695 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 21:52:30,717 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:52:30,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:30,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:52:30,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:30,799 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 21:52:30,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:30,825 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 21:52:30,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400488501] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:30,825 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:30,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 11 [2022-03-15 21:52:30,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1549103213] [2022-03-15 21:52:30,826 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:30,826 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:30,831 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 21:52:30,831 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:31,469 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [31223#(or (<= N i) (<= i k)), 31219#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 31220#(or (<= (+ i 1) k) (<= N i)), 31225#(or (<= N i) (<= i (+ k 1))), 31224#(or (<= N (+ i 1)) (<= (+ i 1) k)), 31222#(or (<= N (+ i 1)) (<= (+ 2 i) k)), 31221#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 31226#(or (<= N (+ i 1)) (<= i k)), 31217#(or (<= N k) (< (+ k 1) N)), 31216#(< k N), 31215#(or (<= N i) (<= (+ 2 i) N)), 31218#(or (<= N (+ k 1)) (< (+ 2 k) N))] [2022-03-15 21:52:31,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 21:52:31,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:31,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 21:52:31,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2022-03-15 21:52:31,470 INFO L87 Difference]: Start difference. First operand 940 states and 3854 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:32,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:32,601 INFO L93 Difference]: Finished difference Result 2820 states and 10873 transitions. [2022-03-15 21:52:32,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 21:52:32,602 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:52:32,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:32,617 INFO L225 Difference]: With dead ends: 2820 [2022-03-15 21:52:32,618 INFO L226 Difference]: Without dead ends: 2820 [2022-03-15 21:52:32,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=706, Invalid=2486, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 21:52:32,620 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 211 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:32,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 0 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:52:32,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2022-03-15 21:52:32,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 1340. [2022-03-15 21:52:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1339 states have (on average 4.125466766243465) internal successors, (5524), 1339 states have internal predecessors, (5524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:32,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 5524 transitions. [2022-03-15 21:52:32,670 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 5524 transitions. Word has length 16 [2022-03-15 21:52:32,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:32,671 INFO L470 AbstractCegarLoop]: Abstraction has 1340 states and 5524 transitions. [2022-03-15 21:52:32,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:32,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 5524 transitions. [2022-03-15 21:52:32,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:52:32,676 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:32,676 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:32,700 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 21:52:32,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:32,898 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:32,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:32,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1188846008, now seen corresponding path program 7 times [2022-03-15 21:52:32,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:32,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007366223] [2022-03-15 21:52:32,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:32,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:32,937 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 21:52:32,937 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:32,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007366223] [2022-03-15 21:52:32,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007366223] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:32,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560980402] [2022-03-15 21:52:32,937 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:52:32,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:32,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:32,939 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 21:52:32,969 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 21:52:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:32,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:52:32,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:33,029 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 21:52:33,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:33,079 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 21:52:33,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560980402] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:33,079 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:33,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 21:52:33,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [993557325] [2022-03-15 21:52:33,079 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:33,082 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:33,087 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 21:52:33,087 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:34,031 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [36896#(or (<= (+ 2 k) N) (< j M) (<= N k)), 36895#(or (<= (+ k 1) N) (< j M)), 36918#(or (<= (+ k 1) i) (<= N k)), 36913#(or (< j M) (<= (+ k 1) i)), 36912#(or (<= N (+ 2 i)) (< j M) (< k N)), 36897#(or (<= (+ 2 k) N) (< j M)), 36899#(or (<= (+ 3 k) N) (<= N k)), 36919#(or (< j M) (<= (+ k 1) i) (<= N k)), 36906#(or (<= N (+ 2 i)) (< j M)), 36907#(or (<= (+ k 1) N) (<= N i)), 36903#(<= N (+ 2 i)), 36898#(or (<= N (+ k 1)) (<= (+ 3 k) N)), 36901#(<= N i), 36909#(or (<= N i) (< j M) (< k N)), 36886#(or (<= k i) (< j M)), 36893#(or (<= (+ 2 k) N) (<= N k)), 36915#(or (<= N (+ k 1)) (<= (+ 3 k) N) (< j M)), 36916#(or (<= (+ 3 k) N) (< j M) (<= N k)), 36914#(or (< j M) (<= k (+ i 1))), 36902#(<= N (+ i 1)), 36908#(or (<= N (+ i 1)) (< k N)), 36905#(or (<= N (+ i 1)) (< j M)), 36911#(or (<= N (+ 2 i)) (< k N)), 36904#(or (<= N i) (< j M)), 36900#(or (<= (+ 2 k) i) (<= N k)), 36894#(< j M), 36917#(or (<= (+ 2 k) i) (< j M) (<= N k)), 36910#(or (<= N (+ i 1)) (< j M) (< k N))] [2022-03-15 21:52:34,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:52:34,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:34,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:52:34,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:52:34,032 INFO L87 Difference]: Start difference. First operand 1340 states and 5524 transitions. Second operand has 36 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 35 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:35,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:35,649 INFO L93 Difference]: Finished difference Result 2128 states and 8024 transitions. [2022-03-15 21:52:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-03-15 21:52:35,649 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 35 states have internal predecessors, (110), 0 states have call successors, (0), 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 21:52:35,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:35,655 INFO L225 Difference]: With dead ends: 2128 [2022-03-15 21:52:35,655 INFO L226 Difference]: Without dead ends: 2122 [2022-03-15 21:52:35,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2204 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2092, Invalid=7028, Unknown=0, NotChecked=0, Total=9120 [2022-03-15 21:52:35,657 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 295 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:35,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 0 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:52:35,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2022-03-15 21:52:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1418. [2022-03-15 21:52:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1417 states have (on average 4.153846153846154) internal successors, (5886), 1417 states have internal predecessors, (5886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 5886 transitions. [2022-03-15 21:52:35,701 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 5886 transitions. Word has length 16 [2022-03-15 21:52:35,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:35,701 INFO L470 AbstractCegarLoop]: Abstraction has 1418 states and 5886 transitions. [2022-03-15 21:52:35,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 35 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:35,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 5886 transitions. [2022-03-15 21:52:35,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:52:35,705 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:35,705 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:35,730 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 21:52:35,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:35,919 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:35,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:35,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1657638132, now seen corresponding path program 6 times [2022-03-15 21:52:35,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:35,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208877815] [2022-03-15 21:52:35,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:35,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:35,968 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 21:52:35,969 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:35,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208877815] [2022-03-15 21:52:35,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208877815] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:35,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325646625] [2022-03-15 21:52:35,970 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:52:35,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:35,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:35,971 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 21:52:35,972 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 21:52:35,992 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:52:35,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:35,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:52:35,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:36,072 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 21:52:36,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:36,148 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 21:52:36,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325646625] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:36,148 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:36,148 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-03-15 21:52:36,148 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1240794539] [2022-03-15 21:52:36,148 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:36,149 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:36,163 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 167 transitions. [2022-03-15 21:52:36,164 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:37,242 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [42123#(or (<= (+ 2 j) M) (<= M j)), 42109#(<= N i), 42125#(or (<= (+ 2 j) M) (< k N)), 42117#(or (<= N (+ 2 i)) (<= (+ 2 j) M)), 42122#(or (< k N) (<= (+ j 1) M)), 42127#(or (<= N i) (< j M) (< k N)), 42114#(<= N (+ 2 i)), 42113#(or (<= N (+ i 1)) (< j M)), 42111#(or (<= (+ 2 j) M) (<= N i)), 42139#(or (<= (+ 3 j) M) (< k N) (<= M (+ j 1))), 42135#(or (<= N (+ 2 i)) (< j M) (< k N)), 42136#(or (<= N (+ 2 i)) (<= (+ 2 j) M) (< k N)), 42129#(or (<= N (+ i 1)) (< k N)), 42132#(or (<= (+ 3 k j) (+ N M)) (<= N i)), 42121#(< k N), 42138#(or (<= (+ 3 j) M) (<= M (+ j 1))), 42124#(or (<= (+ 2 j) M) (< k N) (<= M j)), 42133#(or (<= (+ 3 k j) (+ N M)) (<= N (+ i 1))), 42115#(or (<= N (+ 2 i)) (< j M)), 42119#(or (<= N (+ i 1)) (<= (+ 3 j) M)), 42118#(or (<= N i) (<= (+ 3 j) M)), 42134#(or (<= N (+ 2 i)) (< k N)), 42116#(or (<= N (+ i 1)) (<= (+ 2 j) M)), 42112#(<= N (+ i 1)), 42110#(or (<= N i) (<= (+ j 1) M)), 42131#(or (<= N (+ i 1)) (<= (+ 2 j) M) (< k N)), 42137#(or (<= (+ 3 k j) (+ N M)) (<= N (+ 2 i))), 42130#(or (<= N (+ i 1)) (< j M) (< k N)), 42120#(or (<= N (+ 2 i)) (<= (+ 3 j) M)), 42128#(or (<= (+ 2 j) M) (<= N i) (< k N)), 42126#(or (<= N i) (< k N))] [2022-03-15 21:52:37,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 21:52:37,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:37,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 21:52:37,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=1817, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 21:52:37,243 INFO L87 Difference]: Start difference. First operand 1418 states and 5886 transitions. Second operand has 40 states, 40 states have (on average 3.025) internal successors, (121), 39 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:39,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:39,577 INFO L93 Difference]: Finished difference Result 2513 states and 9198 transitions. [2022-03-15 21:52:39,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-03-15 21:52:39,578 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.025) internal successors, (121), 39 states have internal predecessors, (121), 0 states have call successors, (0), 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 21:52:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:39,585 INFO L225 Difference]: With dead ends: 2513 [2022-03-15 21:52:39,585 INFO L226 Difference]: Without dead ends: 2506 [2022-03-15 21:52:39,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5911 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4859, Invalid=16021, Unknown=0, NotChecked=0, Total=20880 [2022-03-15 21:52:39,587 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 276 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:39,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 0 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:52:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2022-03-15 21:52:39,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1534. [2022-03-15 21:52:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1533 states have (on average 4.202870189171559) internal successors, (6443), 1533 states have internal predecessors, (6443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 6443 transitions. [2022-03-15 21:52:39,630 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 6443 transitions. Word has length 16 [2022-03-15 21:52:39,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:39,630 INFO L470 AbstractCegarLoop]: Abstraction has 1534 states and 6443 transitions. [2022-03-15 21:52:39,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.025) internal successors, (121), 39 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 6443 transitions. [2022-03-15 21:52:39,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:52:39,635 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:39,635 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:39,659 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 21:52:39,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:39,857 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:39,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:39,858 INFO L85 PathProgramCache]: Analyzing trace with hash 478440412, now seen corresponding path program 7 times [2022-03-15 21:52:39,859 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:39,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394399798] [2022-03-15 21:52:39,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:39,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:39,890 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 21:52:39,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:39,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394399798] [2022-03-15 21:52:39,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394399798] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:39,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709406433] [2022-03-15 21:52:39,890 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:52:39,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:39,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:39,891 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 21:52:39,912 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 21:52:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:39,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:52:39,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:39,998 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 21:52:39,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:40,076 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 21:52:40,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709406433] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:40,076 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:40,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 13 [2022-03-15 21:52:40,076 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [221303071] [2022-03-15 21:52:40,076 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:40,077 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:40,084 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 170 transitions. [2022-03-15 21:52:40,084 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:40,817 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [48020#(or (< (+ j 1) M) (<= M j)), 48025#(or (<= N (+ i 1)) (<= (+ 2 M i) (+ N j))), 48022#(or (<= N i) (<= (+ 2 i) N)), 48029#(or (<= N (+ i 1)) (<= (+ M i) (+ N j))), 48028#(or (<= (+ M i) (+ N j 1)) (<= N i)), 48023#(or (<= N i) (<= (+ M i 1) (+ N j))), 48021#(or (< (+ 2 j) M) (<= M (+ j 1))), 48019#(< j M), 48024#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 48030#(or (<= M (+ 2 j)) (< (+ 3 j) M)), 48026#(or (<= N i) (<= (+ M i) (+ N j))), 48027#(or (<= N (+ i 1)) (<= (+ M i 1) (+ N j)))] [2022-03-15 21:52:40,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 21:52:40,818 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:40,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 21:52:40,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:52:40,818 INFO L87 Difference]: Start difference. First operand 1534 states and 6443 transitions. Second operand has 18 states, 18 states have (on average 4.5) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:42,023 INFO L93 Difference]: Finished difference Result 4731 states and 18323 transitions. [2022-03-15 21:52:42,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 21:52:42,024 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:52:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:42,041 INFO L225 Difference]: With dead ends: 4731 [2022-03-15 21:52:42,041 INFO L226 Difference]: Without dead ends: 4731 [2022-03-15 21:52:42,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=864, Invalid=2558, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 21:52:42,042 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:42,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:52:42,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2022-03-15 21:52:42,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 2161. [2022-03-15 21:52:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2161 states, 2160 states have (on average 4.264814814814815) internal successors, (9212), 2160 states have internal predecessors, (9212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 9212 transitions. [2022-03-15 21:52:42,143 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 9212 transitions. Word has length 16 [2022-03-15 21:52:42,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:42,143 INFO L470 AbstractCegarLoop]: Abstraction has 2161 states and 9212 transitions. [2022-03-15 21:52:42,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 9212 transitions. [2022-03-15 21:52:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:52:42,150 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:42,150 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:42,177 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 21:52:42,375 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,SelfDestructingSolverStorable23 [2022-03-15 21:52:42,376 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:42,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:42,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1898096658, now seen corresponding path program 5 times [2022-03-15 21:52:42,377 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:42,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070549977] [2022-03-15 21:52:42,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:42,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:42,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:42,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070549977] [2022-03-15 21:52:42,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070549977] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:42,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673000629] [2022-03-15 21:52:42,413 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:52:42,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:42,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:42,414 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 21:52:42,415 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 21:52:42,436 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:52:42,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:42,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:52:42,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:42,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:42,555 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 21:52:42,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673000629] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:42,555 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:42,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-03-15 21:52:42,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [920674172] [2022-03-15 21:52:42,556 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:42,556 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:42,561 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 21:52:42,561 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:43,434 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [57260#(or (<= N i) (< (+ i 1) N) (< j M)), 57259#(or (<= N i) (<= (+ 2 i) N)), 57266#(or (<= N i) (<= i k)), 57261#(or (< j M) (< k N)), 57264#(or (< j M) (<= i k)), 57274#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 57254#(< k N), 57255#(or (<= N k) (< (+ k 1) N)), 57271#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 57269#(or (<= N (+ i 1)) (<= (+ 2 i) k)), 57257#(< j M), 57258#(or (< j M) (< i N)), 57268#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 57256#(or (<= N (+ k 1)) (< (+ 2 k) N)), 57275#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= M j)), 57272#(or (<= N (+ i 1)) (< j M) (<= (+ 2 i) k)), 57263#(or (< j M) (<= N k) (< (+ k 1) N)), 57265#(or (<= (+ i 1) k) (<= N i) (< j M)), 57267#(or (<= N i) (<= (+ M i) (+ k j 1))), 57262#(or (<= (+ i 1) k) (<= N i)), 57270#(or (<= N (+ i 1)) (<= (+ i 1) k)), 57273#(or (<= N (+ i 1)) (<= (+ M i) (+ k j)))] [2022-03-15 21:52:43,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:52:43,434 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:43,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:52:43,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1131, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:52:43,435 INFO L87 Difference]: Start difference. First operand 2161 states and 9212 transitions. Second operand has 30 states, 30 states have (on average 3.2) internal successors, (96), 29 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 21:52:47,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:47,987 INFO L93 Difference]: Finished difference Result 8451 states and 31922 transitions. [2022-03-15 21:52:47,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2022-03-15 21:52:47,987 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.2) internal successors, (96), 29 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 21:52:47,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:48,013 INFO L225 Difference]: With dead ends: 8451 [2022-03-15 21:52:48,013 INFO L226 Difference]: Without dead ends: 8451 [2022-03-15 21:52:48,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8946 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4980, Invalid=21752, Unknown=0, NotChecked=0, Total=26732 [2022-03-15 21:52:48,015 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 543 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:48,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [543 Valid, 0 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:52:48,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8451 states. [2022-03-15 21:52:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8451 to 2821. [2022-03-15 21:52:48,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2821 states, 2820 states have (on average 4.459219858156028) internal successors, (12575), 2820 states have internal predecessors, (12575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 12575 transitions. [2022-03-15 21:52:48,199 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 12575 transitions. Word has length 16 [2022-03-15 21:52:48,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:48,199 INFO L470 AbstractCegarLoop]: Abstraction has 2821 states and 12575 transitions. [2022-03-15 21:52:48,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.2) internal successors, (96), 29 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 21:52:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 12575 transitions. [2022-03-15 21:52:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:52:48,207 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:48,207 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:48,230 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 21:52:48,408 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,SelfDestructingSolverStorable24 [2022-03-15 21:52:48,408 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:48,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:48,408 INFO L85 PathProgramCache]: Analyzing trace with hash 336264413, now seen corresponding path program 6 times [2022-03-15 21:52:48,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:48,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97329739] [2022-03-15 21:52:48,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:48,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:48,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:48,442 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:48,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97329739] [2022-03-15 21:52:48,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97329739] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:48,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556896931] [2022-03-15 21:52:48,442 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:52:48,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:48,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:48,443 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 21:52:48,444 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 21:52:48,465 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:52:48,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:48,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:52:48,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:48,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:48,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556896931] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:48,615 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:48,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 15 [2022-03-15 21:52:48,615 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [572926701] [2022-03-15 21:52:48,615 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:48,616 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:48,619 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 109 transitions. [2022-03-15 21:52:48,619 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:49,257 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [71739#(or (<= N i) (<= (+ 2 i) N)), 71736#(or (< (+ j 1) M) (< k N) (<= M j)), 71735#(or (< (+ j 1) M) (<= M j)), 71737#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 71748#(or (<= N (+ i 1)) (<= (+ M i) (+ k j))), 71741#(or (<= N i) (<= (+ M i 1) (+ N j))), 71745#(or (<= N (+ i 1)) (<= (+ 2 M i) (+ N j))), 71742#(or (<= N i) (<= (+ M i) (+ k j))), 71740#(or (<= N i) (< k N) (<= (+ 2 i) N)), 71738#(or (<= N k) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))), 71747#(or (<= N (+ i 1)) (<= (+ M i 1) (+ k j))), 71732#(or (< k N) (< i N)), 71744#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 71743#(or (<= N i) (<= (+ M i) (+ k j 1))), 71733#(< j M), 71731#(< k N), 71746#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< k N)), 71734#(or (< j M) (< k N))] [2022-03-15 21:52:49,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:52:49,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:49,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:52:49,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:52:49,258 INFO L87 Difference]: Start difference. First operand 2821 states and 12575 transitions. Second operand has 25 states, 25 states have (on average 3.24) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:55,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:55,011 INFO L93 Difference]: Finished difference Result 10666 states and 42438 transitions. [2022-03-15 21:52:55,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2022-03-15 21:52:55,011 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.24) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:52:55,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:55,037 INFO L225 Difference]: With dead ends: 10666 [2022-03-15 21:52:55,037 INFO L226 Difference]: Without dead ends: 10663 [2022-03-15 21:52:55,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12348 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6473, Invalid=27567, Unknown=0, NotChecked=0, Total=34040 [2022-03-15 21:52:55,039 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 374 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:55,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 0 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:52:55,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10663 states. [2022-03-15 21:52:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10663 to 3364. [2022-03-15 21:52:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3364 states, 3363 states have (on average 4.566458519179304) internal successors, (15357), 3363 states have internal predecessors, (15357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 15357 transitions. [2022-03-15 21:52:55,214 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 15357 transitions. Word has length 16 [2022-03-15 21:52:55,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:55,214 INFO L470 AbstractCegarLoop]: Abstraction has 3364 states and 15357 transitions. [2022-03-15 21:52:55,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.24) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 15357 transitions. [2022-03-15 21:52:55,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:52:55,223 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:55,223 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:55,248 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 21:52:55,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 21:52:55,439 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:55,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:55,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1840522419, now seen corresponding path program 7 times [2022-03-15 21:52:55,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:55,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323434989] [2022-03-15 21:52:55,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:55,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:55,471 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 21:52:55,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:55,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323434989] [2022-03-15 21:52:55,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323434989] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:55,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044351739] [2022-03-15 21:52:55,472 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:52:55,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:55,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:55,473 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 21:52:55,477 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 21:52:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:55,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:52:55,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:55,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 21:52:55,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:55,644 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 21:52:55,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044351739] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:55,645 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:55,645 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 15 [2022-03-15 21:52:55,645 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [558656070] [2022-03-15 21:52:55,645 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:55,645 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:55,650 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 133 transitions. [2022-03-15 21:52:55,650 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:56,343 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [89556#(or (<= N i) (< (+ i 1) N) (< j M)), 89567#(< k N), 89570#(or (<= N (+ i 1)) (<= (+ M i) (+ k j))), 89551#(< i N), 89558#(or (< (+ j 1) M) (<= N k) (<= M j)), 89552#(or (<= N k) (< i N)), 89566#(or (<= N (+ i 1)) (<= (+ M i 1) (+ k j))), 89560#(or (<= (+ N M) (+ 2 k j)) (<= M j)), 89564#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 89553#(< j M), 89555#(or (<= N i) (< (+ i 1) N)), 89557#(or (< j M) (<= N k)), 89569#(or (<= N i) (<= (+ M i) (+ k j 1))), 89561#(or (<= N (+ i 1)) (< (+ 2 i) N)), 89565#(or (<= N i) (<= (+ M i) (+ k j))), 89568#(or (<= N k) (< (+ k 1) N)), 89563#(or (<= N i) (< (+ i 1) N) (<= N k)), 89562#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 89554#(or (< j M) (< i N)), 89559#(or (<= N k) (< (+ 2 j) M) (<= M (+ j 1)))] [2022-03-15 21:52:56,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:52:56,344 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:56,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:52:56,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:52:56,344 INFO L87 Difference]: Start difference. First operand 3364 states and 15357 transitions. Second operand has 27 states, 27 states have (on average 3.185185185185185) 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 21:52:59,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:59,203 INFO L93 Difference]: Finished difference Result 7957 states and 34525 transitions. [2022-03-15 21:52:59,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 21:52:59,203 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.185185185185185) 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 16 [2022-03-15 21:52:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:59,222 INFO L225 Difference]: With dead ends: 7957 [2022-03-15 21:52:59,222 INFO L226 Difference]: Without dead ends: 7844 [2022-03-15 21:52:59,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4176 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3292, Invalid=11714, Unknown=0, NotChecked=0, Total=15006 [2022-03-15 21:52:59,223 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 308 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:59,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 0 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:52:59,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7844 states. [2022-03-15 21:52:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7844 to 3734. [2022-03-15 21:52:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3733 states have (on average 4.613447629252612) internal successors, (17222), 3733 states have internal predecessors, (17222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:59,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 17222 transitions. [2022-03-15 21:52:59,381 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 17222 transitions. Word has length 16 [2022-03-15 21:52:59,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:59,381 INFO L470 AbstractCegarLoop]: Abstraction has 3734 states and 17222 transitions. [2022-03-15 21:52:59,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.185185185185185) 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 21:52:59,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 17222 transitions. [2022-03-15 21:52:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:52:59,390 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:59,390 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:59,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:59,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:59,599 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:59,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash 284552683, now seen corresponding path program 8 times [2022-03-15 21:52:59,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:59,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803380732] [2022-03-15 21:52:59,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:59,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:59,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:59,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803380732] [2022-03-15 21:52:59,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803380732] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:59,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031032407] [2022-03-15 21:52:59,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:52:59,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:59,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:59,635 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 21:52:59,635 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 21:52:59,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:52:59,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:59,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:52:59,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:59,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:59,819 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 21:52:59,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031032407] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:59,819 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:59,820 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 21:52:59,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1061714508] [2022-03-15 21:52:59,820 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:59,820 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:59,824 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 112 transitions. [2022-03-15 21:52:59,824 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:00,608 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [105279#(or (<= N i) (<= (+ M i 1) (+ N j))), 105293#(or (<= N i) (<= (+ M i) (+ k j 1))), 105297#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< k N)), 105290#(or (<= (+ M i) (+ N j)) (< k N)), 105282#(or (< (+ j 1) M) (<= M j)), 105283#(or (< (+ 2 j) M) (<= M (+ j 1))), 105286#(or (< (+ j 1) M) (< k N) (<= M j)), 105298#(or (<= N (+ i 1)) (< k N) (<= (+ 2 M i) (+ N j))), 105284#(< k N), 105281#(< j M), 105289#(or (< k N) (< i N)), 105285#(or (< j M) (< k N)), 105296#(or (<= N (+ i 1)) (<= (+ M i 1) (+ N j))), 105299#(or (<= N (+ i 1)) (<= (+ M i) (+ k j))), 105291#(or (<= N i) (< k N) (<= (+ 2 i) N)), 105287#(or (< k N) (< (+ 2 j) M) (<= M (+ j 1))), 105292#(or (<= N i) (< k N) (<= (+ M i 1) (+ N j))), 105278#(or (<= N i) (<= (+ 2 i) N)), 105295#(or (<= N (+ i 1)) (<= (+ 2 M i) (+ N j))), 105280#(or (<= N i) (<= (+ M i) (+ N j))), 105288#(or (<= N k) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))), 105294#(or (<= N (+ i 1)) (<= (+ 3 i) N))] [2022-03-15 21:53:00,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:53:00,609 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:00,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:53:00,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1411, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 21:53:00,609 INFO L87 Difference]: Start difference. First operand 3734 states and 17222 transitions. Second operand has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:05,448 INFO L93 Difference]: Finished difference Result 11296 states and 46339 transitions. [2022-03-15 21:53:05,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2022-03-15 21:53:05,449 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:53:05,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:05,475 INFO L225 Difference]: With dead ends: 11296 [2022-03-15 21:53:05,476 INFO L226 Difference]: Without dead ends: 11293 [2022-03-15 21:53:05,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9312 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5184, Invalid=22872, Unknown=0, NotChecked=0, Total=28056 [2022-03-15 21:53:05,477 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 576 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:05,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 0 Invalid, 1687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:53:05,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11293 states. [2022-03-15 21:53:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11293 to 5303. [2022-03-15 21:53:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5303 states, 5302 states have (on average 4.751603168615617) internal successors, (25193), 5302 states have internal predecessors, (25193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 25193 transitions. [2022-03-15 21:53:05,663 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 25193 transitions. Word has length 16 [2022-03-15 21:53:05,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:05,663 INFO L470 AbstractCegarLoop]: Abstraction has 5303 states and 25193 transitions. [2022-03-15 21:53:05,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 25193 transitions. [2022-03-15 21:53:05,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:53:05,674 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:05,675 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:05,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-03-15 21:53:05,875 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,SelfDestructingSolverStorable27 [2022-03-15 21:53:05,875 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:53:05,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:05,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2082520206, now seen corresponding path program 9 times [2022-03-15 21:53:05,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:05,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144532245] [2022-03-15 21:53:05,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:05,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:05,913 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 21:53:05,913 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:05,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144532245] [2022-03-15 21:53:05,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144532245] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:05,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670382521] [2022-03-15 21:53:05,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:53:05,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:05,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:05,915 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:53:05,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 21:53:05,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 21:53:05,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:05,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:53:05,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:06,018 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 21:53:06,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:06,100 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 21:53:06,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670382521] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:06,100 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:06,100 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 21:53:06,101 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [81900603] [2022-03-15 21:53:06,101 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:06,101 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:06,105 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 98 transitions. [2022-03-15 21:53:06,105 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:06,601 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [127568#(or (< i N) (<= M j)), 127572#(or (<= N i) (< (+ i 1) N) (< k N)), 127576#(or (<= N (+ i 1)) (< (+ 2 i) N)), 127567#(< i N), 127571#(or (<= N i) (< (+ i 1) N)), 127574#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 127578#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 127570#(or (<= (+ N M) (+ k j 1)) (< i N)), 127577#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 127575#(or (<= N i) (<= (+ M i) (+ k j 1))), 127566#(< k N), 127569#(or (< k N) (< i N)), 127579#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 127580#(or (<= N (+ i 1)) (<= (+ M i) (+ k j))), 127573#(or (<= N i) (< (+ i 1) N) (<= M j))] [2022-03-15 21:53:06,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:53:06,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:06,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:53:06,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:53:06,602 INFO L87 Difference]: Start difference. First operand 5303 states and 25193 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:08,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:08,105 INFO L93 Difference]: Finished difference Result 8748 states and 38953 transitions. [2022-03-15 21:53:08,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-15 21:53:08,105 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:53:08,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:08,130 INFO L225 Difference]: With dead ends: 8748 [2022-03-15 21:53:08,131 INFO L226 Difference]: Without dead ends: 8722 [2022-03-15 21:53:08,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2229 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1886, Invalid=6304, Unknown=0, NotChecked=0, Total=8190 [2022-03-15 21:53:08,132 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 235 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:08,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 0 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:53:08,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8722 states. [2022-03-15 21:53:08,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8722 to 5680. [2022-03-15 21:53:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5680 states, 5679 states have (on average 4.771438633562247) internal successors, (27097), 5679 states have internal predecessors, (27097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5680 states to 5680 states and 27097 transitions. [2022-03-15 21:53:08,277 INFO L78 Accepts]: Start accepts. Automaton has 5680 states and 27097 transitions. Word has length 16 [2022-03-15 21:53:08,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:08,277 INFO L470 AbstractCegarLoop]: Abstraction has 5680 states and 27097 transitions. [2022-03-15 21:53:08,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 5680 states and 27097 transitions. [2022-03-15 21:53:08,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:53:08,290 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:08,290 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:08,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 21:53:08,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 21:53:08,512 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:53:08,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:08,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1040837467, now seen corresponding path program 8 times [2022-03-15 21:53:08,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:08,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155134282] [2022-03-15 21:53:08,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:08,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:08,728 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 21:53:08,728 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:08,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155134282] [2022-03-15 21:53:08,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155134282] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:08,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235466582] [2022-03-15 21:53:08,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:53:08,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:08,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:08,730 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:53:08,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 21:53:08,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:53:08,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:08,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 21:53:08,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:08,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:08,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:08,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:08,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:08,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:08,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:08,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:08,967 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-03-15 21:53:08,992 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 21:53:08,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:09,186 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:53:09,187 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 32 treesize of output 97 [2022-03-15 21:53:09,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:09,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:09,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:09,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:09,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:09,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:09,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:09,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:09,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 3 [2022-03-15 21:53:09,453 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 21:53:09,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235466582] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:09,453 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:09,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-03-15 21:53:09,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1705011309] [2022-03-15 21:53:09,453 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:09,454 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:09,460 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 173 transitions. [2022-03-15 21:53:09,460 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:13,451 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [147942#(and (or (<= N i) (<= (+ 2 k) N) (<= (+ (select A i) res1) (+ res2 (select A k)))) (or (<= N i) (<= (+ 2 k) N) (<= (+ res2 (select A k)) (+ (select A i) res1)))), 147945#(and (or (<= N i) (< j M) (<= (+ (select A i) res1) res2)) (or (<= N i) (< j M) (< res2 (+ (select A i) res1 1)))), 147967#(and (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M)) (or (<= N (+ 2 i)) (< j M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) res2 (select A k))) (<= (+ k 4) N)) (or (<= N (+ 2 i)) (< j M) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)))) (<= (+ k 4) N))), 147943#(and (or (<= N i) (<= (+ 2 k) N)) (or (<= (+ 3 k) N) (<= (+ (select A i) res1) (+ (select A (+ k 1)) res2 (select A k))) (<= N i)) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) res2 (select A k)) (+ (select A i) res1)) (<= N i))), 147927#(and (or (<= N i) (< res2 (+ (select A i) res1 1))) (or (<= N i) (<= (+ (select A i) res1) res2))), 147931#(and (or (<= N (+ 2 i)) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2)) (or (<= N (+ 2 i)) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1)))), 147951#(and (or (<= N (+ i 1)) (<= (+ 2 k) N) (<= (+ res2 (select A k)) (+ (select A i) res1 (select A (+ i 1))))) (or (<= N (+ i 1)) (<= (+ 2 k) N) (<= (+ (select A i) res1 (select A (+ i 1))) (+ res2 (select A k))))), 147936#(and (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< j M) (<= res1 (+ (select A (+ k 1)) res2 (select A k)))) (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< j M) (< (+ (select A (+ k 1)) res2 (select A k)) (+ res1 1)))), 147953#(and (or (<= N (+ i 1)) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) res2 (select A k))) (<= (+ k 4) N)) (or (<= N (+ i 1)) (<= (+ 3 k) N)) (or (<= N (+ i 1)) (<= (+ k 4) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) res2 (select A k)) (+ (select A i) res1 (select A (+ i 1)))))), 147965#(and (or (< j M) (<= res1 (+ res2 (select A k)))) (or (< j M) (<= (+ res2 (select A k)) res1)) (or (< j M) (<= (+ k 1) i))), 147966#(and (or (<= N (+ 2 i)) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)))) (<= (+ k 4) N)) (or (<= (+ 3 k) N) (<= N (+ 2 i))) (or (<= N (+ 2 i)) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) res2 (select A k))) (<= (+ k 4) N))), 147963#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ res2 (select A k))))), 147934#(and (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (<= res1 (+ (select A (+ k 1)) res2 (select A k)))) (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< (+ (select A (+ k 1)) res2 (select A k)) (+ res1 1)))), 147955#(and (or (<= N (+ i 1)) (< j M) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< j M) (< k N) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 147949#(and (or (<= (+ (select A (+ (- 2) N)) res2 (select A k) (select A (+ (- 1) N))) (+ (select A i) res1)) (<= N i) (< j M) (< (+ 3 k) N)) (or (<= (+ (select A i) res1) (+ (select A (+ (- 2) N)) res2 (select A k) (select A (+ (- 1) N)))) (<= N i) (< j M) (< (+ 3 k) N)) (or (<= (+ 3 k) N) (<= N i) (< j M))), 147959#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ res2 (select A k))))), 147925#(and (or (<= res1 res2) (< j M)) (or (< j M) (< res2 (+ res1 1)))), 147937#(and (or (not (< (+ 2 k) N)) (< (+ (select A (+ k 1)) (select A (+ 2 k)) res2 (select A k)) (+ res1 1)) (<= (+ k 4) N)) (or (not (< (+ 2 k) N)) (<= res1 (+ (select A (+ k 1)) (select A (+ 2 k)) res2 (select A k))) (<= (+ k 4) N))), 147932#(and (or (<= N (+ 2 i)) (< k N) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1))) (or (<= N (+ 2 i)) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2) (< k N))), 147958#(and (or (<= N (+ i 1)) (<= (+ 3 k) N) (< j M)) (or (<= N (+ i 1)) (< j M) (<= (+ k 4) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) res2 (select A k)) (+ (select A i) res1 (select A (+ i 1))))) (or (<= N (+ i 1)) (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) res2 (select A k))) (<= (+ k 4) N))), 147944#(and (or (<= (+ (select A i) res1) (+ (select A (+ (- 2) N)) res2 (select A k) (select A (+ (- 1) N)))) (<= N i) (< (+ 3 k) N)) (or (<= (+ 3 k) N) (<= N i)) (or (<= (+ (select A (+ (- 2) N)) res2 (select A k) (select A (+ (- 1) N))) (+ (select A i) res1)) (<= N i) (< (+ 3 k) N))), 147956#(and (or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M) (<= (+ res2 (select A k)) (+ (select A i) res1 (select A (+ i 1))))) (or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) (+ res2 (select A k))))), 147960#(and (or (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A (+ k 1)) res2 (select A k))) (<= (+ 3 k) N) (<= N (+ 2 i))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (+ (select A (+ k 1)) res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= (+ 2 k) N))), 147950#(and (or (< j M) (<= (+ (select A (+ (- 1) i)) res2 (select A k)) res1) (< (+ 2 k) i)) (or (<= (+ 2 k) i) (< j M)) (or (< j M) (<= res1 (+ (select A (+ (- 1) i)) res2 (select A k))) (< (+ 2 k) i))), 147952#(and (or (<= (+ (select A (+ k 1)) res2 (select A k)) (+ (select A i) res1 (select A (+ i 1)))) (<= N (+ i 1)) (<= (+ 3 k) N)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A (+ k 1)) res2 (select A k)))) (or (<= N (+ i 1)) (<= (+ 2 k) N))), 147948#(and (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) res2 (select A k)) (+ (select A i) res1)) (<= N i) (< j M)) (or (<= (+ 3 k) N) (<= (+ (select A i) res1) (+ (select A (+ k 1)) res2 (select A k))) (<= N i) (< j M)) (or (<= N i) (<= (+ 2 k) N) (< j M))), 147957#(and (or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A (+ k 1)) res2 (select A k)))) (or (<= (+ (select A (+ k 1)) res2 (select A k)) (+ (select A i) res1 (select A (+ i 1)))) (<= N (+ i 1)) (<= (+ 3 k) N) (< j M))), 147940#(and (or (< j M) (<= (+ res2 (select A k) (select A (+ (- 1) N))) res1) (< (+ 2 k) N)) (or (<= (+ 2 k) N) (< j M)) (or (< j M) (< (+ 2 k) N) (<= res1 (+ res2 (select A k) (select A (+ (- 1) N)))))), 147928#(and (or (<= N i) (< k N) (<= (+ (select A i) res1) res2)) (or (<= N i) (< k N) (< res2 (+ (select A i) res1 1)))), 147962#(and (or (<= N (+ 2 i)) (< j M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2) (< k N)) (or (<= N (+ 2 i)) (< j M) (< k N) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1)))), 147946#(and (or (<= N i) (< j M) (< k N) (<= (+ (select A i) res1) res2)) (or (<= N i) (< j M) (< k N) (< res2 (+ (select A i) res1 1)))), 147964#(and (or (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A (+ k 1)) res2 (select A k))) (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (+ (select A (+ k 1)) res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M))), 147939#(and (or (<= (+ 2 k) N) (< j M) (<= (+ res2 (select A k)) res1)) (or (<= (+ 2 k) N) (< j M) (<= res1 (+ res2 (select A k))))), 147935#(and (or (not (< k N)) (<= (+ 2 k) N) (< j M) (<= res1 (+ res2 (select A k)))) (or (not (< k N)) (<= (+ 2 k) N) (< j M) (< (+ res2 (select A k)) (+ res1 1)))), 147929#(and (or (<= N (+ i 1)) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 147961#(and (or (<= N (+ 2 i)) (< j M) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1))) (or (<= N (+ 2 i)) (< j M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2))), 147933#(and (or (not (< k N)) (<= (+ 2 k) N) (< (+ res2 (select A k)) (+ res1 1))) (or (not (< k N)) (<= (+ 2 k) N) (<= res1 (+ res2 (select A k))))), 147926#(and (or (<= (+ k 1) N) (< j M) (< res2 (+ res1 1))) (or (<= res1 res2) (<= (+ k 1) N) (< j M))), 147941#(and (or (< j M) (<= res1 (+ (select A (+ k 1)) res2 (select A k) (select A (+ (- 1) N)))) (< (+ 3 k) N)) (or (<= (+ 3 k) N) (< j M)) (or (< j M) (<= (+ (select A (+ k 1)) res2 (select A k) (select A (+ (- 1) N))) res1) (< (+ 3 k) N))), 147930#(and (or (<= N (+ i 1)) (< k N) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1))) (or (<= N (+ i 1)) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) res2))), 147938#(and (or (not (< (+ 2 k) N)) (< j M) (< (+ (select A (+ k 1)) (select A (+ 2 k)) res2 (select A k)) (+ res1 1)) (<= (+ k 4) N)) (or (not (< (+ 2 k) N)) (< j M) (<= res1 (+ (select A (+ k 1)) (select A (+ 2 k)) res2 (select A k))) (<= (+ k 4) N))), 147954#(and (or (<= N (+ i 1)) (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< j M) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 147947#(and (or (<= N i) (<= (+ 2 k) N) (< j M) (<= (+ res2 (select A k)) (+ (select A i) res1))) (or (<= N i) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) res1) (+ res2 (select A k)))))] [2022-03-15 21:53:13,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 21:53:13,451 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:13,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 21:53:13,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=3844, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 21:53:13,452 INFO L87 Difference]: Start difference. First operand 5680 states and 27097 transitions. Second operand has 54 states, 53 states have (on average 2.7169811320754715) internal successors, (144), 53 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:39,656 INFO L93 Difference]: Finished difference Result 7626 states and 33255 transitions. [2022-03-15 21:53:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2022-03-15 21:53:39,656 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.7169811320754715) internal successors, (144), 53 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:53:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:39,675 INFO L225 Difference]: With dead ends: 7626 [2022-03-15 21:53:39,675 INFO L226 Difference]: Without dead ends: 7569 [2022-03-15 21:53:39,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26543 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=11216, Invalid=60340, Unknown=0, NotChecked=0, Total=71556 [2022-03-15 21:53:39,678 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 759 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 3161 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 3161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:39,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [759 Valid, 0 Invalid, 3425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 3161 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 21:53:39,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7569 states. [2022-03-15 21:53:39,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7569 to 5827. [2022-03-15 21:53:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5827 states, 5826 states have (on average 4.760556127703398) internal successors, (27735), 5826 states have internal predecessors, (27735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5827 states to 5827 states and 27735 transitions. [2022-03-15 21:53:39,850 INFO L78 Accepts]: Start accepts. Automaton has 5827 states and 27735 transitions. Word has length 17 [2022-03-15 21:53:39,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:39,850 INFO L470 AbstractCegarLoop]: Abstraction has 5827 states and 27735 transitions. [2022-03-15 21:53:39,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.7169811320754715) internal successors, (144), 53 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5827 states and 27735 transitions. [2022-03-15 21:53:39,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:53:39,863 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:39,863 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:39,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 21:53:40,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:40,085 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:53:40,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:40,085 INFO L85 PathProgramCache]: Analyzing trace with hash -499388202, now seen corresponding path program 9 times [2022-03-15 21:53:40,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:40,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630179585] [2022-03-15 21:53:40,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:40,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:40,131 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 21:53:40,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:40,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630179585] [2022-03-15 21:53:40,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630179585] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:40,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317535144] [2022-03-15 21:53:40,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:53:40,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:40,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:40,133 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:53:40,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 21:53:40,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:53:40,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:40,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:53:40,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:40,260 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 21:53:40,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:40,301 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 21:53:40,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317535144] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:40,301 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:40,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-03-15 21:53:40,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [418221282] [2022-03-15 21:53:40,301 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:40,302 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:40,308 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 21:53:40,308 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:41,105 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [167770#(or (<= N i) (< (+ i 1) N) (<= (+ N 1) k)), 167768#(or (<= N k) (< i N)), 167778#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 167773#(or (<= N i) (<= i (+ k 1))), 167774#(or (<= N (+ i 1)) (< (+ 2 i) N)), 167775#(or (<= N k) (< (+ k 1) N)), 167782#(or (< (+ k 4) N) (<= N (+ 3 k))), 167764#(< i N), 167769#(or (<= N (+ k 1)) (< i N)), 167765#(or (<= N i) (< (+ i 1) N)), 167777#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 167772#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 167781#(or (<= N (+ i 1)) (<= i k)), 167766#(< k N), 167776#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N 1) k)), 167771#(or (<= N i) (< (+ i 1) N) (<= N k)), 167780#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 167767#(or (<= (+ N 1) k) (< i N)), 167779#(or (<= N (+ k 1)) (< (+ 2 k) N))] [2022-03-15 21:53:41,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:53:41,106 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:41,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:53:41,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:53:41,107 INFO L87 Difference]: Start difference. First operand 5827 states and 27735 transitions. Second operand has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 27 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:41,915 INFO L93 Difference]: Finished difference Result 9527 states and 43955 transitions. [2022-03-15 21:53:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 21:53:41,916 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 27 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:53:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:41,942 INFO L225 Difference]: With dead ends: 9527 [2022-03-15 21:53:41,942 INFO L226 Difference]: Without dead ends: 9475 [2022-03-15 21:53:41,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=977, Invalid=3445, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 21:53:41,943 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 207 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:41,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 0 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:53:41,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9475 states. [2022-03-15 21:53:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9475 to 6946. [2022-03-15 21:53:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6946 states, 6945 states have (on average 4.804319654427646) internal successors, (33366), 6945 states have internal predecessors, (33366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:42,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6946 states to 6946 states and 33366 transitions. [2022-03-15 21:53:42,138 INFO L78 Accepts]: Start accepts. Automaton has 6946 states and 33366 transitions. Word has length 17 [2022-03-15 21:53:42,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:42,138 INFO L470 AbstractCegarLoop]: Abstraction has 6946 states and 33366 transitions. [2022-03-15 21:53:42,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 27 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:42,138 INFO L276 IsEmpty]: Start isEmpty. Operand 6946 states and 33366 transitions. [2022-03-15 21:53:42,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:53:42,149 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:42,150 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:42,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 21:53:42,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:42,350 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:53:42,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:42,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1677980999, now seen corresponding path program 10 times [2022-03-15 21:53:42,351 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:42,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660518051] [2022-03-15 21:53:42,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:42,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:42,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:42,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660518051] [2022-03-15 21:53:42,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660518051] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:42,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397674943] [2022-03-15 21:53:42,398 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:53:42,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:42,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:42,400 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:53:42,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 21:53:42,422 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:53:42,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:42,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:53:42,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:42,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:42,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397674943] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:42,698 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:42,698 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-03-15 21:53:42,698 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2108978634] [2022-03-15 21:53:42,699 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:42,700 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:42,706 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 163 transitions. [2022-03-15 21:53:42,706 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:43,942 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [191387#(or (<= N (+ i 1)) (<= (+ 3 k) N)), 191391#(or (<= N i) (< j M)), 191393#(or (<= (+ 3 k j) (+ N M)) (<= N i)), 191383#(or (<= (+ 3 k) N) (<= N i)), 191381#(<= N i), 191407#(or (<= (+ 2 k) N) (< j M) (<= N (+ 3 i))), 191406#(or (< j M) (<= N (+ 3 i))), 191399#(or (<= (+ 3 k) N) (<= N (+ 2 i))), 191412#(or (<= N (+ 2 i)) (<= (+ k j 4) (+ N M))), 191389#(or (< j M) (< k N)), 191390#(or (< j M) (<= N k) (< (+ k 1) N)), 191385#(<= N (+ i 1)), 191411#(or (<= N (+ i 1)) (<= (+ k j 4) (+ N M))), 191395#(or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M)), 191405#(or (<= (+ 2 k) N) (<= N (+ 3 i))), 191351#(or (<= (+ 2 k) N) (< j M)), 191402#(or (<= (+ 3 k j) (+ N M)) (<= N (+ 2 i))), 191413#(or (<= N (+ 3 i)) (<= (+ k j 4) (+ N M))), 191388#(< j M), 191382#(or (<= N i) (<= (+ 2 k) N)), 191410#(or (<= N i) (<= (+ k j 4) (+ N M))), 191344#(< k N), 191401#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M)), 191404#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 191400#(or (<= N (+ 2 i)) (< j M)), 191409#(or (<= (+ 3 k j) (+ N M)) (<= N (+ 3 i))), 191386#(or (<= N (+ i 1)) (<= (+ 2 k) N)), 191398#(or (<= N (+ 2 i)) (<= (+ 2 k) N)), 191394#(or (<= N (+ i 1)) (< j M)), 191403#(<= N (+ 3 i)), 191392#(or (<= N i) (<= (+ 2 k) N) (< j M)), 191397#(<= N (+ 2 i)), 191396#(or (<= (+ 3 k j) (+ N M)) (<= N (+ i 1))), 191384#(or (<= N k) (< (+ k 1) N)), 191408#(or (<= (+ 3 k) N) (<= N (+ 3 i)))] [2022-03-15 21:53:43,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 21:53:43,943 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:43,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 21:53:43,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=2531, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 21:53:43,944 INFO L87 Difference]: Start difference. First operand 6946 states and 33366 transitions. Second operand has 45 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 44 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:48,079 INFO L93 Difference]: Finished difference Result 9222 states and 39980 transitions. [2022-03-15 21:53:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2022-03-15 21:53:48,080 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 44 states have internal predecessors, (128), 0 states have call successors, (0), 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 21:53:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:48,103 INFO L225 Difference]: With dead ends: 9222 [2022-03-15 21:53:48,103 INFO L226 Difference]: Without dead ends: 9219 [2022-03-15 21:53:48,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14002 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=8677, Invalid=33965, Unknown=0, NotChecked=0, Total=42642 [2022-03-15 21:53:48,105 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 424 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:48,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 0 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 2116 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 21:53:48,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9219 states. [2022-03-15 21:53:48,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9219 to 7157. [2022-03-15 21:53:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7157 states, 7156 states have (on average 4.790106204583566) internal successors, (34278), 7156 states have internal predecessors, (34278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:48,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7157 states to 7157 states and 34278 transitions. [2022-03-15 21:53:48,290 INFO L78 Accepts]: Start accepts. Automaton has 7157 states and 34278 transitions. Word has length 17 [2022-03-15 21:53:48,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:48,290 INFO L470 AbstractCegarLoop]: Abstraction has 7157 states and 34278 transitions. [2022-03-15 21:53:48,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 44 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:48,290 INFO L276 IsEmpty]: Start isEmpty. Operand 7157 states and 34278 transitions. [2022-03-15 21:53:48,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:53:48,302 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:48,302 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:48,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-03-15 21:53:48,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:48,504 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:53:48,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:48,505 INFO L85 PathProgramCache]: Analyzing trace with hash 416326918, now seen corresponding path program 8 times [2022-03-15 21:53:48,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:48,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502458202] [2022-03-15 21:53:48,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:48,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:48,688 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 21:53:48,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:48,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502458202] [2022-03-15 21:53:48,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502458202] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:48,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124619435] [2022-03-15 21:53:48,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:53:48,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:48,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:48,690 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:53:48,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 21:53:48,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:53:48,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:48,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 21:53:48,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:48,866 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 28 treesize of output 16 [2022-03-15 21:53:48,891 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 21:53:48,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:49,125 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:53:49,125 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 32 treesize of output 97 [2022-03-15 21:53:49,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:49,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:49,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:49,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:49,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:49,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:53:49,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:49,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:53:49,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 3 [2022-03-15 21:53:49,310 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 21:53:49,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124619435] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:49,311 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:49,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2022-03-15 21:53:49,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2117412744] [2022-03-15 21:53:49,311 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:49,312 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:49,318 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 209 transitions. [2022-03-15 21:53:49,318 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:53,830 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [215374#(and (or (not (< (+ j 1) M)) (<= res1 (+ (select A j) (select A (+ j 1)) res2)) (<= (+ 3 j) M)) (or (not (< (+ j 1) M)) (<= (+ 3 j) M) (< (+ (select A j) (select A (+ j 1)) res2) (+ res1 1)))), 215408#(and (or (<= N (+ 2 i)) (<= (+ (select A j) (select A (+ 2 j)) (select A (+ j 1)) res2) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)))) (<= (+ j 4) M)) (or (<= N (+ 2 i)) (<= (+ j 4) M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A j) (select A (+ 2 j)) (select A (+ j 1)) res2))) (or (<= N (+ 2 i)) (<= (+ 3 j) M))), 215383#(and (or (<= N i) (< j M) (<= (+ (select A i) res1) res2)) (or (<= N i) (< j M) (< res2 (+ (select A i) res1 1)))), 215396#(and (or (<= N (+ 2 i)) (< k N) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1))) (or (<= N (+ 2 i)) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2) (< k N))), 215409#(and (or (<= N (+ 2 i)) (<= (+ 3 j) M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2)) (< k N)) (or (<= N (+ 2 i)) (<= (+ 3 j) M) (< k N) (<= (+ (select A j) (select A (+ j 1)) res2) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (< k N))), 215384#(and (or (<= (+ 2 j) M) (<= N i) (<= (+ (select A j) res2) (+ (select A i) res1))) (or (<= (+ (select A i) res1) (+ (select A j) res2)) (<= (+ 2 j) M) (<= N i))), 215403#(and (or (<= N i) (<= (+ 3 j) M)) (or (<= N i) (<= (+ (select A j) (select A (+ (- 2) M)) (select A (+ (- 1) M)) res2) (+ (select A i) res1)) (< (+ 3 j) M)) (or (<= (+ (select A i) res1) (+ (select A j) (select A (+ (- 2) M)) (select A (+ (- 1) M)) res2)) (<= N i) (< (+ 3 j) M))), 215379#(and (or (< k N) (< (+ 2 j) M) (<= (+ (select A j) (select A (+ (- 1) M)) res2) res1)) (or (<= res1 (+ (select A j) (select A (+ (- 1) M)) res2)) (< k N) (< (+ 2 j) M)) (or (<= (+ 2 j) M) (< k N))), 215398#(and (or (<= (+ 2 j) M) (<= N i) (<= (+ (select A j) res2) (+ (select A i) res1)) (< k N)) (or (<= (+ (select A i) res1) (+ (select A j) res2)) (<= (+ 2 j) M) (<= N i) (< k N))), 215407#(and (or (<= N (+ i 1)) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) res2 (select A (+ (- 2) (* (- 1) k) N M)))) (< (+ 3 k j) (+ N M))) (or (<= N (+ i 1)) (<= (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) res2 (select A (+ (- 2) (* (- 1) k) N M))) (+ (select A i) res1 (select A (+ i 1)))) (< (+ 3 k j) (+ N M))) (or (<= (+ 3 k j) (+ N M)) (<= N (+ i 1)))), 215401#(and (or (<= (+ j 4) M) (< (+ (select A j) (select A (+ 2 j)) (select A (+ j 1)) res2) (+ res1 1)) (< k N) (not (< (+ 2 j) M))) (or (<= res1 (+ (select A j) (select A (+ 2 j)) (select A (+ j 1)) res2)) (<= (+ j 4) M) (< k N) (not (< (+ 2 j) M)))), 215399#(and (or (<= N (+ i 1)) (<= (+ (select A j) res2) (+ (select A i) res1 (select A (+ i 1)))) (<= (+ 2 j) M) (< k N)) (or (<= N (+ i 1)) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) res2)) (<= (+ 2 j) M) (< k N))), 215406#(and (or (<= N i) (< (+ 3 k j) (+ N M)) (<= (+ (select A i) res1) (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) res2 (select A (+ (- 2) (* (- 1) k) N M))))) (or (<= (+ 3 k j) (+ N M)) (<= N i)) (or (<= N i) (< (+ 3 k j) (+ N M)) (<= (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) res2 (select A (+ (- 2) (* (- 1) k) N M))) (+ (select A i) res1)))), 215388#(and (or (<= N (+ i 1)) (<= (+ 2 j) M)) (or (<= N (+ i 1)) (<= (+ 3 j) M) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2))) (or (<= N (+ i 1)) (<= (+ (select A j) (select A (+ j 1)) res2) (+ (select A i) res1 (select A (+ i 1)))) (<= (+ 3 j) M))), 215387#(and (or (<= N (+ i 1)) (<= (+ (select A j) res2) (+ (select A i) res1 (select A (+ i 1)))) (<= (+ 2 j) M)) (or (<= N (+ i 1)) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) res2)) (<= (+ 2 j) M))), 215386#(and (or (<= N (+ i 1)) (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< j M) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 215405#(and (or (<= N (+ i 1)) (<= (+ (select A j) (select A (+ j 1)) res2) (+ (select A i) res1 (select A (+ i 1)))) (<= (+ 3 j) M) (< k N)) (or (<= N (+ i 1)) (<= (+ 3 j) M) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2))) (or (<= N (+ i 1)) (<= (+ 2 j) M) (< k N))), 215410#(and (or (<= (+ 3 k j) (+ N M)) (<= N (+ 2 i))) (or (<= N (+ 2 i)) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) res2 (select A (+ (- 2) (* (- 1) k) N M)))) (< (+ 3 k j) (+ N M))) (or (<= N (+ 2 i)) (<= (+ (select A j) (select A (+ (- 1) (* (- 1) k) N M)) res2 (select A (+ (- 2) (* (- 1) k) N M))) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)))) (< (+ 3 k j) (+ N M)))), 215382#(and (or (<= N (+ 2 i)) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2)) (or (<= N (+ 2 i)) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1)))), 215385#(and (or (<= N i) (<= (+ 3 j) M) (<= (+ (select A i) res1) (+ (select A j) (select A (+ j 1)) res2))) (or (<= (+ 2 j) M) (<= N i)) (or (<= N i) (<= (+ 3 j) M) (<= (+ (select A j) (select A (+ j 1)) res2) (+ (select A i) res1)))), 215400#(and (or (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ (select A j) res2) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)))) (< k N)) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A j) res2)) (< k N))), 215381#(and (or (<= N (+ i 1)) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 215392#(and (or (<= N i) (< k N) (<= (+ (select A i) res1) res2)) (or (<= N i) (< k N) (< res2 (+ (select A i) res1 1)))), 215391#(and (or (<= N (+ 2 i)) (<= (+ 2 j) M)) (or (<= N (+ 2 i)) (<= (+ 3 j) M) (<= (+ (select A j) (select A (+ j 1)) res2) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= (+ 3 j) M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2)))), 215372#(and (or (< k N) (<= (+ j 1) M) (< res2 (+ res1 1))) (or (<= res1 res2) (< k N) (<= (+ j 1) M))), 215373#(and (or (<= (+ 2 j) M) (not (< j M)) (< (+ (select A j) res2) (+ res1 1))) (or (<= (+ 2 j) M) (not (< j M)) (<= res1 (+ (select A j) res2)))), 215397#(and (or (<= N (+ 2 i)) (< j M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2) (< k N)) (or (<= N (+ 2 i)) (< j M) (< k N) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1)))), 215377#(and (or (<= (+ 2 j) M) (< k N) (<= res1 (+ (select A j) res2))) (or (<= (+ 2 j) M) (<= (+ (select A j) res2) res1) (< k N))), 215404#(and (or (<= N (+ i 1)) (<= (+ (select A j) (select A (+ 2 j)) (select A (+ j 1)) res2) (+ (select A i) res1 (select A (+ i 1)))) (<= (+ j 4) M)) (or (<= N (+ i 1)) (<= (+ j 4) M) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) (select A (+ 2 j)) (select A (+ j 1)) res2))) (or (<= N (+ i 1)) (<= (+ 3 j) M))), 215378#(and (or (not (< (+ j 1) M)) (<= (+ 3 j) M) (< k N) (< (+ (select A j) (select A (+ j 1)) res2) (+ res1 1))) (or (not (< (+ j 1) M)) (<= res1 (+ (select A j) (select A (+ j 1)) res2)) (<= (+ 3 j) M) (< k N))), 215394#(and (or (<= N i) (< k N) (<= (+ j 1) M) (< res2 (+ (select A i) res1 1))) (or (<= N i) (< k N) (<= (+ j 1) M) (<= (+ (select A i) res1) res2))), 215376#(and (or (<= (+ 2 j) M) (not (< j M)) (< k N) (< (+ (select A j) res2) (+ res1 1))) (or (<= (+ 2 j) M) (not (< j M)) (< k N) (<= res1 (+ (select A j) res2)))), 215371#(and (or (<= res1 res2) (< k N)) (or (< k N) (< res2 (+ res1 1)))), 215380#(and (or (<= N i) (< res2 (+ (select A i) res1 1))) (or (<= N i) (<= (+ (select A i) res1) res2))), 215389#(and (or (<= N (+ 2 i)) (< j M) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1))) (or (<= N (+ 2 i)) (< j M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2))), 215402#(and (or (<= N i) (<= (+ 3 j) M) (< k N) (<= (+ (select A i) res1) (+ (select A j) (select A (+ j 1)) res2))) (or (<= N i) (<= (+ 3 j) M) (< k N) (<= (+ (select A j) (select A (+ j 1)) res2) (+ (select A i) res1))) (or (<= (+ 2 j) M) (<= N i) (< k N))), 215375#(and (or (<= (+ j 4) M) (< (+ (select A j) (select A (+ 2 j)) (select A (+ j 1)) res2) (+ res1 1)) (not (< (+ 2 j) M))) (or (<= res1 (+ (select A j) (select A (+ 2 j)) (select A (+ j 1)) res2)) (<= (+ j 4) M) (not (< (+ 2 j) M)))), 215395#(and (or (<= N (+ i 1)) (< j M) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< j M) (< k N) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 215393#(and (or (<= N (+ i 1)) (< k N) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1))) (or (<= N (+ i 1)) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) res2))), 215390#(and (or (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ (select A j) res2) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A j) res2))))] [2022-03-15 21:53:53,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 21:53:53,831 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:53,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 21:53:53,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=3499, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 21:53:53,832 INFO L87 Difference]: Start difference. First operand 7157 states and 34278 transitions. Second operand has 51 states, 50 states have (on average 3.02) internal successors, (151), 50 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:14,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:55:14,199 INFO L93 Difference]: Finished difference Result 11340 states and 47430 transitions. [2022-03-15 21:55:14,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 559 states. [2022-03-15 21:55:14,200 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 3.02) internal successors, (151), 50 states have internal predecessors, (151), 0 states have call successors, (0), 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 21:55:14,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:55:14,226 INFO L225 Difference]: With dead ends: 11340 [2022-03-15 21:55:14,227 INFO L226 Difference]: Without dead ends: 11267 [2022-03-15 21:55:14,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 600 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156766 ImplicationChecksByTransitivity, 78.0s TimeCoverageRelationStatistics Valid=54655, Invalid=307147, Unknown=0, NotChecked=0, Total=361802 [2022-03-15 21:55:14,241 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1314 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 4345 mSolverCounterSat, 748 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 748 IncrementalHoareTripleChecker+Valid, 4345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:55:14,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1314 Valid, 0 Invalid, 5093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [748 Valid, 4345 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-03-15 21:55:14,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11267 states. [2022-03-15 21:55:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11267 to 7517. [2022-03-15 21:55:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7517 states, 7516 states have (on average 4.757184672698243) internal successors, (35755), 7516 states have internal predecessors, (35755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7517 states to 7517 states and 35755 transitions. [2022-03-15 21:55:14,543 INFO L78 Accepts]: Start accepts. Automaton has 7517 states and 35755 transitions. Word has length 17 [2022-03-15 21:55:14,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:55:14,543 INFO L470 AbstractCegarLoop]: Abstraction has 7517 states and 35755 transitions. [2022-03-15 21:55:14,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.02) internal successors, (151), 50 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 7517 states and 35755 transitions. [2022-03-15 21:55:14,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:55:14,557 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:55:14,557 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:55:14,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-03-15 21:55:14,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:55:14,757 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:55:14,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:55:14,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1835983164, now seen corresponding path program 11 times [2022-03-15 21:55:14,759 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:55:14,759 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879004097] [2022-03-15 21:55:14,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:55:14,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:55:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:55:14,945 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 21:55:14,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:55:14,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879004097] [2022-03-15 21:55:14,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879004097] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:55:14,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844892449] [2022-03-15 21:55:14,946 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:55:14,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:55:14,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:55:14,951 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:55:14,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 21:55:14,982 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:55:14,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:55:14,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 21:55:14,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:55:15,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:15,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:15,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:15,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:55:15,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:15,184 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 27 treesize of output 13 [2022-03-15 21:55:15,207 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 21:55:15,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:55:15,478 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 21:55:15,478 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 29 treesize of output 114 [2022-03-15 21:55:16,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:16,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:16,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:16,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:16,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:16,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:16,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:16,650 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:16,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:16,670 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:55:16,670 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 30 treesize of output 73 [2022-03-15 21:55:16,835 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 21:55:16,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844892449] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:55:16,836 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:55:16,836 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 21:55:16,836 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [670731174] [2022-03-15 21:55:16,836 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:55:16,837 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:55:16,842 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 21:55:16,843 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:55:20,523 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [242997#(and (or (<= N i) (<= (+ 2 k) N) (< j M) (<= (+ res2 (select A k)) (+ (select A i) res1))) (or (<= N i) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) res1) (+ res2 (select A k))))), 243008#(and (or (<= N (+ 2 i)) (< j M) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1))) (or (<= N (+ 2 i)) (< j M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2))), 243013#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ res2 (select A k))))), 242998#(and (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) res2 (select A k)) (+ (select A i) res1)) (<= N i) (< j M)) (or (<= N i) (<= (+ 2 k j) (+ N M))) (or (<= (+ 3 k) N) (<= (+ (select A i) res1) (+ (select A (+ k 1)) res2 (select A k))) (<= N i) (< j M))), 243014#(and (or (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A (+ k 1)) res2 (select A k))) (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (+ (select A (+ k 1)) res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= (+ 2 k j) (+ N M)))), 242986#(and (or (<= N i) (< res2 (+ (select A i) res1 1))) (or (<= N i) (<= (+ (select A i) res1) res2))), 243005#(and (or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M) (<= (+ res2 (select A k)) (+ (select A i) res1 (select A (+ i 1))))) (or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) (+ res2 (select A k))))), 243018#(and (or (<= (+ 3 k) N) (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ (select A j) (select A (+ k 1)) res2 (select A k)) (+ res1 1)) (not (< j M))) (or (<= (+ 3 k) N) (< (+ j 1) M) (not (< (+ k 1) N)) (not (< j M)) (<= res1 (+ (select A j) (select A (+ k 1)) res2 (select A k))))), 242995#(and (or (<= N i) (< j M) (< k N) (<= (+ (select A i) res1) res2)) (or (<= N i) (< j M) (< k N) (< res2 (+ (select A i) res1 1)))), 243006#(and (or (<= N (+ i 1)) (<= (+ 3 k) N) (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A (+ k 1)) res2 (select A k)))) (or (<= N (+ i 1)) (<= (+ 2 k j) (+ N M))) (or (<= (+ (select A (+ k 1)) res2 (select A k)) (+ (select A i) res1 (select A (+ i 1)))) (<= N (+ i 1)) (<= (+ 3 k) N) (< j M))), 243000#(and (or (<= N (+ i 1)) (< k N) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1))) (or (<= N (+ i 1)) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) res2))), 243003#(and (or (<= N (+ i 1)) (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< j M) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 242987#(and (or (<= N i) (< k N) (<= (+ (select A i) res1) res2)) (or (<= N i) (< k N) (< res2 (+ (select A i) res1 1)))), 242984#(and (or (not (< k N)) (<= (+ 2 k) N) (< (+ res2 (select A k)) (+ res1 1))) (or (not (< k N)) (<= (+ 2 k) N) (<= res1 (+ res2 (select A k))))), 243009#(and (or (<= N (+ 2 i)) (< k N) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1))) (or (<= N (+ 2 i)) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2) (< k N))), 243001#(and (or (<= N (+ i 1)) (<= (+ 2 k) N) (<= (+ res2 (select A k)) (+ (select A i) res1 (select A (+ i 1))))) (or (<= N (+ i 1)) (<= (+ 2 k) N) (<= (+ (select A i) res1 (select A (+ i 1))) (+ res2 (select A k))))), 242992#(and (or (not (< k N)) (<= (+ 2 k) N) (< j M) (<= res1 (+ res2 (select A k)))) (or (not (< k N)) (<= (+ 2 k) N) (< j M) (< (+ res2 (select A k)) (+ res1 1)))), 242990#(and (or (<= res1 res2) (< j M)) (or (< j M) (< res2 (+ res1 1)))), 242985#(and (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (<= res1 (+ (select A (+ k 1)) res2 (select A k)))) (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< (+ (select A (+ k 1)) res2 (select A k)) (+ res1 1)))), 242988#(and (or (<= N i) (<= (+ 2 k) N) (<= (+ (select A i) res1) (+ res2 (select A k)))) (or (<= N i) (<= (+ 2 k) N) (<= (+ res2 (select A k)) (+ (select A i) res1)))), 243004#(and (or (<= N (+ i 1)) (< j M) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< j M) (< k N) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 242994#(and (or (<= N i) (< j M) (<= (+ (select A i) res1) res2)) (or (<= N i) (< j M) (< res2 (+ (select A i) res1 1)))), 242989#(and (or (<= N i) (<= (+ 2 k) N)) (or (<= (+ 3 k) N) (<= (+ (select A i) res1) (+ (select A (+ k 1)) res2 (select A k))) (<= N i)) (or (<= (+ 3 k) N) (<= (+ (select A (+ k 1)) res2 (select A k)) (+ (select A i) res1)) (<= N i))), 242999#(and (or (<= N (+ i 1)) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 243015#(and (or (<= (+ 3 k) N) (<= (+ 2 j) M) (<= N i) (<= (+ (select A i) res1) (+ (select A j) res2 (select A k) (select A (+ (- 1) N))))) (or (<= (+ 3 k j) (+ N M)) (<= N i)) (or (<= (+ 3 k) N) (<= (+ 2 j) M) (<= N i) (<= (+ (select A j) res2 (select A k) (select A (+ (- 1) N))) (+ (select A i) res1)))), 243016#(and (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= (+ 2 j) M) (<= (+ (select A j) res2 (select A k) (select A (+ (- 1) N))) (+ (select A i) res1 (select A (+ i 1))))) (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= (+ 2 j) M) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) res2 (select A k) (select A (+ (- 1) N))))) (or (<= (+ 3 k j) (+ N M)) (<= N (+ i 1)))), 242993#(and (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< j M) (<= res1 (+ (select A (+ k 1)) res2 (select A k)))) (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< j M) (< (+ (select A (+ k 1)) res2 (select A k)) (+ res1 1)))), 243017#(and (or (<= (+ 3 k j) (+ N M)) (<= N (+ 2 i))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ j 1) M) (<= (+ (select A j) (select A (+ k 1)) res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ j 1) M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A j) (select A (+ k 1)) res2 (select A k))))), 243002#(and (or (<= (+ (select A (+ k 1)) res2 (select A k)) (+ (select A i) res1 (select A (+ i 1)))) (<= N (+ i 1)) (<= (+ 3 k) N)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A (+ k 1)) res2 (select A k)))) (or (<= N (+ i 1)) (<= (+ 2 k) N))), 243010#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ res2 (select A k))))), 243007#(and (or (<= N (+ 2 i)) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2)) (or (<= N (+ 2 i)) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1)))), 242991#(and (or (<= (+ k 1) N) (< j M) (< res2 (+ res1 1))) (or (<= res1 res2) (<= (+ k 1) N) (< j M))), 243012#(and (or (<= N (+ 2 i)) (< j M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2) (< k N)) (or (<= N (+ 2 i)) (< j M) (< k N) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1)))), 242996#(and (or (<= (+ 2 k) N) (< j M) (<= (+ res2 (select A k)) res1)) (or (<= (+ 2 k) N) (< j M) (<= res1 (+ res2 (select A k))))), 243011#(and (or (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A (+ k 1)) res2 (select A k))) (<= (+ 3 k) N) (<= N (+ 2 i))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (+ (select A (+ k 1)) res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= (+ 2 k) N)))] [2022-03-15 21:55:20,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 21:55:20,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:55:20,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 21:55:20,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=3196, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 21:55:20,524 INFO L87 Difference]: Start difference. First operand 7517 states and 35755 transitions. Second operand has 46 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:38,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:38,290 INFO L93 Difference]: Finished difference Result 12983 states and 52045 transitions. [2022-03-15 21:56:38,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 573 states. [2022-03-15 21:56:38,291 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 0 states have call successors, (0), 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 21:56:38,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:38,324 INFO L225 Difference]: With dead ends: 12983 [2022-03-15 21:56:38,324 INFO L226 Difference]: Without dead ends: 12871 [2022-03-15 21:56:38,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 36 SyntacticMatches, 11 SemanticMatches, 607 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164517 ImplicationChecksByTransitivity, 75.3s TimeCoverageRelationStatistics Valid=50218, Invalid=320054, Unknown=0, NotChecked=0, Total=370272 [2022-03-15 21:56:38,338 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2005 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 4299 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 4299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:38,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2005 Valid, 0 Invalid, 4957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 4299 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 21:56:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12871 states. [2022-03-15 21:56:38,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12871 to 7788. [2022-03-15 21:56:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7788 states, 7787 states have (on average 4.732502889431103) internal successors, (36852), 7787 states have internal predecessors, (36852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7788 states to 7788 states and 36852 transitions. [2022-03-15 21:56:38,650 INFO L78 Accepts]: Start accepts. Automaton has 7788 states and 36852 transitions. Word has length 17 [2022-03-15 21:56:38,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:38,650 INFO L470 AbstractCegarLoop]: Abstraction has 7788 states and 36852 transitions. [2022-03-15 21:56:38,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 7788 states and 36852 transitions. [2022-03-15 21:56:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:56:38,664 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:38,664 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:56:38,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-03-15 21:56:38,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-03-15 21:56:38,864 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:56:38,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:38,865 INFO L85 PathProgramCache]: Analyzing trace with hash -478281977, now seen corresponding path program 12 times [2022-03-15 21:56:38,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:38,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604615212] [2022-03-15 21:56:38,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:38,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:39,038 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 21:56:39,038 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:39,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604615212] [2022-03-15 21:56:39,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604615212] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:56:39,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675036823] [2022-03-15 21:56:39,038 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:56:39,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:39,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:39,039 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:56:39,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 21:56:39,064 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:56:39,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:56:39,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 21:56:39,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:56:39,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:56:39,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:56:39,325 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:39,326 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 40 [2022-03-15 21:56:39,447 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 21:56:39,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:56:39,715 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:39,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:56:39,765 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:56:39,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 56 treesize of output 145 [2022-03-15 21:56:44,756 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 21:56:44,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675036823] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:56:44,756 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:56:44,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 21:56:44,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1417196619] [2022-03-15 21:56:44,756 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:44,757 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:44,762 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 163 transitions. [2022-03-15 21:56:44,762 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:48,071 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [272808#(and (or (not (< k N)) (not (< (+ j 1) M)) (<= (+ 2 k) N) (< (+ (select A j) (select A (+ j 1)) res2 (select A k)) (+ res1 1)) (< (+ 2 j) M)) (or (not (< k N)) (not (< (+ j 1) M)) (<= (+ 2 k) N) (< (+ 2 j) M) (<= res1 (+ (select A j) (select A (+ j 1)) res2 (select A k))))), 272799#(and (or (<= N (+ 2 i)) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2)) (or (<= N (+ 2 i)) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1)))), 272822#(and (or (<= N (+ i 1)) (<= (+ (select A j) res2 (select A k)) (+ (select A i) res1 (select A (+ i 1)))) (<= (+ 2 j) M) (<= (+ 2 k) N)) (or (<= N (+ i 1)) (<= (+ 2 j) M) (<= (+ 2 k) N) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) res2 (select A k))))), 272802#(and (or (<= N (+ i 1)) (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< j M) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 272811#(and (or (<= N i) (< j M) (< k N) (<= (+ (select A i) res1) res2)) (or (<= N i) (< j M) (< k N) (< res2 (+ (select A i) res1 1)))), 272814#(and (or (<= N (+ 2 i)) (< j M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2) (< k N)) (or (<= N (+ 2 i)) (< j M) (< k N) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1)))), 272800#(and (or (<= res1 res2) (< j M)) (or (< j M) (< res2 (+ res1 1)))), 272818#(and (or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M) (<= (+ res2 (select A k)) (+ (select A i) res1 (select A (+ i 1))))) (or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) (+ res2 (select A k))))), 272797#(and (or (<= N i) (< res2 (+ (select A i) res1 1))) (or (<= N i) (<= (+ (select A i) res1) res2))), 272816#(and (or (<= N (+ i 1)) (<= (+ 2 k) N) (<= (+ res2 (select A k)) (+ (select A i) res1 (select A (+ i 1))))) (or (<= N (+ i 1)) (<= (+ 2 k) N) (<= (+ (select A i) res1 (select A (+ i 1))) (+ res2 (select A k))))), 272819#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ res2 (select A k))))), 272810#(and (or (<= N (+ i 1)) (< k N) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1))) (or (<= N (+ i 1)) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) res2))), 272812#(and (or (<= N (+ i 1)) (< j M) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< j M) (< k N) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 272803#(and (or (<= N (+ 2 i)) (< j M) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1))) (or (<= N (+ 2 i)) (< j M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2))), 272823#(and (or (<= (+ (select A j) res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)))) (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ 2 k) N)) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ 2 k) N) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A j) res2 (select A k))))), 272805#(and (or (<= (+ k 1) N) (< j M) (< res2 (+ res1 1))) (or (<= res1 res2) (<= (+ k 1) N) (< j M))), 272817#(and (or (<= N i) (<= (+ 2 k) N) (< j M) (<= (+ res2 (select A k)) (+ (select A i) res1))) (or (<= N i) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) res1) (+ res2 (select A k))))), 272804#(and (or (not (< k N)) (<= (+ 2 k) N) (< (+ res2 (select A k)) (+ res1 1))) (or (not (< k N)) (<= (+ 2 k) N) (<= res1 (+ res2 (select A k))))), 272806#(and (or (not (< k N)) (<= (+ 2 k) N) (< j M) (<= res1 (+ res2 (select A k)))) (or (not (< k N)) (<= (+ 2 k) N) (< j M) (< (+ res2 (select A k)) (+ res1 1)))), 272826#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ 3 j) M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2 (select A k)))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ 3 j) M) (<= (+ (select A j) (select A (+ j 1)) res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)))))), 272801#(and (or (<= N i) (< j M) (<= (+ (select A i) res1) res2)) (or (<= N i) (< j M) (< res2 (+ (select A i) res1 1)))), 272807#(and (or (not (< k N)) (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)) (<= res1 (+ (select A j) res2 (select A k)))) (or (not (< k N)) (< (+ (select A j) res2 (select A k)) (+ res1 1)) (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)))), 272798#(and (or (<= N (+ i 1)) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 272820#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ res2 (select A k))))), 272821#(and (or (<= (+ (select A j) res2 (select A k)) (+ (select A i) res1)) (<= (+ 2 j) M) (<= N i) (<= (+ 2 k) N)) (or (<= (+ 2 j) M) (<= N i) (<= (+ 2 k) N) (<= (+ (select A i) res1) (+ (select A j) res2 (select A k))))), 272824#(and (or (<= (+ (select A i) res1) (+ (select A j) (select A (+ j 1)) res2 (select A k))) (<= N i) (<= (+ 2 k) N) (<= (+ 3 j) M)) (or (<= (+ (select A j) (select A (+ j 1)) res2 (select A k)) (+ (select A i) res1)) (<= N i) (<= (+ 2 k) N) (<= (+ 3 j) M))), 272815#(and (or (<= N i) (<= (+ 2 k) N) (<= (+ (select A i) res1) (+ res2 (select A k)))) (or (<= N i) (<= (+ 2 k) N) (<= (+ res2 (select A k)) (+ (select A i) res1)))), 272813#(and (or (<= N (+ 2 i)) (< k N) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1))) (or (<= N (+ 2 i)) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2) (< k N))), 272825#(and (or (<= N (+ i 1)) (<= (+ (select A j) (select A (+ j 1)) res2 (select A k)) (+ (select A i) res1 (select A (+ i 1)))) (<= (+ 2 k) N) (<= (+ 3 j) M)) (or (<= N (+ i 1)) (<= (+ 2 k) N) (<= (+ 3 j) M) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2 (select A k))))), 272809#(and (or (<= N i) (< k N) (<= (+ (select A i) res1) res2)) (or (<= N i) (< k N) (< res2 (+ (select A i) res1 1))))] [2022-03-15 21:56:48,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 21:56:48,071 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:48,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 21:56:48,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2780, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 21:56:48,072 INFO L87 Difference]: Start difference. First operand 7788 states and 36852 transitions. Second operand has 41 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:38,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:57:38,642 INFO L93 Difference]: Finished difference Result 12363 states and 50451 transitions. [2022-03-15 21:57:38,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 330 states. [2022-03-15 21:57:38,642 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 0 states have call successors, (0), 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 21:57:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:57:38,713 INFO L225 Difference]: With dead ends: 12363 [2022-03-15 21:57:38,713 INFO L226 Difference]: Without dead ends: 12249 [2022-03-15 21:57:38,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 40 SyntacticMatches, 10 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49497 ImplicationChecksByTransitivity, 49.0s TimeCoverageRelationStatistics Valid=15740, Invalid=113500, Unknown=0, NotChecked=0, Total=129240 [2022-03-15 21:57:38,717 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1429 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 4380 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1429 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 4380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:57:38,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1429 Valid, 0 Invalid, 4724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 4380 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 21:57:38,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12249 states. [2022-03-15 21:57:38,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12249 to 8143. [2022-03-15 21:57:38,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8143 states, 8142 states have (on average 4.7225497420781135) internal successors, (38451), 8142 states have internal predecessors, (38451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8143 states to 8143 states and 38451 transitions. [2022-03-15 21:57:38,936 INFO L78 Accepts]: Start accepts. Automaton has 8143 states and 38451 transitions. Word has length 17 [2022-03-15 21:57:38,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:57:38,936 INFO L470 AbstractCegarLoop]: Abstraction has 8143 states and 38451 transitions. [2022-03-15 21:57:38,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:38,936 INFO L276 IsEmpty]: Start isEmpty. Operand 8143 states and 38451 transitions. [2022-03-15 21:57:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:57:38,952 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:57:38,952 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:57:38,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 21:57:39,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:39,153 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:57:39,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:57:39,153 INFO L85 PathProgramCache]: Analyzing trace with hash 274150919, now seen corresponding path program 13 times [2022-03-15 21:57:39,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:57:39,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938416976] [2022-03-15 21:57:39,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:57:39,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:57:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:39,326 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 21:57:39,326 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:57:39,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938416976] [2022-03-15 21:57:39,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938416976] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:57:39,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967872031] [2022-03-15 21:57:39,326 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:57:39,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:39,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:57:39,327 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:57:39,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 21:57:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:39,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 21:57:39,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:57:39,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:57:39,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:57:39,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:57:39,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:57:39,678 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:57:39,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-03-15 21:57:39,758 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 21:57:39,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:57:40,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:57:40,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:57:40,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:57:40,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:57:40,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:57:40,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:57:40,146 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:57:40,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 56 treesize of output 109 [2022-03-15 21:57:40,520 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 21:57:40,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967872031] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:57:40,521 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:57:40,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2022-03-15 21:57:40,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [521664477] [2022-03-15 21:57:40,521 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:57:40,522 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:57:40,526 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 133 transitions. [2022-03-15 21:57:40,526 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:57:42,464 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [302207#(and (<= (+ (select A i) res1) res2) (< res2 (+ (select A i) res1 1))), 302211#(and (or (< j M) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1))) (or (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) res2))), 302214#(and (or (< (+ j 1) M) (< (+ (select A j) res2) (+ (select A i) res1 (select A (+ i 1)) 1)) (not (< j M))) (or (< (+ j 1) M) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) res2)) (not (< j M)))), 302217#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) res2 (select A k)))) (or (< (+ j 1) M) (<= M j) (< (+ (select A j) res2 (select A k)) (+ (select A i) res1 (select A (+ i 1)) 1)))), 302208#(and (<= (+ (select A i) res1 (select A (+ i 1))) res2) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1))), 302216#(and (or (< (+ j 1) M) (<= (+ (select A i) res1) (+ (select A j) res2 (select A k))) (not (< j M))) (or (< (+ j 1) M) (< (+ (select A j) res2 (select A k)) (+ (select A i) res1 1)) (<= M j))), 302219#(and (or (not (< (+ j 1) M)) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2 (select A k))) (< (+ 2 j) M)) (or (< (+ 2 j) M) (< (+ (select A j) (select A (+ j 1)) res2 (select A k)) (+ (select A i) res1 (select A (+ i 1)) 1)) (<= M (+ j 1)))), 302212#(and (or (< j M) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1))) (or (< j M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2))), 302215#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A j) res2))) (or (< (+ j 1) M) (not (< j M)) (< (+ (select A j) res2) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1)))), 302209#(and (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1))), 302213#(and (or (< (+ j 1) M) (< (+ (select A j) res2) (+ (select A i) res1 1)) (not (< j M))) (or (<= (+ (select A i) res1) (+ (select A j) res2)) (< (+ j 1) M) (not (< j M)))), 302218#(and (or (< (+ (select A j) (select A (+ j 1)) res2 (select A k)) (+ (select A i) res1 1)) (< (+ 2 j) M) (<= M (+ j 1))) (or (not (< (+ j 1) M)) (<= (+ (select A i) res1) (+ (select A j) (select A (+ j 1)) res2 (select A k))) (< (+ 2 j) M))), 302221#(and (or (not (< (+ j 1) M)) (< (+ (select A j) (select A (+ j 1)) res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1)) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (< (+ 2 j) M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2 (select A k))))), 302210#(and (or (< j M) (<= (+ (select A i) res1) res2)) (or (< j M) (< res2 (+ (select A i) res1 1)))), 302220#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A j) res2 (select A k)))) (or (< (+ j 1) M) (< (+ (select A j) res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1)) (not (< j M))))] [2022-03-15 21:57:42,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:57:42,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:57:42,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:57:42,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1436, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 21:57:42,465 INFO L87 Difference]: Start difference. First operand 8143 states and 38451 transitions. Second operand has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 24 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:48,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:57:48,126 INFO L93 Difference]: Finished difference Result 10914 states and 46368 transitions. [2022-03-15 21:57:48,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 21:57:48,126 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 24 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:57:48,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:57:48,156 INFO L225 Difference]: With dead ends: 10914 [2022-03-15 21:57:48,156 INFO L226 Difference]: Without dead ends: 10875 [2022-03-15 21:57:48,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 31 SyntacticMatches, 22 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1641 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=857, Invalid=5623, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 21:57:48,157 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 312 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 2314 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 2314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:57:48,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 0 Invalid, 2482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 2314 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 21:57:48,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10875 states. [2022-03-15 21:57:48,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10875 to 8329. [2022-03-15 21:57:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8329 states, 8328 states have (on average 4.727425552353506) internal successors, (39370), 8328 states have internal predecessors, (39370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:48,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8329 states to 8329 states and 39370 transitions. [2022-03-15 21:57:48,358 INFO L78 Accepts]: Start accepts. Automaton has 8329 states and 39370 transitions. Word has length 17 [2022-03-15 21:57:48,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:57:48,358 INFO L470 AbstractCegarLoop]: Abstraction has 8329 states and 39370 transitions. [2022-03-15 21:57:48,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 24 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:57:48,359 INFO L276 IsEmpty]: Start isEmpty. Operand 8329 states and 39370 transitions. [2022-03-15 21:57:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:57:48,372 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:57:48,372 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:57:48,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-03-15 21:57:48,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:48,573 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:57:48,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:57:48,573 INFO L85 PathProgramCache]: Analyzing trace with hash 222439189, now seen corresponding path program 14 times [2022-03-15 21:57:48,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:57:48,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461626689] [2022-03-15 21:57:48,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:57:48,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:57:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:48,764 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 21:57:48,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:57:48,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461626689] [2022-03-15 21:57:48,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461626689] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:57:48,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437272479] [2022-03-15 21:57:48,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:57:48,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:48,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:57:48,768 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:57:48,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 21:57:48,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:57:48,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:57:48,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 21:57:48,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:57:55,901 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:57:55,901 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 29 treesize of output 57 [2022-03-15 21:57:58,242 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 21:57:58,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:58:00,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:58:01,230 INFO L353 Elim1Store]: treesize reduction 24, result has 75.3 percent of original size [2022-03-15 21:58:01,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 56 treesize of output 93 [2022-03-15 21:58:02,206 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 21:58:02,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437272479] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:58:02,207 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:58:02,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 21:58:02,207 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [631171104] [2022-03-15 21:58:02,207 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:58:02,208 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:58:02,213 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 136 transitions. [2022-03-15 21:58:02,213 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:58:32,440 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [330031#(and (or (not (< (+ j 1) M)) (<= res1 (+ (select A j) (select A (+ j 1)) res2)) (<= (+ 3 j) M)) (or (not (< (+ j 1) M)) (<= (+ 3 j) M) (< (+ (select A j) (select A (+ j 1)) res2) (+ res1 1)))), 330026#(and (or (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ (select A j) res2) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)))) (< k N)) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A j) res2)) (< k N))), 330004#(and (or (<= N i) (< j M) (<= (+ (select A i) res1) res2)) (or (<= N i) (< j M) (< res2 (+ (select A i) res1 1)))), 330018#(and (or (<= (+ 2 j) M) (not (< j M)) (< k N) (< (+ (select A j) res2) (+ res1 1))) (or (<= (+ 2 j) M) (not (< j M)) (< k N) (<= res1 (+ (select A j) res2)))), 330028#(and (or (<= (+ (select A i) res1) (+ (select A j) (select A (+ j 1)) res2 (select A k))) (<= N i) (<= (+ 2 k) N) (<= (+ 3 j) M)) (or (<= (+ (select A j) (select A (+ j 1)) res2 (select A k)) (+ (select A i) res1)) (<= N i) (<= (+ 2 k) N) (<= (+ 3 j) M))), 330002#(and (or (<= N i) (< k N) (<= (+ (select A i) res1) res2)) (or (<= N i) (< k N) (< res2 (+ (select A i) res1 1)))), 330008#(and (or (<= N (+ i 1)) (< j M) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< j M) (< k N) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 330001#(and (or (<= res1 res2) (< k N)) (or (< k N) (< res2 (+ res1 1)))), 330021#(and (or (<= N i) (<= (+ 3 j) M) (< k N) (<= (+ (select A i) res1) (+ (select A j) (select A (+ j 1)) res2))) (or (<= N i) (<= (+ 3 j) M) (< k N) (<= (+ (select A j) (select A (+ j 1)) res2) (+ (select A i) res1)))), 330013#(and (or (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ (select A j) res2) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A j) res2)))), 330030#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ 3 j) M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2 (select A k)))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ 3 j) M) (<= (+ (select A j) (select A (+ j 1)) res2 (select A k)) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)))))), 330025#(and (or (<= N (+ 2 i)) (< j M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2) (< k N)) (or (<= N (+ 2 i)) (< j M) (< k N) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1)))), 330019#(and (or (<= (+ 2 j) M) (< k N) (<= res1 (+ (select A j) res2))) (or (<= (+ 2 j) M) (<= (+ (select A j) res2) res1) (< k N))), 330029#(and (or (<= N (+ i 1)) (<= (+ (select A j) (select A (+ j 1)) res2 (select A k)) (+ (select A i) res1 (select A (+ i 1)))) (<= (+ 2 k) N) (<= (+ 3 j) M)) (or (<= N (+ i 1)) (<= (+ 2 k) N) (<= (+ 3 j) M) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2 (select A k))))), 330011#(and (or (<= (+ 2 j) M) (<= N i) (<= (+ (select A j) res2) (+ (select A i) res1))) (or (<= (+ (select A i) res1) (+ (select A j) res2)) (<= (+ 2 j) M) (<= N i))), 330012#(and (or (<= N (+ i 1)) (<= (+ (select A j) res2) (+ (select A i) res1 (select A (+ i 1)))) (<= (+ 2 j) M)) (or (<= N (+ i 1)) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) res2)) (<= (+ 2 j) M))), 330022#(and (or (<= N (+ i 1)) (<= (+ (select A j) res2) (+ (select A i) res1 (select A (+ i 1)))) (<= (+ 2 j) M) (< k N)) (or (<= N (+ i 1)) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) res2)) (<= (+ 2 j) M) (< k N))), 329999#(and (or (<= N i) (< res2 (+ (select A i) res1 1))) (or (<= N i) (<= (+ (select A i) res1) res2))), 330024#(and (or (<= N (+ 2 i)) (< k N) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1))) (or (<= N (+ 2 i)) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2) (< k N))), 330032#(and (or (not (< (+ j 1) M)) (<= (+ 3 j) M) (< k N) (< (+ (select A j) (select A (+ j 1)) res2) (+ res1 1))) (or (not (< (+ j 1) M)) (<= res1 (+ (select A j) (select A (+ j 1)) res2)) (<= (+ 3 j) M) (< k N))), 330016#(and (or (<= N (+ i 1)) (<= (+ 3 j) M) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2))) (or (<= N (+ i 1)) (<= (+ (select A j) (select A (+ j 1)) res2) (+ (select A i) res1 (select A (+ i 1)))) (<= (+ 3 j) M))), 330005#(and (or (<= N (+ i 1)) (< j M) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< j M) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 330007#(and (or (<= N i) (< k N) (<= (+ j 1) M) (< res2 (+ (select A i) res1 1))) (or (<= N i) (< k N) (<= (+ j 1) M) (<= (+ (select A i) res1) res2))), 330023#(and (or (<= N (+ i 1)) (<= (+ (select A j) (select A (+ j 1)) res2) (+ (select A i) res1 (select A (+ i 1)))) (<= (+ 3 j) M) (< k N)) (or (<= N (+ i 1)) (<= (+ 3 j) M) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2)))), 330017#(and (or (<= N (+ 2 i)) (<= (+ 3 j) M) (<= (+ (select A j) (select A (+ j 1)) res2) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))))) (or (<= N (+ 2 i)) (<= (+ 3 j) M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2)))), 330020#(and (or (<= (+ 2 j) M) (<= N i) (<= (+ (select A j) res2) (+ (select A i) res1)) (< k N)) (or (<= (+ (select A i) res1) (+ (select A j) res2)) (<= (+ 2 j) M) (<= N i) (< k N))), 330014#(and (or (<= (+ 2 j) M) (not (< j M)) (< (+ (select A j) res2) (+ res1 1))) (or (<= (+ 2 j) M) (not (< j M)) (<= res1 (+ (select A j) res2)))), 330000#(and (or (<= N (+ i 1)) (<= (+ (select A i) res1 (select A (+ i 1))) res2)) (or (<= N (+ i 1)) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1)))), 330027#(and (or (<= N (+ 2 i)) (<= (+ 3 j) M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) (+ (select A j) (select A (+ j 1)) res2)) (< k N)) (or (<= N (+ 2 i)) (<= (+ 3 j) M) (< k N) (<= (+ (select A j) (select A (+ j 1)) res2) (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)))))), 330010#(and (or (<= N (+ 2 i)) (< j M) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1))) (or (<= N (+ 2 i)) (< j M) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2))), 330006#(and (or (< k N) (<= (+ j 1) M) (< res2 (+ res1 1))) (or (<= res1 res2) (< k N) (<= (+ j 1) M))), 330009#(and (or (<= N (+ 2 i)) (<= (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1))) res2)) (or (<= N (+ 2 i)) (< res2 (+ (select A i) (select A (+ 2 i)) res1 (select A (+ i 1)) 1)))), 330033#(and (or (not (< k N)) (not (< (+ j 1) M)) (<= (+ 3 j) M) (<= res1 (+ (select A j) (select A (+ j 1)) res2 (select A k))) (< (+ k 1) N)) (or (not (< k N)) (not (< (+ j 1) M)) (< (+ (select A j) (select A (+ j 1)) res2 (select A k)) (+ res1 1)) (<= (+ 3 j) M) (< (+ k 1) N))), 330003#(and (or (<= N (+ i 1)) (< k N) (< res2 (+ (select A i) res1 (select A (+ i 1)) 1))) (or (<= N (+ i 1)) (< k N) (<= (+ (select A i) res1 (select A (+ i 1))) res2))), 330015#(and (or (<= N i) (<= (+ 3 j) M) (<= (+ (select A i) res1) (+ (select A j) (select A (+ j 1)) res2))) (or (<= N i) (<= (+ 3 j) M) (<= (+ (select A j) (select A (+ j 1)) res2) (+ (select A i) res1))))] [2022-03-15 21:58:32,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 21:58:32,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:58:32,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 21:58:32,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=3537, Unknown=1, NotChecked=0, Total=3782 [2022-03-15 21:58:32,441 INFO L87 Difference]: Start difference. First operand 8329 states and 39370 transitions. Second operand has 46 states, 45 states have (on average 2.5555555555555554) internal successors, (115), 45 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 22:04:32,587 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:04:32,620 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:04:33,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2022-03-15 22:04:33,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19936 ImplicationChecksByTransitivity, 374.7s TimeCoverageRelationStatistics Valid=6775, Invalid=53004, Unknown=1, NotChecked=0, Total=59780 [2022-03-15 22:04:33,313 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 854 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 2836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:33,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [854 Valid, 0 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 2836 Invalid, 0 Unknown, 0 Unchecked, 16.5s Time] [2022-03-15 22:04:33,314 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:04:33,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 22:04:33,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 22:04:33,515 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (8329states) and FLOYD_HOARE automaton (currently 197 states, 46 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 245 known predicates. [2022-03-15 22:04:33,516 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:04:33,516 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:04:33,516 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:04:33,518 INFO L732 BasicCegarLoop]: Path program histogram: [14, 9, 8, 2, 2, 1, 1] [2022-03-15 22:04:33,520 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:04:33,520 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:04:33,521 INFO L202 PluginConnector]: Adding new model array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:04:33 BasicIcfg [2022-03-15 22:04:33,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:04:33,522 INFO L158 Benchmark]: Toolchain (without parser) took 788203.41ms. Allocated memory was 181.4MB in the beginning and 744.5MB in the end (delta: 563.1MB). Free memory was 138.9MB in the beginning and 494.4MB in the end (delta: -355.5MB). Peak memory consumption was 208.6MB. Max. memory is 8.0GB. [2022-03-15 22:04:33,522 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:04:33,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.46ms. Allocated memory is still 181.4MB. Free memory was 138.8MB in the beginning and 137.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 22:04:33,522 INFO L158 Benchmark]: Boogie Preprocessor took 17.80ms. Allocated memory is still 181.4MB. Free memory was 137.3MB in the beginning and 136.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:04:33,522 INFO L158 Benchmark]: RCFGBuilder took 251.62ms. Allocated memory is still 181.4MB. Free memory was 136.3MB in the beginning and 127.5MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-03-15 22:04:33,522 INFO L158 Benchmark]: TraceAbstraction took 787905.18ms. Allocated memory was 181.4MB in the beginning and 744.5MB in the end (delta: 563.1MB). Free memory was 127.0MB in the beginning and 494.4MB in the end (delta: -367.4MB). Peak memory consumption was 196.0MB. Max. memory is 8.0GB. [2022-03-15 22:04:33,523 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.46ms. Allocated memory is still 181.4MB. Free memory was 138.8MB in the beginning and 137.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.80ms. Allocated memory is still 181.4MB. Free memory was 137.3MB in the beginning and 136.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 251.62ms. Allocated memory is still 181.4MB. Free memory was 136.3MB in the beginning and 127.5MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 787905.18ms. Allocated memory was 181.4MB in the beginning and 744.5MB in the end (delta: 563.1MB). Free memory was 127.0MB in the beginning and 494.4MB in the end (delta: -367.4MB). Peak memory consumption was 196.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 39 PlacesBefore, 25 PlacesAfterwards, 32 TransitionsBefore, 18 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 178 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 174, positive: 172, positive conditional: 0, positive unconditional: 172, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 111, positive: 110, positive conditional: 0, positive unconditional: 110, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 174, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 111, unknown conditional: 0, unknown unconditional: 111] , 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: 59]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (8329states) and FLOYD_HOARE automaton (currently 197 states, 46 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 245 known predicates. - TimeoutResultAtElement [Line: 53]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (8329states) and FLOYD_HOARE automaton (currently 197 states, 46 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 245 known predicates. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (8329states) and FLOYD_HOARE automaton (currently 197 states, 46 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 245 known predicates. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (8329states) and FLOYD_HOARE automaton (currently 197 states, 46 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 245 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 48 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 787.8s, OverallIterations: 37, TraceHistogramMax: 4, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.2s, AutomataDifference: 675.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13521 SdHoareTripleChecker+Valid, 42.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13521 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 38.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12699 mSDsCounter, 5206 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46043 IncrementalHoareTripleChecker+Invalid, 51249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5206 mSolverCounterUnsat, 0 mSDtfsCounter, 46043 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6190 GetRequests, 1527 SyntacticMatches, 167 SemanticMatches, 4495 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515096 ImplicationChecksByTransitivity, 674.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8329occurred in iteration=36, InterpolantAutomatonStates: 3614, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 36 MinimizatonAttempts, 59766 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 31.1s InterpolantComputationTime, 1057 NumberOfCodeBlocks, 1057 NumberOfCodeBlocksAsserted, 104 NumberOfCheckSat, 1458 ConstructedInterpolants, 27 QuantifiedInterpolants, 15290 SizeOfPredicates, 112 NumberOfNonLiveVariables, 2091 ConjunctsInSsa, 471 ConjunctsInUnsatCore, 103 InterpolantComputations, 5 PerfectInterpolantSequences, 213/679 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