/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/simple-queue.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:40:26,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:40:26,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:40:26,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:40:26,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:40:26,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:40:26,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:40:26,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:40:26,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:40:26,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:40:26,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:40:26,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:40:26,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:40:26,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:40:26,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:40:26,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:40:26,865 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:40:26,865 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:40:26,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:40:26,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:40:26,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:40:26,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:40:26,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:40:26,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:40:26,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:40:26,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:40:26,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:40:26,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:40:26,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:40:26,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:40:26,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:40:26,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:40:26,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:40:26,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:40:26,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:40:26,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:40:26,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:40:26,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:40:26,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:40:26,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:40:26,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:40:26,896 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:40:26,925 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:40:26,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:40:26,926 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:40:26,926 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:40:26,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:40:26,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:40:26,929 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:40:26,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:40:26,929 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:40:26,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:40:26,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:40:26,931 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:40:26,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:40:26,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:40:26,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:40:26,931 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:40:26,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:40:26,931 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:40:26,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:40:26,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:40:26,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:40:26,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:40:26,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:40:26,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:40:26,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:40:26,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:40:26,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:40:26,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:40:26,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:40:26,933 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:40:26,933 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:40:26,933 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:40:26,933 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:40:27,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:40:27,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:40:27,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:40:27,178 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:40:27,178 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:40:27,179 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-queue.wvr.bpl [2022-03-15 21:40:27,180 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-queue.wvr.bpl' [2022-03-15 21:40:27,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:40:27,202 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:40:27,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:40:27,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:40:27,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:40:27,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:40:27" (1/1) ... [2022-03-15 21:40:27,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:40:27" (1/1) ... [2022-03-15 21:40:27,230 INFO L137 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:40:27,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:40:27,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:40:27,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:40:27,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:40:27,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:40:27" (1/1) ... [2022-03-15 21:40:27,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:40:27" (1/1) ... [2022-03-15 21:40:27,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:40:27" (1/1) ... [2022-03-15 21:40:27,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:40:27" (1/1) ... [2022-03-15 21:40:27,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:40:27" (1/1) ... [2022-03-15 21:40:27,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:40:27" (1/1) ... [2022-03-15 21:40:27,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:40:27" (1/1) ... [2022-03-15 21:40:27,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:40:27,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:40:27,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:40:27,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:40:27,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:40:27" (1/1) ... [2022-03-15 21:40:27,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:40:27,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:27,287 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:40:27,305 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:40:27,317 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:40:27,317 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:40:27,317 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:40:27,318 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:40:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:40:27,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:40:27,318 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:40:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:40:27,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:40:27,318 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:40:27,352 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:40:27,354 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:40:27,439 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:40:27,469 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:40:27,470 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 21:40:27,470 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread1EXIT is neither atomic block end nor error location. [2022-03-15 21:40:27,471 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread2EXIT is neither atomic block end nor error location. [2022-03-15 21:40:27,473 INFO L202 PluginConnector]: Adding new model simple-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:40:27 BoogieIcfgContainer [2022-03-15 21:40:27,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:40:27,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:40:27,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:40:27,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:40:27,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:40:27" (1/2) ... [2022-03-15 21:40:27,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59001e12 and model type simple-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:40:27, skipping insertion in model container [2022-03-15 21:40:27,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:40:27" (2/2) ... [2022-03-15 21:40:27,484 INFO L111 eAbstractionObserver]: Analyzing ICFG simple-queue.wvr.bpl [2022-03-15 21:40:27,491 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:40:27,492 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:40:27,492 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:40:27,492 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:40:27,538 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 21:40:27,587 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:40:27,596 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:40:27,596 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 21:40:27,607 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:40:27,616 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 15 transitions, 46 flow [2022-03-15 21:40:27,619 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 15 transitions, 46 flow [2022-03-15 21:40:27,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 20 places, 15 transitions, 46 flow [2022-03-15 21:40:27,641 INFO L129 PetriNetUnfolder]: 2/13 cut-off events. [2022-03-15 21:40:27,641 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 21:40:27,642 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22 conditions, 13 events. 2/13 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 5 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 8. Up to 2 conditions per place. [2022-03-15 21:40:27,643 INFO L116 LiptonReduction]: Number of co-enabled transitions 16 [2022-03-15 21:40:27,685 INFO L131 LiptonReduction]: Checked pairs total: 18 [2022-03-15 21:40:27,699 INFO L133 LiptonReduction]: Total number of compositions: 3 [2022-03-15 21:40:27,708 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 13 transitions, 42 flow [2022-03-15 21:40:27,728 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-03-15 21:40:27,733 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:27,734 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:27,734 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:27,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:27,738 INFO L85 PathProgramCache]: Analyzing trace with hash -548212894, now seen corresponding path program 1 times [2022-03-15 21:40:27,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:27,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413294851] [2022-03-15 21:40:27,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:27,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:27,889 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:40:27,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:27,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413294851] [2022-03-15 21:40:27,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413294851] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:40:27,891 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:40:27,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 21:40:27,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [269648840] [2022-03-15 21:40:27,893 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:27,895 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:27,904 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 14 transitions. [2022-03-15 21:40:27,904 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:27,927 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:40:27,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:40:27,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:27,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:40:27,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:40:27,983 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have 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:40:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:28,013 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2022-03-15 21:40:28,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:40:28,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-03-15 21:40:28,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:28,021 INFO L225 Difference]: With dead ends: 19 [2022-03-15 21:40:28,021 INFO L226 Difference]: Without dead ends: 15 [2022-03-15 21:40:28,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:40:28,025 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:28,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 5 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:40:28,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-03-15 21:40:28,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-03-15 21:40:28,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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:40:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 26 transitions. [2022-03-15 21:40:28,049 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 26 transitions. Word has length 8 [2022-03-15 21:40:28,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:28,050 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 26 transitions. [2022-03-15 21:40:28,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have 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:40:28,050 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 26 transitions. [2022-03-15 21:40:28,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 21:40:28,055 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:28,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:28,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:40:28,056 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:28,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:28,056 INFO L85 PathProgramCache]: Analyzing trace with hash 186013271, now seen corresponding path program 1 times [2022-03-15 21:40:28,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:28,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190281679] [2022-03-15 21:40:28,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:28,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:28,117 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:40:28,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:28,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190281679] [2022-03-15 21:40:28,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190281679] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:40:28,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:40:28,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 21:40:28,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [982103710] [2022-03-15 21:40:28,118 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:28,119 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:28,121 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2022-03-15 21:40:28,121 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:28,187 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [102#(<= back front)] [2022-03-15 21:40:28,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:40:28,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:28,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:40:28,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:40:28,189 INFO L87 Difference]: Start difference. First operand 15 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have 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:40:28,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:28,212 INFO L93 Difference]: Finished difference Result 20 states and 33 transitions. [2022-03-15 21:40:28,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:40:28,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 9 [2022-03-15 21:40:28,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:28,213 INFO L225 Difference]: With dead ends: 20 [2022-03-15 21:40:28,214 INFO L226 Difference]: Without dead ends: 17 [2022-03-15 21:40:28,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:40:28,215 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:28,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 7 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:40:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-03-15 21:40:28,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-03-15 21:40:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:40:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2022-03-15 21:40:28,220 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 29 transitions. Word has length 9 [2022-03-15 21:40:28,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:28,220 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 29 transitions. [2022-03-15 21:40:28,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have 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:40:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 29 transitions. [2022-03-15 21:40:28,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 21:40:28,221 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:28,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:28,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 21:40:28,221 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:28,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:28,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1411956374, now seen corresponding path program 1 times [2022-03-15 21:40:28,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:28,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374542288] [2022-03-15 21:40:28,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:28,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:28,261 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:40:28,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:28,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374542288] [2022-03-15 21:40:28,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374542288] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:28,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977861905] [2022-03-15 21:40:28,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:28,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:28,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:28,264 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:40:28,310 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:40:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:28,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:40:28,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:28,376 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 11 treesize of output 7 [2022-03-15 21:40:28,392 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:40:28,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:28,425 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:40:28,426 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 12 treesize of output 11 [2022-03-15 21:40:28,434 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:40:28,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977861905] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:28,435 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:28,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-03-15 21:40:28,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [438866542] [2022-03-15 21:40:28,435 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:28,436 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:28,439 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2022-03-15 21:40:28,439 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:28,499 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [216#(or (= (select queue front) 5) (<= back front)), 217#(or (= (select queue front) 5) (not (= 5 (select queue back))))] [2022-03-15 21:40:28,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 21:40:28,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:28,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 21:40:28,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:40:28,501 INFO L87 Difference]: Start difference. First operand 17 states and 29 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:28,544 INFO L93 Difference]: Finished difference Result 24 states and 42 transitions. [2022-03-15 21:40:28,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 21:40:28,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 21:40:28,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:28,545 INFO L225 Difference]: With dead ends: 24 [2022-03-15 21:40:28,545 INFO L226 Difference]: Without dead ends: 20 [2022-03-15 21:40:28,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:40:28,546 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:28,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 13 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:40:28,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-03-15 21:40:28,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-03-15 21:40:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 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:40:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2022-03-15 21:40:28,551 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 35 transitions. Word has length 10 [2022-03-15 21:40:28,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:28,551 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 35 transitions. [2022-03-15 21:40:28,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 35 transitions. [2022-03-15 21:40:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 21:40:28,552 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:28,552 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:28,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 21:40:28,759 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:40:28,760 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:28,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:28,761 INFO L85 PathProgramCache]: Analyzing trace with hash 821718435, now seen corresponding path program 2 times [2022-03-15 21:40:28,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:28,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301866544] [2022-03-15 21:40:28,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:28,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:28,798 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:40:28,799 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:28,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301866544] [2022-03-15 21:40:28,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301866544] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:28,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699969987] [2022-03-15 21:40:28,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:40:28,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:28,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:28,804 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:40:28,805 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:40:28,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:40:28,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:28,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:40:28,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:28,874 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:40:28,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:28,921 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:40:28,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699969987] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:28,922 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:28,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2022-03-15 21:40:28,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [684155185] [2022-03-15 21:40:28,922 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:28,924 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:28,931 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 27 transitions. [2022-03-15 21:40:28,931 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:28,965 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 6 treesize of output 4 [2022-03-15 21:40:28,980 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:40:28,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 21:40:28,981 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:28,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 21:40:28,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:40:28,981 INFO L87 Difference]: Start difference. First operand 20 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:29,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:29,005 INFO L93 Difference]: Finished difference Result 47 states and 79 transitions. [2022-03-15 21:40:29,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:40:29,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 21:40:29,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:29,007 INFO L225 Difference]: With dead ends: 47 [2022-03-15 21:40:29,007 INFO L226 Difference]: Without dead ends: 42 [2022-03-15 21:40:29,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:40:29,008 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:29,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 11 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:40:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-03-15 21:40:29,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2022-03-15 21:40:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 31 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:40:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 61 transitions. [2022-03-15 21:40:29,015 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 61 transitions. Word has length 11 [2022-03-15 21:40:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:29,015 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 61 transitions. [2022-03-15 21:40:29,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:29,015 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 61 transitions. [2022-03-15 21:40:29,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 21:40:29,016 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:29,016 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:29,037 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:40:29,231 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:40:29,232 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:29,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:29,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2132001314, now seen corresponding path program 3 times [2022-03-15 21:40:29,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:29,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556702659] [2022-03-15 21:40:29,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:29,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:29,298 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:40:29,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:29,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556702659] [2022-03-15 21:40:29,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556702659] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:29,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36100188] [2022-03-15 21:40:29,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:40:29,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:29,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:29,300 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:40:29,313 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:40:29,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 21:40:29,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:29,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 21:40:29,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:29,410 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 11 treesize of output 7 [2022-03-15 21:40:29,419 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:40:29,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:29,452 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:40:29,452 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 14 treesize of output 13 [2022-03-15 21:40:29,474 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:40:29,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36100188] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:29,474 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:29,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-03-15 21:40:29,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2034395163] [2022-03-15 21:40:29,475 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:29,476 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:29,477 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 30 transitions. [2022-03-15 21:40:29,477 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:29,599 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [536#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 537#(or (not (= 5 (select queue back))) (= 5 (select queue (+ front 1)))), 538#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue back))) (= 5 (select queue (+ front 1)))), 535#(or (= (select queue front) 5) (<= back front))] [2022-03-15 21:40:29,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 21:40:29,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:29,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 21:40:29,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:40:29,600 INFO L87 Difference]: Start difference. First operand 32 states and 61 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have 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:40:29,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:29,704 INFO L93 Difference]: Finished difference Result 64 states and 114 transitions. [2022-03-15 21:40:29,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:40:29,704 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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:40:29,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:29,705 INFO L225 Difference]: With dead ends: 64 [2022-03-15 21:40:29,705 INFO L226 Difference]: Without dead ends: 38 [2022-03-15 21:40:29,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:40:29,706 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 74 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:29,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 34 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:40:29,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-03-15 21:40:29,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 25. [2022-03-15 21:40:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.875) internal successors, (45), 24 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:40:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 45 transitions. [2022-03-15 21:40:29,710 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 45 transitions. Word has length 12 [2022-03-15 21:40:29,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:29,710 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 45 transitions. [2022-03-15 21:40:29,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have 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:40:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 45 transitions. [2022-03-15 21:40:29,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:40:29,711 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:29,711 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:29,736 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:40:29,929 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:40:29,930 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:29,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1668275095, now seen corresponding path program 4 times [2022-03-15 21:40:29,931 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:29,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280884393] [2022-03-15 21:40:29,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:29,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:29,972 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:40:29,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:29,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280884393] [2022-03-15 21:40:29,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280884393] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:29,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206001331] [2022-03-15 21:40:29,973 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:40:29,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:29,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:29,975 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:40:29,982 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:40:30,006 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:40:30,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:30,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:40:30,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:30,051 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:40:30,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:30,092 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:40:30,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206001331] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:30,093 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:30,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-03-15 21:40:30,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1549451056] [2022-03-15 21:40:30,093 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:30,094 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:30,096 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 35 transitions. [2022-03-15 21:40:30,096 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:30,128 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 6 treesize of output 4 [2022-03-15 21:40:30,156 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 6 treesize of output 4 [2022-03-15 21:40:30,159 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:40:30,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:40:30,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:30,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:40:30,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:40:30,160 INFO L87 Difference]: Start difference. First operand 25 states and 45 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have 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:40:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:30,188 INFO L93 Difference]: Finished difference Result 69 states and 121 transitions. [2022-03-15 21:40:30,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 21:40:30,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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:40:30,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:30,189 INFO L225 Difference]: With dead ends: 69 [2022-03-15 21:40:30,189 INFO L226 Difference]: Without dead ends: 62 [2022-03-15 21:40:30,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:40:30,190 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:30,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 15 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:40:30,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-03-15 21:40:30,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2022-03-15 21:40:30,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 2.0434782608695654) internal successors, (94), 46 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:40:30,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 94 transitions. [2022-03-15 21:40:30,196 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 94 transitions. Word has length 13 [2022-03-15 21:40:30,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:30,196 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 94 transitions. [2022-03-15 21:40:30,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have 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:40:30,196 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 94 transitions. [2022-03-15 21:40:30,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:40:30,197 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:30,197 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:30,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 21:40:30,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:30,412 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:30,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:30,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1870263210, now seen corresponding path program 5 times [2022-03-15 21:40:30,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:30,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067944084] [2022-03-15 21:40:30,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:30,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:30,485 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:40:30,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:30,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067944084] [2022-03-15 21:40:30,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067944084] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:30,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990883149] [2022-03-15 21:40:30,486 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:40:30,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:30,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:30,487 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:40:30,497 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:40:30,518 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:40:30,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:30,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 21:40:30,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:30,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:40:30,694 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 7 [2022-03-15 21:40:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:30,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:30,834 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:40:30,834 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 12 treesize of output 11 [2022-03-15 21:40:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:30,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990883149] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:30,846 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:30,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-03-15 21:40:30,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2110347119] [2022-03-15 21:40:30,847 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:30,848 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:30,850 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 38 transitions. [2022-03-15 21:40:30,850 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:31,053 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [971#(or (not (< front back)) (= (select queue front) 5)), 999#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ 2 front))) (not (= 5 (select queue back)))), 998#(or (= 5 (select queue (+ 2 front))) (not (= 5 (select queue back)))), 1002#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 1001#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 1000#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 2 front))) (not (= 5 (select queue back))))] [2022-03-15 21:40:31,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 21:40:31,053 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:31,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 21:40:31,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:40:31,054 INFO L87 Difference]: Start difference. First operand 47 states and 94 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:40:31,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:31,241 INFO L93 Difference]: Finished difference Result 96 states and 176 transitions. [2022-03-15 21:40:31,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 21:40:31,242 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 14 [2022-03-15 21:40:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:31,243 INFO L225 Difference]: With dead ends: 96 [2022-03-15 21:40:31,243 INFO L226 Difference]: Without dead ends: 56 [2022-03-15 21:40:31,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=625, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:40:31,244 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 80 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:31,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 65 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:40:31,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-03-15 21:40:31,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2022-03-15 21:40:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:40:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 55 transitions. [2022-03-15 21:40:31,248 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 55 transitions. Word has length 14 [2022-03-15 21:40:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:31,248 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 55 transitions. [2022-03-15 21:40:31,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:40:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 55 transitions. [2022-03-15 21:40:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:40:31,249 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:31,249 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:31,270 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:40:31,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:31,464 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:31,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:31,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2142840861, now seen corresponding path program 6 times [2022-03-15 21:40:31,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:31,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841963561] [2022-03-15 21:40:31,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:31,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:31,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:31,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841963561] [2022-03-15 21:40:31,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841963561] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:31,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697488893] [2022-03-15 21:40:31,508 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:40:31,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:31,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:31,509 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:40:31,523 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:40:31,540 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:40:31,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:31,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:40:31,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:31,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:31,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697488893] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:31,610 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:31,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-03-15 21:40:31,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [505243238] [2022-03-15 21:40:31,610 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:31,611 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:31,614 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 43 transitions. [2022-03-15 21:40:31,614 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:31,656 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 6 treesize of output 4 [2022-03-15 21:40:31,666 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 6 treesize of output 4 [2022-03-15 21:40:31,674 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 6 treesize of output 4 [2022-03-15 21:40:31,691 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:40:31,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 21:40:31,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:31,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 21:40:31,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:40:31,692 INFO L87 Difference]: Start difference. First operand 30 states and 55 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) 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:40:31,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:31,728 INFO L93 Difference]: Finished difference Result 94 states and 169 transitions. [2022-03-15 21:40:31,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:40:31,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) 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 15 [2022-03-15 21:40:31,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:31,729 INFO L225 Difference]: With dead ends: 94 [2022-03-15 21:40:31,729 INFO L226 Difference]: Without dead ends: 85 [2022-03-15 21:40:31,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:40:31,730 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:31,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:40:31,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-03-15 21:40:31,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2022-03-15 21:40:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 2.078125) internal successors, (133), 64 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have 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:40:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 133 transitions. [2022-03-15 21:40:31,736 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 133 transitions. Word has length 15 [2022-03-15 21:40:31,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:31,736 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 133 transitions. [2022-03-15 21:40:31,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) 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:40:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 133 transitions. [2022-03-15 21:40:31,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:40:31,737 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:31,737 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:31,771 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:40:31,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:31,948 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:31,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:31,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1064053534, now seen corresponding path program 7 times [2022-03-15 21:40:31,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:31,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669859609] [2022-03-15 21:40:31,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:31,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:32,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:32,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669859609] [2022-03-15 21:40:32,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669859609] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:32,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470507359] [2022-03-15 21:40:32,043 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:40:32,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:32,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:32,044 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:40:32,073 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:40:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:32,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:40:32,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:32,142 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 11 treesize of output 7 [2022-03-15 21:40:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:32,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:32,175 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:40:32,175 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 14 treesize of output 13 [2022-03-15 21:40:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:32,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470507359] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:32,203 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:32,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2022-03-15 21:40:32,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1031088110] [2022-03-15 21:40:32,204 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:32,205 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:32,207 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 46 transitions. [2022-03-15 21:40:32,207 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:32,464 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [1590#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 1593#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 3 front))) (not (= 5 (select queue back)))), 1589#(or (= (select queue front) 5) (<= back front)), 1587#(or (= 5 (select queue (+ 3 front))) (not (= 5 (select queue back)))), 1594#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 1592#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 3 front))) (not (= 5 (select queue back)))), 1591#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 1588#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ 3 front))) (not (= 5 (select queue back))))] [2022-03-15 21:40:32,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:40:32,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:32,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:40:32,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-03-15 21:40:32,466 INFO L87 Difference]: Start difference. First operand 65 states and 133 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:40:32,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:32,707 INFO L93 Difference]: Finished difference Result 134 states and 250 transitions. [2022-03-15 21:40:32,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 21:40:32,707 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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:40:32,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:32,708 INFO L225 Difference]: With dead ends: 134 [2022-03-15 21:40:32,708 INFO L226 Difference]: Without dead ends: 78 [2022-03-15 21:40:32,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:40:32,709 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 142 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:32,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 102 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:40:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-03-15 21:40:32,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 35. [2022-03-15 21:40:32,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:40:32,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 65 transitions. [2022-03-15 21:40:32,713 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 65 transitions. Word has length 16 [2022-03-15 21:40:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:32,713 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 65 transitions. [2022-03-15 21:40:32,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:40:32,714 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 65 transitions. [2022-03-15 21:40:32,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:40:32,714 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:32,714 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:32,742 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:40:32,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:32,923 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:32,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:32,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1374822615, now seen corresponding path program 8 times [2022-03-15 21:40:32,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:32,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561752982] [2022-03-15 21:40:32,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:32,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:32,985 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:32,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561752982] [2022-03-15 21:40:32,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561752982] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:32,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380397006] [2022-03-15 21:40:32,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:40:32,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:32,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:32,987 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:40:33,000 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:40:33,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:40:33,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:33,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:40:33,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:33,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:33,105 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:33,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380397006] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:33,105 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:33,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-03-15 21:40:33,106 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [825084069] [2022-03-15 21:40:33,106 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:33,107 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:33,111 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 51 transitions. [2022-03-15 21:40:33,111 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:33,164 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 6 treesize of output 4 [2022-03-15 21:40:33,178 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 6 treesize of output 4 [2022-03-15 21:40:33,189 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 6 treesize of output 4 [2022-03-15 21:40:33,197 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 6 treesize of output 4 [2022-03-15 21:40:33,201 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:40:33,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:40:33,201 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:33,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:40:33,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:40:33,202 INFO L87 Difference]: Start difference. First operand 35 states and 65 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:40:33,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:33,241 INFO L93 Difference]: Finished difference Result 122 states and 223 transitions. [2022-03-15 21:40:33,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:40:33,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 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:40:33,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:33,243 INFO L225 Difference]: With dead ends: 122 [2022-03-15 21:40:33,243 INFO L226 Difference]: Without dead ends: 111 [2022-03-15 21:40:33,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:40:33,243 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:33,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 24 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:40:33,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-03-15 21:40:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2022-03-15 21:40:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 2.0941176470588236) internal successors, (178), 85 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have 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:40:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 178 transitions. [2022-03-15 21:40:33,249 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 178 transitions. Word has length 17 [2022-03-15 21:40:33,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:33,249 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 178 transitions. [2022-03-15 21:40:33,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:40:33,249 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 178 transitions. [2022-03-15 21:40:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:40:33,250 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:33,250 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:33,273 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:40:33,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 21:40:33,474 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:33,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:33,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1292641770, now seen corresponding path program 9 times [2022-03-15 21:40:33,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:33,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729242451] [2022-03-15 21:40:33,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:33,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:33,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:33,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729242451] [2022-03-15 21:40:33,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729242451] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:33,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848834693] [2022-03-15 21:40:33,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:40:33,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:33,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:33,619 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:40:33,651 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:40:33,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:40:33,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:33,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:40:33,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:33,721 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 11 treesize of output 7 [2022-03-15 21:40:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:33,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:33,755 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:40:33,755 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 14 treesize of output 13 [2022-03-15 21:40:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:33,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848834693] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:33,783 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:33,783 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2022-03-15 21:40:33,783 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1972928432] [2022-03-15 21:40:33,783 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:33,784 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:33,788 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 54 transitions. [2022-03-15 21:40:33,788 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:34,139 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [2332#(or (= (select queue front) 5) (<= back front)), 2336#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ front 4)) 5) (not (= 5 (select queue back)))), 2328#(or (= (select queue (+ front 4)) 5) (not (= 5 (select queue back)))), 2331#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ front 4)) 5) (not (= 5 (select queue back)))), 2334#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 2337#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 2330#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ front 4)) 5) (not (= 5 (select queue back)))), 2335#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 2329#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 4)) 5) (not (= 5 (select queue back)))), 2333#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1))))] [2022-03-15 21:40:34,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:40:34,139 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:34,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:40:34,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:40:34,140 INFO L87 Difference]: Start difference. First operand 86 states and 178 transitions. Second operand has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:34,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:34,480 INFO L93 Difference]: Finished difference Result 178 states and 336 transitions. [2022-03-15 21:40:34,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 21:40:34,480 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:40:34,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:34,481 INFO L225 Difference]: With dead ends: 178 [2022-03-15 21:40:34,481 INFO L226 Difference]: Without dead ends: 104 [2022-03-15 21:40:34,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:40:34,482 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 191 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:34,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 137 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:40:34,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-03-15 21:40:34,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 40. [2022-03-15 21:40:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 39 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 75 transitions. [2022-03-15 21:40:34,496 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 75 transitions. Word has length 18 [2022-03-15 21:40:34,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:34,498 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 75 transitions. [2022-03-15 21:40:34,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 75 transitions. [2022-03-15 21:40:34,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:40:34,501 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:34,501 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:34,519 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:40:34,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:34,702 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:34,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:34,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1416445405, now seen corresponding path program 10 times [2022-03-15 21:40:34,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:34,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625873968] [2022-03-15 21:40:34,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:34,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:34,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:34,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625873968] [2022-03-15 21:40:34,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625873968] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:34,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352252505] [2022-03-15 21:40:34,774 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:40:34,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:34,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:34,775 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:40:34,780 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:40:34,803 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:40:34,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:34,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 21:40:34,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:34,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:34,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352252505] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:34,905 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:34,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-03-15 21:40:34,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1486782369] [2022-03-15 21:40:34,906 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:34,907 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:34,911 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 59 transitions. [2022-03-15 21:40:34,911 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:34,975 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 6 treesize of output 4 [2022-03-15 21:40:34,984 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 6 treesize of output 4 [2022-03-15 21:40:34,993 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 6 treesize of output 4 [2022-03-15 21:40:35,003 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 6 treesize of output 4 [2022-03-15 21:40:35,023 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 6 treesize of output 4 [2022-03-15 21:40:35,026 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:40:35,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:40:35,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:35,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:40:35,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:40:35,027 INFO L87 Difference]: Start difference. First operand 40 states and 75 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:40:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:35,071 INFO L93 Difference]: Finished difference Result 153 states and 283 transitions. [2022-03-15 21:40:35,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:40:35,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 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 19 [2022-03-15 21:40:35,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:35,072 INFO L225 Difference]: With dead ends: 153 [2022-03-15 21:40:35,073 INFO L226 Difference]: Without dead ends: 140 [2022-03-15 21:40:35,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:40:35,073 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:35,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 32 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:40:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-03-15 21:40:35,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 110. [2022-03-15 21:40:35,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.1009174311926606) internal successors, (229), 109 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:40:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 229 transitions. [2022-03-15 21:40:35,078 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 229 transitions. Word has length 19 [2022-03-15 21:40:35,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:35,078 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 229 transitions. [2022-03-15 21:40:35,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:40:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 229 transitions. [2022-03-15 21:40:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:40:35,079 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:35,079 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:35,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 21:40:35,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 21:40:35,280 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:35,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:35,280 INFO L85 PathProgramCache]: Analyzing trace with hash -754243678, now seen corresponding path program 11 times [2022-03-15 21:40:35,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:35,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081936011] [2022-03-15 21:40:35,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:35,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:35,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:35,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081936011] [2022-03-15 21:40:35,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081936011] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:35,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302361217] [2022-03-15 21:40:35,430 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:40:35,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:35,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:35,432 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:40:35,434 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:40:35,462 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:40:35,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:35,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 21:40:35,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:35,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:40:35,789 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 7 [2022-03-15 21:40:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:35,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:36,059 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:40:36,063 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 12 treesize of output 11 [2022-03-15 21:40:36,078 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:36,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302361217] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:36,078 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:36,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2022-03-15 21:40:36,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1273098382] [2022-03-15 21:40:36,079 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:36,080 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:36,084 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 62 transitions. [2022-03-15 21:40:36,084 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:36,590 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [3260#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 3258#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ 5 front)) 5) (not (= 5 (select queue back)))), 3205#(or (not (< front back)) (= (select queue front) 5)), 3255#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 5 front)) 5) (not (= 5 (select queue back)))), 3263#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 3256#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 5 front)) 5) (not (= 5 (select queue back)))), 3254#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ 5 front)) 5) (not (= 5 (select queue back)))), 3253#(or (= (select queue (+ 5 front)) 5) (not (= 5 (select queue back)))), 3259#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 3262#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 3261#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 3257#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ 5 front)) 5) (not (= 5 (select queue back))))] [2022-03-15 21:40:36,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:40:36,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:36,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:40:36,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1545, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 21:40:36,591 INFO L87 Difference]: Start difference. First operand 110 states and 229 transitions. Second operand has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 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:40:37,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:37,087 INFO L93 Difference]: Finished difference Result 228 states and 434 transitions. [2022-03-15 21:40:37,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:40:37,088 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 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 20 [2022-03-15 21:40:37,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:37,089 INFO L225 Difference]: With dead ends: 228 [2022-03-15 21:40:37,089 INFO L226 Difference]: Without dead ends: 134 [2022-03-15 21:40:37,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=610, Invalid=2470, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 21:40:37,090 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 284 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:37,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 180 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:40:37,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-03-15 21:40:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 45. [2022-03-15 21:40:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 44 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have 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:40:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 85 transitions. [2022-03-15 21:40:37,093 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 85 transitions. Word has length 20 [2022-03-15 21:40:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:37,093 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 85 transitions. [2022-03-15 21:40:37,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 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:40:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 85 transitions. [2022-03-15 21:40:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:40:37,094 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:37,094 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:37,118 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:40:37,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 21:40:37,307 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:37,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:37,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1905973737, now seen corresponding path program 12 times [2022-03-15 21:40:37,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:37,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928034750] [2022-03-15 21:40:37,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:37,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:37,389 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:37,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928034750] [2022-03-15 21:40:37,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928034750] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:37,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976959247] [2022-03-15 21:40:37,389 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:40:37,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:37,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:37,390 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:40:37,391 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:40:37,421 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 21:40:37,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:37,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 21:40:37,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:37,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:37,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976959247] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:37,506 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:37,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 9 [2022-03-15 21:40:37,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [800451628] [2022-03-15 21:40:37,507 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:37,509 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:37,513 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 67 transitions. [2022-03-15 21:40:37,513 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:37,571 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 6 treesize of output 4 [2022-03-15 21:40:37,580 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 6 treesize of output 4 [2022-03-15 21:40:37,588 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 6 treesize of output 4 [2022-03-15 21:40:37,602 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 6 treesize of output 4 [2022-03-15 21:40:37,610 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 6 treesize of output 4 [2022-03-15 21:40:37,618 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 6 treesize of output 4 [2022-03-15 21:40:37,627 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:40:37,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 21:40:37,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:37,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 21:40:37,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-03-15 21:40:37,628 INFO L87 Difference]: Start difference. First operand 45 states and 85 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:40:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:37,673 INFO L93 Difference]: Finished difference Result 187 states and 349 transitions. [2022-03-15 21:40:37,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 21:40:37,674 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 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 21 [2022-03-15 21:40:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:37,675 INFO L225 Difference]: With dead ends: 187 [2022-03-15 21:40:37,675 INFO L226 Difference]: Without dead ends: 172 [2022-03-15 21:40:37,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-03-15 21:40:37,676 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:37,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 30 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:40:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-03-15 21:40:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 137. [2022-03-15 21:40:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.1029411764705883) internal successors, (286), 136 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have 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:40:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 286 transitions. [2022-03-15 21:40:37,680 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 286 transitions. Word has length 21 [2022-03-15 21:40:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:37,680 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 286 transitions. [2022-03-15 21:40:37,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:40:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 286 transitions. [2022-03-15 21:40:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:40:37,681 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:37,681 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:37,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 21:40:37,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 21:40:37,904 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:37,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:37,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1185273898, now seen corresponding path program 13 times [2022-03-15 21:40:37,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:37,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527467] [2022-03-15 21:40:37,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:37,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:38,077 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:38,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527467] [2022-03-15 21:40:38,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527467] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:38,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823851477] [2022-03-15 21:40:38,078 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:40:38,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:38,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:38,080 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:40:38,085 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:40:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:38,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 21:40:38,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:38,177 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 11 treesize of output 7 [2022-03-15 21:40:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:38,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:38,217 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:40:38,218 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 14 treesize of output 13 [2022-03-15 21:40:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:38,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823851477] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:38,258 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:38,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2022-03-15 21:40:38,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2090789196] [2022-03-15 21:40:38,258 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:38,259 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:38,263 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 70 transitions. [2022-03-15 21:40:38,263 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:38,807 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [4349#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (= 5 (select queue (+ 6 front))) (not (= 5 (select queue (+ 2 back)))) (not (= 5 (select queue back)))), 4344#(or (= 5 (select queue (+ 6 front))) (not (= 5 (select queue back)))), 4340#(or (= (select queue front) 5) (<= back front)), 4352#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 4341#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 4342#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 4350#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (= 5 (select queue (+ 6 front))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue back)))), 4346#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 4351#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (= 5 (select queue (+ 6 front))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue back)))), 4345#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ 6 front))) (not (= 5 (select queue back)))), 4353#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (= 5 (select queue (+ 6 front))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 4347#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 4348#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ 6 front))) (not (= 5 (select queue (+ 2 back)))) (not (= 5 (select queue back)))), 4343#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front))))] [2022-03-15 21:40:38,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:40:38,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:38,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:40:38,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2022-03-15 21:40:38,808 INFO L87 Difference]: Start difference. First operand 137 states and 286 transitions. Second operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 30 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:40:39,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:39,331 INFO L93 Difference]: Finished difference Result 284 states and 544 transitions. [2022-03-15 21:40:39,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 21:40:39,331 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 30 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 22 [2022-03-15 21:40:39,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:39,332 INFO L225 Difference]: With dead ends: 284 [2022-03-15 21:40:39,332 INFO L226 Difference]: Without dead ends: 168 [2022-03-15 21:40:39,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=402, Invalid=1578, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:40:39,334 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 344 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:39,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 264 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:40:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-03-15 21:40:39,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 50. [2022-03-15 21:40:39,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 95 transitions. [2022-03-15 21:40:39,337 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 95 transitions. Word has length 22 [2022-03-15 21:40:39,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:39,337 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 95 transitions. [2022-03-15 21:40:39,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 30 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:40:39,337 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 95 transitions. [2022-03-15 21:40:39,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:40:39,338 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:39,338 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:39,363 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:40:39,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 21:40:39,551 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:39,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:39,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1911958627, now seen corresponding path program 14 times [2022-03-15 21:40:39,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:39,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123742094] [2022-03-15 21:40:39,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:39,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:39,634 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:39,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123742094] [2022-03-15 21:40:39,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123742094] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:39,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375423746] [2022-03-15 21:40:39,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:40:39,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:39,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:39,636 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:40:39,638 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:40:39,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:40:39,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:39,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 21:40:39,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:39,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:39,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375423746] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:39,755 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:39,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2022-03-15 21:40:39,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [273501339] [2022-03-15 21:40:39,756 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:39,776 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:39,780 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 75 transitions. [2022-03-15 21:40:39,781 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:39,819 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 6 treesize of output 4 [2022-03-15 21:40:39,827 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 6 treesize of output 4 [2022-03-15 21:40:39,839 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 6 treesize of output 4 [2022-03-15 21:40:39,849 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 6 treesize of output 4 [2022-03-15 21:40:39,871 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 6 treesize of output 4 [2022-03-15 21:40:39,882 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 6 treesize of output 4 [2022-03-15 21:40:39,888 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 6 treesize of output 4 [2022-03-15 21:40:39,913 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:40:39,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 21:40:39,914 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:39,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 21:40:39,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:40:39,914 INFO L87 Difference]: Start difference. First operand 50 states and 95 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:40:39,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:39,965 INFO L93 Difference]: Finished difference Result 224 states and 421 transitions. [2022-03-15 21:40:39,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 21:40:39,965 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 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 23 [2022-03-15 21:40:39,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:39,966 INFO L225 Difference]: With dead ends: 224 [2022-03-15 21:40:39,966 INFO L226 Difference]: Without dead ends: 207 [2022-03-15 21:40:39,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:40:39,966 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 67 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:39,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 34 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:40:39,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-03-15 21:40:39,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 167. [2022-03-15 21:40:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 2.102409638554217) internal successors, (349), 166 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have 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:40:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 349 transitions. [2022-03-15 21:40:39,971 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 349 transitions. Word has length 23 [2022-03-15 21:40:39,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:39,971 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 349 transitions. [2022-03-15 21:40:39,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:40:39,971 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 349 transitions. [2022-03-15 21:40:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:40:39,972 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:39,972 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:40,001 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:40:40,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:40,190 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:40,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:40,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1280198046, now seen corresponding path program 15 times [2022-03-15 21:40:40,191 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:40,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952198510] [2022-03-15 21:40:40,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:40,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:40,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:40,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952198510] [2022-03-15 21:40:40,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952198510] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:40,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288026163] [2022-03-15 21:40:40,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:40:40,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:40,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:40,427 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:40:40,428 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:40:40,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 21:40:40,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:40,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 21:40:40,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:40,526 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 11 treesize of output 7 [2022-03-15 21:40:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:40,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:40,563 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:40:40,564 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 14 treesize of output 13 [2022-03-15 21:40:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:40,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288026163] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:40,602 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:40,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 17 [2022-03-15 21:40:40,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [385341110] [2022-03-15 21:40:40,603 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:40,604 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:40,609 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 78 transitions. [2022-03-15 21:40:40,609 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:41,254 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [5633#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 7 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 5634#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 5629#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 7 front))) (not (= 5 (select queue back)))), 5639#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 5632#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 7 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 5631#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 7 front))) (not (= 5 (select queue back)))), 5638#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 5630#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 7 front))) (not (= 5 (select queue back)))), 5626#(or (= 5 (select queue (+ 7 front))) (not (= 5 (select queue back)))), 5635#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 5636#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 5628#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 7 front))) (not (= 5 (select queue back)))), 5627#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ 7 front))) (not (= 5 (select queue back)))), 5624#(or (= (select queue front) 5) (<= back front)), 5625#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 5637#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5))] [2022-03-15 21:40:41,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:40:41,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:41,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:40:41,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1007, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:40:41,256 INFO L87 Difference]: Start difference. First operand 167 states and 349 transitions. Second operand has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:41,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:41,929 INFO L93 Difference]: Finished difference Result 346 states and 666 transitions. [2022-03-15 21:40:41,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 21:40:41,930 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 21:40:41,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:41,931 INFO L225 Difference]: With dead ends: 346 [2022-03-15 21:40:41,931 INFO L226 Difference]: Without dead ends: 206 [2022-03-15 21:40:41,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=503, Invalid=2047, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:40:41,932 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 454 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:41,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 279 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:40:41,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-03-15 21:40:41,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 55. [2022-03-15 21:40:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 54 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have 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:40:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 105 transitions. [2022-03-15 21:40:41,935 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 105 transitions. Word has length 24 [2022-03-15 21:40:41,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:41,935 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 105 transitions. [2022-03-15 21:40:41,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 105 transitions. [2022-03-15 21:40:41,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:40:41,936 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:41,936 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:41,961 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:40:42,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 21:40:42,137 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:42,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:42,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1030689961, now seen corresponding path program 16 times [2022-03-15 21:40:42,138 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:42,138 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951343186] [2022-03-15 21:40:42,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:42,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:42,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:42,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951343186] [2022-03-15 21:40:42,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951343186] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:42,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335912874] [2022-03-15 21:40:42,226 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:40:42,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:42,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:42,227 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:40:42,228 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:40:42,257 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:40:42,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:42,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 21:40:42,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:42,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:42,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335912874] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:42,378 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:42,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 11 [2022-03-15 21:40:42,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1036632999] [2022-03-15 21:40:42,379 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:42,380 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:42,384 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 83 transitions. [2022-03-15 21:40:42,384 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:42,437 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 6 treesize of output 4 [2022-03-15 21:40:42,445 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 6 treesize of output 4 [2022-03-15 21:40:42,452 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 6 treesize of output 4 [2022-03-15 21:40:42,459 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 6 treesize of output 4 [2022-03-15 21:40:42,466 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 6 treesize of output 4 [2022-03-15 21:40:42,473 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 6 treesize of output 4 [2022-03-15 21:40:42,480 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 6 treesize of output 4 [2022-03-15 21:40:42,504 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 6 treesize of output 4 [2022-03-15 21:40:42,513 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:40:42,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:40:42,513 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:42,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:40:42,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:40:42,514 INFO L87 Difference]: Start difference. First operand 55 states and 105 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:40:42,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:42,580 INFO L93 Difference]: Finished difference Result 264 states and 499 transitions. [2022-03-15 21:40:42,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 21:40:42,581 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 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 25 [2022-03-15 21:40:42,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:42,582 INFO L225 Difference]: With dead ends: 264 [2022-03-15 21:40:42,582 INFO L226 Difference]: Without dead ends: 245 [2022-03-15 21:40:42,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:40:42,583 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 80 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:42,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 38 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:40:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-03-15 21:40:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 200. [2022-03-15 21:40:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 2.100502512562814) internal successors, (418), 199 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have 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:40:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 418 transitions. [2022-03-15 21:40:42,588 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 418 transitions. Word has length 25 [2022-03-15 21:40:42,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:42,588 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 418 transitions. [2022-03-15 21:40:42,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:40:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 418 transitions. [2022-03-15 21:40:42,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:40:42,589 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:42,589 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:42,611 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:40:42,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 21:40:42,811 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:42,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:42,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2086603370, now seen corresponding path program 17 times [2022-03-15 21:40:42,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:42,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809290899] [2022-03-15 21:40:42,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:42,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:43,056 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:43,056 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:43,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809290899] [2022-03-15 21:40:43,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809290899] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:43,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190308642] [2022-03-15 21:40:43,057 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:40:43,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:43,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:43,058 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:40:43,059 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:40:43,084 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 21:40:43,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:43,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 21:40:43,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:43,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:40:43,491 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 13 treesize of output 7 [2022-03-15 21:40:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:43,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:43,874 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:40:43,874 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 14 treesize of output 13 [2022-03-15 21:40:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:43,898 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190308642] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:43,898 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:43,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 46 [2022-03-15 21:40:43,898 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [140415970] [2022-03-15 21:40:43,898 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:43,900 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:43,904 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 86 transitions. [2022-03-15 21:40:43,904 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:03,144 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [7153#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 8))) (not (= 5 (select queue back)))), 7159#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 8))) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 7089#(or (not (< (+ 3 front) back)) (= 5 (select queue (+ 3 front)))), 7155#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 8))) (not (= 5 (select queue back)))), 7158#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 8))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 7147#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 7150#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 7148#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 7077#(or (not (< front back)) (= (select queue front) 5)), 7149#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 7085#(or (= 5 (select queue (+ 2 front))) (not (< (+ 2 front) back))), 7154#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 8))) (not (= 5 (select queue back)))), 7146#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 7156#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 8))) (not (= 5 (select queue back)))), 7081#(or (not (< (+ front 1) back)) (= 5 (select queue (+ front 1)))), 7152#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ front 8))) (not (= 5 (select queue back)))), 7151#(or (= 5 (select queue (+ front 8))) (not (= 5 (select queue back)))), 7157#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 8))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))))] [2022-03-15 21:41:03,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 21:41:03,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:03,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 21:41:03,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=638, Invalid=3144, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 21:41:03,146 INFO L87 Difference]: Start difference. First operand 200 states and 418 transitions. Second operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:41:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:04,081 INFO L93 Difference]: Finished difference Result 414 states and 800 transitions. [2022-03-15 21:41:04,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 21:41:04,081 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 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 26 [2022-03-15 21:41:04,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:04,082 INFO L225 Difference]: With dead ends: 414 [2022-03-15 21:41:04,082 INFO L226 Difference]: Without dead ends: 248 [2022-03-15 21:41:04,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=1168, Invalid=5152, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 21:41:04,084 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 543 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:04,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [543 Valid, 351 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:41:04,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-03-15 21:41:04,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 60. [2022-03-15 21:41:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 59 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) [2022-03-15 21:41:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 115 transitions. [2022-03-15 21:41:04,088 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 115 transitions. Word has length 26 [2022-03-15 21:41:04,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:04,088 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 115 transitions. [2022-03-15 21:41:04,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:41:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 115 transitions. [2022-03-15 21:41:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:41:04,089 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:04,089 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:04,108 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:41:04,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:04,300 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:04,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:04,300 INFO L85 PathProgramCache]: Analyzing trace with hash -259451229, now seen corresponding path program 18 times [2022-03-15 21:41:04,301 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:04,301 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445423489] [2022-03-15 21:41:04,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:04,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:04,400 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:04,400 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:04,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445423489] [2022-03-15 21:41:04,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445423489] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:04,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018112810] [2022-03-15 21:41:04,400 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:41:04,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:04,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:04,404 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:41:04,408 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:41:04,437 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 21:41:04,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:04,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:41:04,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:04,502 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:04,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:04,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018112810] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:04,576 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:04,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 12 [2022-03-15 21:41:04,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [504960238] [2022-03-15 21:41:04,576 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:04,578 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:04,584 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 91 transitions. [2022-03-15 21:41:04,584 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:04,673 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 6 treesize of output 4 [2022-03-15 21:41:04,684 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 6 treesize of output 4 [2022-03-15 21:41:04,694 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 6 treesize of output 4 [2022-03-15 21:41:04,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:41:04,715 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 6 treesize of output 4 [2022-03-15 21:41:04,725 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 6 treesize of output 4 [2022-03-15 21:41:04,735 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 6 treesize of output 4 [2022-03-15 21:41:04,746 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 6 treesize of output 4 [2022-03-15 21:41:04,755 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 6 treesize of output 4 [2022-03-15 21:41:04,763 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:41:04,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:41:04,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:04,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:41:04,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:41:04,764 INFO L87 Difference]: Start difference. First operand 60 states and 115 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 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:41:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:04,840 INFO L93 Difference]: Finished difference Result 307 states and 583 transitions. [2022-03-15 21:41:04,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 21:41:04,840 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 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 27 [2022-03-15 21:41:04,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:04,842 INFO L225 Difference]: With dead ends: 307 [2022-03-15 21:41:04,842 INFO L226 Difference]: Without dead ends: 286 [2022-03-15 21:41:04,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:41:04,843 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 78 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:04,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 47 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:41:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-03-15 21:41:04,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 236. [2022-03-15 21:41:04,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 2.097872340425532) internal successors, (493), 235 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have 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:41:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 493 transitions. [2022-03-15 21:41:04,852 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 493 transitions. Word has length 27 [2022-03-15 21:41:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:04,852 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 493 transitions. [2022-03-15 21:41:04,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 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:41:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 493 transitions. [2022-03-15 21:41:04,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:41:04,853 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:04,853 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:04,872 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:41:05,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:05,063 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:05,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:05,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1379955422, now seen corresponding path program 19 times [2022-03-15 21:41:05,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:05,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692030647] [2022-03-15 21:41:05,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:05,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:05,369 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:05,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692030647] [2022-03-15 21:41:05,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692030647] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:05,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063730510] [2022-03-15 21:41:05,369 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:41:05,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:05,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:05,370 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:41:05,371 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:41:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:05,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 21:41:05,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:05,484 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 11 treesize of output 7 [2022-03-15 21:41:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:05,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:05,525 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:41:05,526 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 14 treesize of output 13 [2022-03-15 21:41:05,574 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:05,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063730510] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:05,575 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:05,575 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 21 [2022-03-15 21:41:05,575 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1980596118] [2022-03-15 21:41:05,575 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:05,577 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:05,583 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 94 transitions. [2022-03-15 21:41:05,583 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:06,527 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [8874#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 8872#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 8879#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 9 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 8873#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 8876#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 8864#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ 9 front))) (not (= 5 (select queue back)))), 8868#(or (= (select queue front) 5) (<= back front)), 8869#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 8875#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 8866#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 9 front))) (not (= 5 (select queue back)))), 8880#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 8882#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 9 front))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 8870#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 8878#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 9 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 8867#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 9 front))) (not (= 5 (select queue back)))), 8877#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 9 front))) (not (= 5 (select queue back)))), 8881#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 9 front))) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 8871#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 8865#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 9 front))) (not (= 5 (select queue back)))), 8863#(or (= 5 (select queue (+ 9 front))) (not (= 5 (select queue back))))] [2022-03-15 21:41:06,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 21:41:06,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:06,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 21:41:06,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:41:06,529 INFO L87 Difference]: Start difference. First operand 236 states and 493 transitions. Second operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:41:07,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:07,436 INFO L93 Difference]: Finished difference Result 488 states and 946 transitions. [2022-03-15 21:41:07,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 21:41:07,436 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 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 28 [2022-03-15 21:41:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:07,438 INFO L225 Difference]: With dead ends: 488 [2022-03-15 21:41:07,438 INFO L226 Difference]: Without dead ends: 294 [2022-03-15 21:41:07,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=738, Invalid=3168, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 21:41:07,439 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 710 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:07,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [710 Valid, 392 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:41:07,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-03-15 21:41:07,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 65. [2022-03-15 21:41:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.953125) internal successors, (125), 64 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 125 transitions. [2022-03-15 21:41:07,443 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 125 transitions. Word has length 28 [2022-03-15 21:41:07,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:07,443 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 125 transitions. [2022-03-15 21:41:07,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:41:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 125 transitions. [2022-03-15 21:41:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:41:07,444 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:07,444 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:07,469 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:41:07,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:07,666 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:07,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:07,667 INFO L85 PathProgramCache]: Analyzing trace with hash 171798679, now seen corresponding path program 20 times [2022-03-15 21:41:07,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:07,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360845890] [2022-03-15 21:41:07,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:07,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:07,783 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:07,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360845890] [2022-03-15 21:41:07,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360845890] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:07,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924325505] [2022-03-15 21:41:07,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:41:07,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:07,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:07,784 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:41:07,786 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:41:07,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:41:07,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:07,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 21:41:07,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:07,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:07,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924325505] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:07,956 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:07,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 13 [2022-03-15 21:41:07,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1708505421] [2022-03-15 21:41:07,956 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:07,959 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:07,966 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 99 transitions. [2022-03-15 21:41:07,966 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:08,035 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 6 treesize of output 4 [2022-03-15 21:41:08,048 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 6 treesize of output 4 [2022-03-15 21:41:08,057 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 6 treesize of output 4 [2022-03-15 21:41:08,066 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 6 treesize of output 4 [2022-03-15 21:41:08,077 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 6 treesize of output 4 [2022-03-15 21:41:08,088 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 6 treesize of output 4 [2022-03-15 21:41:08,100 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 6 treesize of output 4 [2022-03-15 21:41:08,111 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 6 treesize of output 4 [2022-03-15 21:41:08,123 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 6 treesize of output 4 [2022-03-15 21:41:08,132 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 6 treesize of output 4 [2022-03-15 21:41:08,163 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:41:08,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:41:08,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:08,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:41:08,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:41:08,164 INFO L87 Difference]: Start difference. First operand 65 states and 125 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:08,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:08,245 INFO L93 Difference]: Finished difference Result 353 states and 673 transitions. [2022-03-15 21:41:08,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 21:41:08,245 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 21:41:08,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:08,247 INFO L225 Difference]: With dead ends: 353 [2022-03-15 21:41:08,247 INFO L226 Difference]: Without dead ends: 330 [2022-03-15 21:41:08,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:41:08,247 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 102 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:08,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 46 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:41:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-03-15 21:41:08,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 275. [2022-03-15 21:41:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 2.0948905109489053) internal successors, (574), 274 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have 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:41:08,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 574 transitions. [2022-03-15 21:41:08,254 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 574 transitions. Word has length 29 [2022-03-15 21:41:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:08,254 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 574 transitions. [2022-03-15 21:41:08,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 574 transitions. [2022-03-15 21:41:08,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:41:08,255 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:08,255 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:08,279 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:41:08,455 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,SelfDestructingSolverStorable21 [2022-03-15 21:41:08,456 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:08,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:08,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1404060502, now seen corresponding path program 21 times [2022-03-15 21:41:08,458 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:08,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742207206] [2022-03-15 21:41:08,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:08,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:08,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:08,795 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742207206] [2022-03-15 21:41:08,795 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742207206] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:08,795 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030840287] [2022-03-15 21:41:08,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:41:08,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:08,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:08,800 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:41:08,802 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:41:08,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 21:41:08,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:08,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 21:41:08,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:08,930 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 11 treesize of output 7 [2022-03-15 21:41:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:08,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:08,986 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:41:08,986 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 14 treesize of output 13 [2022-03-15 21:41:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:09,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030840287] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:09,050 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:09,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 23 [2022-03-15 21:41:09,051 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1374129273] [2022-03-15 21:41:09,051 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:09,053 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:09,061 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 102 transitions. [2022-03-15 21:41:09,061 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:10,255 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [10833#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ front 10)) 5) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 10840#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 10838#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 10843#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 10835#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 10832#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ front 10)) 5) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 10831#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ front 10)) 5) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 10825#(or (= (select queue (+ front 10)) 5) (not (= 5 (select queue back)))), 10834#(or (= (select queue front) 5) (<= back front)), 10828#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ front 10)) 5) (not (= 5 (select queue back)))), 10837#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 10836#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 10839#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 10829#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ front 10)) 5) (not (= 5 (select queue back)))), 10844#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ front 10)) 5) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 10842#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 10827#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ front 10)) 5) (not (= 5 (select queue back)))), 10845#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ front 10)) 5) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 10841#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 10826#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 10)) 5) (not (= 5 (select queue back)))), 10846#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 10830#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ front 10)) 5) (not (= 5 (select queue back))))] [2022-03-15 21:41:10,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 21:41:10,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:10,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 21:41:10,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1862, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 21:41:10,256 INFO L87 Difference]: Start difference. First operand 275 states and 574 transitions. Second operand has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have 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:41:11,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:11,402 INFO L93 Difference]: Finished difference Result 568 states and 1104 transitions. [2022-03-15 21:41:11,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 21:41:11,402 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 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 30 [2022-03-15 21:41:11,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:11,404 INFO L225 Difference]: With dead ends: 568 [2022-03-15 21:41:11,404 INFO L226 Difference]: Without dead ends: 344 [2022-03-15 21:41:11,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=872, Invalid=3820, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 21:41:11,406 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 751 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:11,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [751 Valid, 511 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:41:11,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-03-15 21:41:11,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 70. [2022-03-15 21:41:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 69 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have 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:41:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 135 transitions. [2022-03-15 21:41:11,410 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 135 transitions. Word has length 30 [2022-03-15 21:41:11,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:11,410 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 135 transitions. [2022-03-15 21:41:11,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have 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:41:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 135 transitions. [2022-03-15 21:41:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 21:41:11,410 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:11,410 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:11,433 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:41:11,611 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,SelfDestructingSolverStorable22 [2022-03-15 21:41:11,611 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:11,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:11,611 INFO L85 PathProgramCache]: Analyzing trace with hash 576946403, now seen corresponding path program 22 times [2022-03-15 21:41:11,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:11,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519902118] [2022-03-15 21:41:11,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:11,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:11,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:11,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519902118] [2022-03-15 21:41:11,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519902118] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:11,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545327053] [2022-03-15 21:41:11,757 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:41:11,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:11,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:11,758 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:41:11,759 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:41:11,785 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:41:11,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:11,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:41:11,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:11,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:11,920 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:11,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545327053] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:11,921 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:11,921 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 14 [2022-03-15 21:41:11,921 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1046698521] [2022-03-15 21:41:11,921 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:11,924 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:11,932 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 107 transitions. [2022-03-15 21:41:11,932 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:12,020 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 6 treesize of output 4 [2022-03-15 21:41:12,030 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 6 treesize of output 4 [2022-03-15 21:41:12,038 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 6 treesize of output 4 [2022-03-15 21:41:12,047 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 6 treesize of output 4 [2022-03-15 21:41:12,062 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 6 treesize of output 4 [2022-03-15 21:41:12,071 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 6 treesize of output 4 [2022-03-15 21:41:12,079 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 6 treesize of output 4 [2022-03-15 21:41:12,088 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 6 treesize of output 4 [2022-03-15 21:41:12,097 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 6 treesize of output 4 [2022-03-15 21:41:12,105 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 6 treesize of output 4 [2022-03-15 21:41:12,112 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 6 treesize of output 4 [2022-03-15 21:41:12,115 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:41:12,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 21:41:12,116 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:12,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 21:41:12,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:41:12,116 INFO L87 Difference]: Start difference. First operand 70 states and 135 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 14 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:12,205 INFO L93 Difference]: Finished difference Result 402 states and 769 transitions. [2022-03-15 21:41:12,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 21:41:12,205 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 14 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 21:41:12,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:12,207 INFO L225 Difference]: With dead ends: 402 [2022-03-15 21:41:12,207 INFO L226 Difference]: Without dead ends: 377 [2022-03-15 21:41:12,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:41:12,207 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 75 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:12,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 59 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:41:12,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-03-15 21:41:12,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 317. [2022-03-15 21:41:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 2.0917721518987342) internal successors, (661), 316 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have 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:41:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 661 transitions. [2022-03-15 21:41:12,214 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 661 transitions. Word has length 31 [2022-03-15 21:41:12,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:12,215 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 661 transitions. [2022-03-15 21:41:12,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 14 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 661 transitions. [2022-03-15 21:41:12,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 21:41:12,215 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:12,216 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:12,241 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:41:12,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:12,416 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:12,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:12,416 INFO L85 PathProgramCache]: Analyzing trace with hash -630415390, now seen corresponding path program 23 times [2022-03-15 21:41:12,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:12,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190588348] [2022-03-15 21:41:12,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:12,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:12,812 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:12,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190588348] [2022-03-15 21:41:12,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190588348] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:12,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036896278] [2022-03-15 21:41:12,813 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:41:12,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:12,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:12,814 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:41:12,815 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:41:12,842 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 21:41:12,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:12,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 21:41:12,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:13,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:41:13,790 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 7 [2022-03-15 21:41:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 66 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:13,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:14,561 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:41:14,561 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 12 treesize of output 11 [2022-03-15 21:41:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 55 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:14,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036896278] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:14,588 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:14,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 61 [2022-03-15 21:41:14,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1435686670] [2022-03-15 21:41:14,588 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:14,591 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:14,600 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 110 transitions. [2022-03-15 21:41:14,600 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:16,354 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [13089#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ front 11)) 5) (not (= 5 (select queue back)))), 13081#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 13096#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 13097#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 13093#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ front 11)) 5) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 13082#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 13085#(or (= (select queue (+ front 11)) 5) (not (= 5 (select queue back)))), 12989#(or (not (< front back)) (= (select queue front) 5)), 13099#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ front 11)) 5) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 13098#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 13088#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ front 11)) 5) (not (= 5 (select queue back)))), 13090#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ front 11)) 5) (not (= 5 (select queue back)))), 13100#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ front 11)) 5) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 13080#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 13095#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 13101#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ front 11)) 5) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 13091#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ front 11)) 5) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 13087#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ front 11)) 5) (not (= 5 (select queue back)))), 13079#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 13084#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 13094#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 13092#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ front 11)) 5) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 13083#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 13086#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 11)) 5) (not (= 5 (select queue back))))] [2022-03-15 21:41:16,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 21:41:16,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:16,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 21:41:16,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1199, Invalid=6111, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 21:41:16,356 INFO L87 Difference]: Start difference. First operand 317 states and 661 transitions. Second operand has 51 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:41:17,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:17,874 INFO L93 Difference]: Finished difference Result 654 states and 1274 transitions. [2022-03-15 21:41:17,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 21:41:17,875 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 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 32 [2022-03-15 21:41:17,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:17,876 INFO L225 Difference]: With dead ends: 654 [2022-03-15 21:41:17,876 INFO L226 Difference]: Without dead ends: 398 [2022-03-15 21:41:17,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1940 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2158, Invalid=9832, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 21:41:17,894 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 878 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:17,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [878 Valid, 578 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:41:17,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-03-15 21:41:17,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 75. [2022-03-15 21:41:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 74 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have 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:41:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 145 transitions. [2022-03-15 21:41:17,899 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 145 transitions. Word has length 32 [2022-03-15 21:41:17,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:17,899 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 145 transitions. [2022-03-15 21:41:17,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:41:17,899 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 145 transitions. [2022-03-15 21:41:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 21:41:17,899 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:17,899 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:17,924 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:41:18,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:18,122 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:18,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:18,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1932703191, now seen corresponding path program 24 times [2022-03-15 21:41:18,123 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:18,123 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479284318] [2022-03-15 21:41:18,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:18,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:18,264 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:18,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479284318] [2022-03-15 21:41:18,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479284318] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:18,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540638050] [2022-03-15 21:41:18,264 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:41:18,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:18,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:18,268 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:41:18,269 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:41:18,299 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-03-15 21:41:18,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:18,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:41:18,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:18,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:18,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540638050] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:18,417 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:18,417 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 15 [2022-03-15 21:41:18,417 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1148575928] [2022-03-15 21:41:18,417 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:18,420 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:18,427 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 115 transitions. [2022-03-15 21:41:18,427 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:18,520 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 6 treesize of output 4 [2022-03-15 21:41:18,529 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 6 treesize of output 4 [2022-03-15 21:41:18,536 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 6 treesize of output 4 [2022-03-15 21:41:18,543 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 6 treesize of output 4 [2022-03-15 21:41:18,551 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 6 treesize of output 4 [2022-03-15 21:41:18,562 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 6 treesize of output 4 [2022-03-15 21:41:18,571 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 6 treesize of output 4 [2022-03-15 21:41:18,578 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 6 treesize of output 4 [2022-03-15 21:41:18,587 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 6 treesize of output 4 [2022-03-15 21:41:18,595 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 6 treesize of output 4 [2022-03-15 21:41:18,603 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 6 treesize of output 4 [2022-03-15 21:41:18,609 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 6 treesize of output 4 [2022-03-15 21:41:18,631 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:41:18,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:41:18,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:18,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:41:18,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:41:18,634 INFO L87 Difference]: Start difference. First operand 75 states and 145 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 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:41:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:18,733 INFO L93 Difference]: Finished difference Result 454 states and 871 transitions. [2022-03-15 21:41:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:41:18,733 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 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 33 [2022-03-15 21:41:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:18,735 INFO L225 Difference]: With dead ends: 454 [2022-03-15 21:41:18,735 INFO L226 Difference]: Without dead ends: 427 [2022-03-15 21:41:18,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:41:18,736 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 74 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:18,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 69 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:41:18,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-03-15 21:41:18,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 362. [2022-03-15 21:41:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 2.0886426592797784) internal successors, (754), 361 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have 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:41:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 754 transitions. [2022-03-15 21:41:18,752 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 754 transitions. Word has length 33 [2022-03-15 21:41:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:18,752 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 754 transitions. [2022-03-15 21:41:18,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 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:41:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 754 transitions. [2022-03-15 21:41:18,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 21:41:18,754 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:18,754 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:18,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 21:41:18,967 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,SelfDestructingSolverStorable25 [2022-03-15 21:41:18,967 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:18,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:18,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1299190038, now seen corresponding path program 25 times [2022-03-15 21:41:18,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:18,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483169837] [2022-03-15 21:41:18,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:18,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:19,384 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:19,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483169837] [2022-03-15 21:41:19,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483169837] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:19,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835392924] [2022-03-15 21:41:19,385 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:41:19,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:19,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:19,386 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:41:19,386 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:41:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:19,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 21:41:19,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:19,519 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 11 treesize of output 7 [2022-03-15 21:41:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:19,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:19,565 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:41:19,565 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 14 treesize of output 13 [2022-03-15 21:41:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:19,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835392924] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:19,633 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:19,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 27 [2022-03-15 21:41:19,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1153603154] [2022-03-15 21:41:19,633 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:19,635 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:19,644 INFO L252 McrAutomatonBuilder]: Finished intersection with 77 states and 118 transitions. [2022-03-15 21:41:19,644 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:21,219 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [15573#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 12)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 15581#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 15574#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 12)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 15585#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 15589#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 15586#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 15576#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 12)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 15584#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 15572#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 12)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue back)))), 15588#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 15569#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 12)) 5) (not (= 5 (select queue (+ 2 back)))) (not (= 5 (select queue back)))), 15580#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 15582#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 15570#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 12)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= 5 (select queue back)))), 15591#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 12)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 15577#(or (= (select queue front) 5) (<= back front)), 15568#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 12)) 5) (not (= 5 (select queue back)))), 15571#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 12)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue back)))), 15579#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 15575#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 12)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 15567#(or (= (select queue (+ front 12)) 5) (not (= 5 (select queue back)))), 15590#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 12)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 15583#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 15578#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 15592#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 12)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 15587#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5))] [2022-03-15 21:41:21,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-15 21:41:21,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:21,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-15 21:41:21,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=2577, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 21:41:21,220 INFO L87 Difference]: Start difference. First operand 362 states and 754 transitions. Second operand has 55 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 54 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have 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:41:22,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:22,710 INFO L93 Difference]: Finished difference Result 746 states and 1456 transitions. [2022-03-15 21:41:22,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 21:41:22,710 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 54 states have internal predecessors, (99), 0 states have call successors, (0), 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 34 [2022-03-15 21:41:22,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:22,712 INFO L225 Difference]: With dead ends: 746 [2022-03-15 21:41:22,712 INFO L226 Difference]: Without dead ends: 456 [2022-03-15 21:41:22,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1173, Invalid=5307, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 21:41:22,713 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 959 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:22,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [959 Valid, 715 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 1477 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:41:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-03-15 21:41:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 80. [2022-03-15 21:41:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.9620253164556962) internal successors, (155), 79 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have 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:41:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 155 transitions. [2022-03-15 21:41:22,717 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 155 transitions. Word has length 34 [2022-03-15 21:41:22,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:22,717 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 155 transitions. [2022-03-15 21:41:22,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 54 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have 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:41:22,718 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 155 transitions. [2022-03-15 21:41:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 21:41:22,718 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:22,718 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:22,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-03-15 21:41:22,940 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,SelfDestructingSolverStorable26 [2022-03-15 21:41:22,940 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:22,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:22,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1620929315, now seen corresponding path program 26 times [2022-03-15 21:41:22,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:22,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587117534] [2022-03-15 21:41:22,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:22,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:23,083 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:23,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:23,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587117534] [2022-03-15 21:41:23,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587117534] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:23,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532110213] [2022-03-15 21:41:23,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:41:23,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:23,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:23,084 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:41:23,085 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:41:23,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:41:23,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:23,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 21:41:23,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:23,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:23,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532110213] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:23,244 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:23,244 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 16 [2022-03-15 21:41:23,244 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1442750279] [2022-03-15 21:41:23,244 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:23,247 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:23,255 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 123 transitions. [2022-03-15 21:41:23,255 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:23,331 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 6 treesize of output 4 [2022-03-15 21:41:23,341 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 6 treesize of output 4 [2022-03-15 21:41:23,390 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 6 treesize of output 4 [2022-03-15 21:41:23,400 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 6 treesize of output 4 [2022-03-15 21:41:23,408 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 6 treesize of output 4 [2022-03-15 21:41:23,419 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 6 treesize of output 4 [2022-03-15 21:41:23,430 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 6 treesize of output 4 [2022-03-15 21:41:23,439 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 6 treesize of output 4 [2022-03-15 21:41:23,449 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 6 treesize of output 4 [2022-03-15 21:41:23,461 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 6 treesize of output 4 [2022-03-15 21:41:23,471 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 6 treesize of output 4 [2022-03-15 21:41:23,481 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 6 treesize of output 4 [2022-03-15 21:41:23,501 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 6 treesize of output 4 [2022-03-15 21:41:23,513 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:41:23,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 21:41:23,513 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:23,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 21:41:23,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:41:23,514 INFO L87 Difference]: Start difference. First operand 80 states and 155 transitions. Second operand has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:41:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:23,616 INFO L93 Difference]: Finished difference Result 509 states and 979 transitions. [2022-03-15 21:41:23,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 21:41:23,617 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 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 35 [2022-03-15 21:41:23,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:23,618 INFO L225 Difference]: With dead ends: 509 [2022-03-15 21:41:23,618 INFO L226 Difference]: Without dead ends: 480 [2022-03-15 21:41:23,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:41:23,619 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 78 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:23,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 85 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:41:23,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-03-15 21:41:23,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 410. [2022-03-15 21:41:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 2.0855745721271393) internal successors, (853), 409 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have 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:41:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 853 transitions. [2022-03-15 21:41:23,627 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 853 transitions. Word has length 35 [2022-03-15 21:41:23,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:23,627 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 853 transitions. [2022-03-15 21:41:23,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:41:23,627 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 853 transitions. [2022-03-15 21:41:23,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 21:41:23,628 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:23,628 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:23,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-03-15 21:41:23,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 21:41:23,843 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:23,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:23,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1594821982, now seen corresponding path program 27 times [2022-03-15 21:41:23,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:23,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230327567] [2022-03-15 21:41:23,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:23,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:24,306 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:24,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230327567] [2022-03-15 21:41:24,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230327567] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:24,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044964982] [2022-03-15 21:41:24,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:41:24,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:24,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:24,307 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:41:24,309 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:41:24,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-03-15 21:41:24,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:24,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 21:41:24,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:25,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:41:25,468 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 7 [2022-03-15 21:41:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 91 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:25,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:26,409 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:41:26,409 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 12 treesize of output 11 [2022-03-15 21:41:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:26,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044964982] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:26,437 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:26,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 71 [2022-03-15 21:41:26,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [537036238] [2022-03-15 21:41:26,437 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:26,445 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:26,455 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 126 transitions. [2022-03-15 21:41:26,455 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:28,923 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [18404#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 13))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 18390#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 13))) (not (= 5 (select queue back)))), 18392#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 13))) (not (= 5 (select queue back)))), 18409#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 18395#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 18280#(or (not (< front back)) (= (select queue front) 5)), 18394#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 18405#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 13))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 18398#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 18388#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 13))) (not (= 5 (select queue back)))), 18403#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 13))) (not (= 5 (select queue back)))), 18389#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 13))) (not (= 5 (select queue back)))), 18408#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 18407#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 18400#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 18402#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 18406#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 18396#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 18387#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 13))) (not (= 5 (select queue back)))), 18397#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 18391#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 13))) (not (= 5 (select queue back)))), 18401#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 18399#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 18410#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 13))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 18384#(or (= 5 (select queue (+ front 13))) (not (= 5 (select queue back)))), 18385#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ front 13))) (not (= 5 (select queue back)))), 18393#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 13))) (not (= 5 (select queue back)))), 18386#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 13))) (not (= 5 (select queue back))))] [2022-03-15 21:41:28,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-03-15 21:41:28,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:28,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-03-15 21:41:28,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1595, Invalid=8305, Unknown=0, NotChecked=0, Total=9900 [2022-03-15 21:41:28,925 INFO L87 Difference]: Start difference. First operand 410 states and 853 transitions. Second operand has 59 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 58 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:30,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:30,960 INFO L93 Difference]: Finished difference Result 844 states and 1650 transitions. [2022-03-15 21:41:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 21:41:30,961 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 58 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-15 21:41:30,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:30,962 INFO L225 Difference]: With dead ends: 844 [2022-03-15 21:41:30,962 INFO L226 Difference]: Without dead ends: 518 [2022-03-15 21:41:30,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2679 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2882, Invalid=13374, Unknown=0, NotChecked=0, Total=16256 [2022-03-15 21:41:30,964 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 1279 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:30,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1279 Valid, 735 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:41:30,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-03-15 21:41:30,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 85. [2022-03-15 21:41:30,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.9642857142857142) internal successors, (165), 84 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have 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:41:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 165 transitions. [2022-03-15 21:41:30,967 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 165 transitions. Word has length 36 [2022-03-15 21:41:30,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:30,967 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 165 transitions. [2022-03-15 21:41:30,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 58 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:30,968 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 165 transitions. [2022-03-15 21:41:30,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 21:41:30,968 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:30,968 INFO L514 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:30,987 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:41:31,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 21:41:31,181 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:31,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:31,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2100869911, now seen corresponding path program 28 times [2022-03-15 21:41:31,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:31,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451000525] [2022-03-15 21:41:31,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:31,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:31,367 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:31,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451000525] [2022-03-15 21:41:31,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451000525] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:31,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397146161] [2022-03-15 21:41:31,367 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:41:31,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:31,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:31,372 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:41:31,373 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:41:31,405 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:41:31,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:31,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 21:41:31,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:31,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:31,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397146161] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:31,561 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:31,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 17 [2022-03-15 21:41:31,561 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1106426412] [2022-03-15 21:41:31,561 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:31,564 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:31,574 INFO L252 McrAutomatonBuilder]: Finished intersection with 85 states and 131 transitions. [2022-03-15 21:41:31,574 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:31,681 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 6 treesize of output 4 [2022-03-15 21:41:31,689 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 6 treesize of output 4 [2022-03-15 21:41:31,696 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 6 treesize of output 4 [2022-03-15 21:41:31,707 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 6 treesize of output 4 [2022-03-15 21:41:31,715 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 6 treesize of output 4 [2022-03-15 21:41:31,721 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 6 treesize of output 4 [2022-03-15 21:41:31,731 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 6 treesize of output 4 [2022-03-15 21:41:31,738 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 6 treesize of output 4 [2022-03-15 21:41:31,748 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 6 treesize of output 4 [2022-03-15 21:41:31,756 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 6 treesize of output 4 [2022-03-15 21:41:31,764 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 6 treesize of output 4 [2022-03-15 21:41:31,772 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 6 treesize of output 4 [2022-03-15 21:41:31,779 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 6 treesize of output 4 [2022-03-15 21:41:31,786 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 6 treesize of output 4 [2022-03-15 21:41:31,792 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:41:31,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 21:41:31,792 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:31,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 21:41:31,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:41:31,793 INFO L87 Difference]: Start difference. First operand 85 states and 165 transitions. Second operand has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:31,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:31,887 INFO L93 Difference]: Finished difference Result 567 states and 1093 transitions. [2022-03-15 21:41:31,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 21:41:31,888 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-03-15 21:41:31,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:31,889 INFO L225 Difference]: With dead ends: 567 [2022-03-15 21:41:31,889 INFO L226 Difference]: Without dead ends: 536 [2022-03-15 21:41:31,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:41:31,890 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 118 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:31,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 81 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:41:31,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-03-15 21:41:31,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 461. [2022-03-15 21:41:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 2.082608695652174) internal successors, (958), 460 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have 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:41:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 958 transitions. [2022-03-15 21:41:31,904 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 958 transitions. Word has length 37 [2022-03-15 21:41:31,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:31,904 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 958 transitions. [2022-03-15 21:41:31,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 958 transitions. [2022-03-15 21:41:31,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 21:41:31,905 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:31,905 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:31,929 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:41:32,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:32,122 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:32,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:32,122 INFO L85 PathProgramCache]: Analyzing trace with hash -154640682, now seen corresponding path program 29 times [2022-03-15 21:41:32,123 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:32,123 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575854042] [2022-03-15 21:41:32,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:32,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:32,631 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:32,631 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:32,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575854042] [2022-03-15 21:41:32,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575854042] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:32,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85672585] [2022-03-15 21:41:32,631 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:41:32,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:32,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:32,632 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:41:32,633 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:41:32,666 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-03-15 21:41:32,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:32,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 21:41:32,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:33,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:41:33,886 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 7 [2022-03-15 21:41:33,893 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 105 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:33,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:34,948 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:41:34,948 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 12 treesize of output 11 [2022-03-15 21:41:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 91 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:34,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85672585] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:34,977 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:34,978 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 76 [2022-03-15 21:41:34,978 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [983528636] [2022-03-15 21:41:34,978 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:34,981 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:34,992 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 134 transitions. [2022-03-15 21:41:34,992 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:37,712 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [21531#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (= (select queue (+ 14 front)) 5) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 21516#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 21528#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= (select queue (+ 14 front)) 5) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 21527#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= (select queue (+ 14 front)) 5) (not (= 5 (select queue back)))), 21517#(or (= (select queue (+ 14 front)) 5) (not (= 5 (select queue back)))), 21518#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ 14 front)) 5) (not (= 5 (select queue back)))), 21521#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ 14 front)) 5) (not (= 5 (select queue back)))), 21506#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 21504#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 21524#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (= (select queue (+ 14 front)) 5) (not (= 5 (select queue back)))), 21514#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 21393#(or (not (< front back)) (= (select queue front) 5)), 21505#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 21529#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (= (select queue (+ 14 front)) 5) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 21507#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 21510#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 21523#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (= (select queue (+ 14 front)) 5) (not (= 5 (select queue back)))), 21511#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 21530#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (= (select queue (+ 14 front)) 5) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 21520#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 14 front)) 5) (not (= 5 (select queue back)))), 21508#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 21525#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (= (select queue (+ 14 front)) 5) (not (= 5 (select queue back)))), 21515#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 21519#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 14 front)) 5) (not (= 5 (select queue back)))), 21526#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= (select queue (+ 14 front)) 5) (not (= 5 (select queue back)))), 21513#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 21522#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ 14 front)) 5) (not (= 5 (select queue back)))), 21509#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 21532#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 21512#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front))))] [2022-03-15 21:41:37,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 21:41:37,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:37,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 21:41:37,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1814, Invalid=9528, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 21:41:37,714 INFO L87 Difference]: Start difference. First operand 461 states and 958 transitions. Second operand has 63 states, 62 states have (on average 1.8225806451612903) internal successors, (113), 62 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have 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:41:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:40,147 INFO L93 Difference]: Finished difference Result 948 states and 1856 transitions. [2022-03-15 21:41:40,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 21:41:40,147 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 1.8225806451612903) internal successors, (113), 62 states have internal predecessors, (113), 0 states have call successors, (0), 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 38 [2022-03-15 21:41:40,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:40,149 INFO L225 Difference]: With dead ends: 948 [2022-03-15 21:41:40,149 INFO L226 Difference]: Without dead ends: 584 [2022-03-15 21:41:40,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3077 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3283, Invalid=15349, Unknown=0, NotChecked=0, Total=18632 [2022-03-15 21:41:40,150 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 1276 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 2315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:40,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1276 Valid, 905 Invalid, 2315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1950 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:41:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-03-15 21:41:40,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 90. [2022-03-15 21:41:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.9662921348314606) internal successors, (175), 89 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have 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:41:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 175 transitions. [2022-03-15 21:41:40,155 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 175 transitions. Word has length 38 [2022-03-15 21:41:40,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:40,155 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 175 transitions. [2022-03-15 21:41:40,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 1.8225806451612903) internal successors, (113), 62 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have 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:41:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 175 transitions. [2022-03-15 21:41:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-15 21:41:40,155 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:40,156 INFO L514 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:40,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 21:41:40,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:40,367 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:40,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash -498150045, now seen corresponding path program 30 times [2022-03-15 21:41:40,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:40,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584442607] [2022-03-15 21:41:40,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:40,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:40,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:40,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584442607] [2022-03-15 21:41:40,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584442607] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:40,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567668589] [2022-03-15 21:41:40,553 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:41:40,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:40,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:40,554 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:41:40,584 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:41:40,601 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-03-15 21:41:40,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:40,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 21:41:40,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:40,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:40,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567668589] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:40,749 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:40,749 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 18 [2022-03-15 21:41:40,749 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1944912802] [2022-03-15 21:41:40,749 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:40,754 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:40,767 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 139 transitions. [2022-03-15 21:41:40,767 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:40,834 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 6 treesize of output 4 [2022-03-15 21:41:40,842 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 6 treesize of output 4 [2022-03-15 21:41:40,849 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 6 treesize of output 4 [2022-03-15 21:41:40,908 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 6 treesize of output 4 [2022-03-15 21:41:40,916 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 6 treesize of output 4 [2022-03-15 21:41:40,923 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 6 treesize of output 4 [2022-03-15 21:41:40,930 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 6 treesize of output 4 [2022-03-15 21:41:40,938 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 6 treesize of output 4 [2022-03-15 21:41:40,946 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 6 treesize of output 4 [2022-03-15 21:41:40,953 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 6 treesize of output 4 [2022-03-15 21:41:40,961 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 6 treesize of output 4 [2022-03-15 21:41:40,968 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 6 treesize of output 4 [2022-03-15 21:41:40,976 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 6 treesize of output 4 [2022-03-15 21:41:40,983 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 6 treesize of output 4 [2022-03-15 21:41:40,989 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 6 treesize of output 4 [2022-03-15 21:41:40,992 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:41:40,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:41:40,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:40,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:41:40,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2022-03-15 21:41:40,993 INFO L87 Difference]: Start difference. First operand 90 states and 175 transitions. Second operand has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 18 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:41:41,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:41,086 INFO L93 Difference]: Finished difference Result 628 states and 1213 transitions. [2022-03-15 21:41:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 21:41:41,087 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 18 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 39 [2022-03-15 21:41:41,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:41,089 INFO L225 Difference]: With dead ends: 628 [2022-03-15 21:41:41,089 INFO L226 Difference]: Without dead ends: 595 [2022-03-15 21:41:41,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2022-03-15 21:41:41,089 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 127 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:41,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 73 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:41:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-03-15 21:41:41,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 515. [2022-03-15 21:41:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 2.0797665369649807) internal successors, (1069), 514 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have 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:41:41,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1069 transitions. [2022-03-15 21:41:41,098 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1069 transitions. Word has length 39 [2022-03-15 21:41:41,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:41,098 INFO L470 AbstractCegarLoop]: Abstraction has 515 states and 1069 transitions. [2022-03-15 21:41:41,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 18 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:41:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1069 transitions. [2022-03-15 21:41:41,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-15 21:41:41,099 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:41,099 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:41,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 21:41:41,321 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,SelfDestructingSolverStorable31 [2022-03-15 21:41:41,321 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:41,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:41,322 INFO L85 PathProgramCache]: Analyzing trace with hash 914654562, now seen corresponding path program 31 times [2022-03-15 21:41:41,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:41,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054383260] [2022-03-15 21:41:41,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:41,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:41,952 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:41,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054383260] [2022-03-15 21:41:41,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054383260] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:41,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049926930] [2022-03-15 21:41:41,952 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:41:41,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:41,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:41,954 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:41:41,954 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:41:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:41,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-15 21:41:41,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:42,100 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 11 treesize of output 7 [2022-03-15 21:41:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:42,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:42,157 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:41:42,157 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 14 treesize of output 13 [2022-03-15 21:41:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:42,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049926930] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:42,229 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:42,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 33 [2022-03-15 21:41:42,229 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [546401919] [2022-03-15 21:41:42,229 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:42,232 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:42,247 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 142 transitions. [2022-03-15 21:41:42,248 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:44,510 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [24926#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 24909#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 24897#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 15))) (not (= 5 (select queue back)))), 24910#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 24895#(or (= 5 (select queue (+ front 15))) (not (= 5 (select queue back)))), 24915#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 24925#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 24898#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 15))) (not (= 5 (select queue back)))), 24896#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ front 15))) (not (= 5 (select queue back)))), 24903#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (= 5 (select queue (+ front 15))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 24905#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 24922#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 15))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 24917#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 24902#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 15))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 24913#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 24918#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 15))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 24904#(or (= (select queue front) 5) (<= back front)), 24924#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 15))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 24923#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 15))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 24899#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 15))) (not (= 5 (select queue back)))), 24911#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 24900#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 15))) (not (= 5 (select queue back)))), 24914#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 24908#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 24916#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 24906#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 24912#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 24920#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 15))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 24919#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 15))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 24901#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 15))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 24921#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 15))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 24907#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front))))] [2022-03-15 21:41:44,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-03-15 21:41:44,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:44,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-03-15 21:41:44,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=555, Invalid=3867, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 21:41:44,512 INFO L87 Difference]: Start difference. First operand 515 states and 1069 transitions. Second operand has 67 states, 66 states have (on average 1.8181818181818181) internal successors, (120), 66 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have 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:41:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:46,758 INFO L93 Difference]: Finished difference Result 1058 states and 2074 transitions. [2022-03-15 21:41:46,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:41:46,758 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 1.8181818181818181) internal successors, (120), 66 states have internal predecessors, (120), 0 states have call successors, (0), 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 40 [2022-03-15 21:41:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:46,760 INFO L225 Difference]: With dead ends: 1058 [2022-03-15 21:41:46,760 INFO L226 Difference]: Without dead ends: 654 [2022-03-15 21:41:46,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1707, Invalid=7995, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 21:41:46,761 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 1463 mSDsluCounter, 2241 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1463 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 2539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 2098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:46,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1463 Valid, 983 Invalid, 2539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 2098 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:41:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-03-15 21:41:46,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 95. [2022-03-15 21:41:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.9680851063829787) internal successors, (185), 94 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have 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:41:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 185 transitions. [2022-03-15 21:41:46,766 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 185 transitions. Word has length 40 [2022-03-15 21:41:46,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:46,766 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 185 transitions. [2022-03-15 21:41:46,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 1.8181818181818181) internal successors, (120), 66 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have 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:41:46,766 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 185 transitions. [2022-03-15 21:41:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-15 21:41:46,766 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:46,766 INFO L514 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:46,791 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:41:46,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:46,983 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:46,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:46,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1709735849, now seen corresponding path program 32 times [2022-03-15 21:41:46,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:46,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978380268] [2022-03-15 21:41:46,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:46,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:47,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:47,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978380268] [2022-03-15 21:41:47,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978380268] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:47,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287713667] [2022-03-15 21:41:47,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:41:47,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:47,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:47,191 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:41:47,192 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:41:47,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:41:47,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:47,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 21:41:47,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:47,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:47,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287713667] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:47,446 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:47,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 19 [2022-03-15 21:41:47,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [546686667] [2022-03-15 21:41:47,447 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:47,451 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:47,465 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 147 transitions. [2022-03-15 21:41:47,465 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:47,533 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 6 treesize of output 4 [2022-03-15 21:41:47,540 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 6 treesize of output 4 [2022-03-15 21:41:47,548 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 6 treesize of output 4 [2022-03-15 21:41:47,556 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 6 treesize of output 4 [2022-03-15 21:41:47,567 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 6 treesize of output 4 [2022-03-15 21:41:47,577 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 6 treesize of output 4 [2022-03-15 21:41:47,585 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 6 treesize of output 4 [2022-03-15 21:41:47,592 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 6 treesize of output 4 [2022-03-15 21:41:47,601 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 6 treesize of output 4 [2022-03-15 21:41:47,609 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 6 treesize of output 4 [2022-03-15 21:41:47,617 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 6 treesize of output 4 [2022-03-15 21:41:47,624 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 6 treesize of output 4 [2022-03-15 21:41:47,632 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 6 treesize of output 4 [2022-03-15 21:41:47,696 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 6 treesize of output 4 [2022-03-15 21:41:47,704 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 6 treesize of output 4 [2022-03-15 21:41:47,711 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 6 treesize of output 4 [2022-03-15 21:41:47,717 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:41:47,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 21:41:47,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:47,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 21:41:47,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:41:47,718 INFO L87 Difference]: Start difference. First operand 95 states and 185 transitions. Second operand has 20 states, 20 states have (on average 4.6) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:41:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:47,819 INFO L93 Difference]: Finished difference Result 692 states and 1339 transitions. [2022-03-15 21:41:47,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 21:41:47,819 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 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 41 [2022-03-15 21:41:47,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:47,821 INFO L225 Difference]: With dead ends: 692 [2022-03-15 21:41:47,821 INFO L226 Difference]: Without dead ends: 657 [2022-03-15 21:41:47,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:41:47,821 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 196 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:47,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 76 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:41:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2022-03-15 21:41:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 572. [2022-03-15 21:41:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 2.0770577933450087) internal successors, (1186), 571 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have 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:41:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1186 transitions. [2022-03-15 21:41:47,829 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1186 transitions. Word has length 41 [2022-03-15 21:41:47,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:47,830 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 1186 transitions. [2022-03-15 21:41:47,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:41:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1186 transitions. [2022-03-15 21:41:47,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 21:41:47,831 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:47,831 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:47,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 21:41:48,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:48,032 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:48,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:48,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1214174058, now seen corresponding path program 33 times [2022-03-15 21:41:48,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:48,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410559347] [2022-03-15 21:41:48,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:48,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:48,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:48,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410559347] [2022-03-15 21:41:48,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410559347] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:48,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260097402] [2022-03-15 21:41:48,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:41:48,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:48,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:48,695 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:41:48,696 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:41:48,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-03-15 21:41:48,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:48,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 21:41:48,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:48,874 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 11 treesize of output 7 [2022-03-15 21:41:48,880 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:48,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:48,931 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:41:48,931 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 14 treesize of output 13 [2022-03-15 21:41:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:49,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260097402] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:49,012 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:49,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 35 [2022-03-15 21:41:49,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1597373422] [2022-03-15 21:41:49,012 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:49,016 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:49,031 INFO L252 McrAutomatonBuilder]: Finished intersection with 97 states and 150 transitions. [2022-03-15 21:41:49,031 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:51,718 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [28624#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 16 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 28621#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 16 front))) (not (= 5 (select queue back)))), 28623#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 16 front))) (not (= 5 (select queue back)))), 28649#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 28629#(or (= (select queue front) 5) (<= back front)), 28622#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 16 front))) (not (= 5 (select queue back)))), 28641#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 28626#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 16 front))) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 28628#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 16 front))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 28647#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (= 5 (select queue (+ 16 front))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 28644#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 16 front))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 28634#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 28638#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 28620#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 16 front))) (not (= 5 (select queue back)))), 28627#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 16 front))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 28619#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ 16 front))) (not (= 5 (select queue back)))), 28631#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 28632#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 28642#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 28630#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 28618#(or (= 5 (select queue (+ 16 front))) (not (= 5 (select queue back)))), 28651#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (= 5 (select queue (+ 16 front))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 28640#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 28646#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (= 5 (select queue (+ 16 front))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 28635#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 28639#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 28648#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (= 5 (select queue (+ 16 front))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 28650#(or (= 5 (select queue (+ 16 front))) (<= back (+ 16 front))), 28645#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 16 front))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 28636#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 28633#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 28625#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 16 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 28643#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 28637#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8)))] [2022-03-15 21:41:51,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-03-15 21:41:51,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:51,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-03-15 21:41:51,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=4355, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 21:41:51,719 INFO L87 Difference]: Start difference. First operand 572 states and 1186 transitions. Second operand has 71 states, 70 states have (on average 1.8142857142857143) internal successors, (127), 70 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have 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:41:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:54,285 INFO L93 Difference]: Finished difference Result 1174 states and 2304 transitions. [2022-03-15 21:41:54,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 21:41:54,285 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 1.8142857142857143) internal successors, (127), 70 states have internal predecessors, (127), 0 states have call successors, (0), 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 42 [2022-03-15 21:41:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:54,287 INFO L225 Difference]: With dead ends: 1174 [2022-03-15 21:41:54,287 INFO L226 Difference]: Without dead ends: 728 [2022-03-15 21:41:54,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1907, Invalid=9013, Unknown=0, NotChecked=0, Total=10920 [2022-03-15 21:41:54,288 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 1395 mSDsluCounter, 2560 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:54,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1395 Valid, 1130 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 21:41:54,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-03-15 21:41:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 100. [2022-03-15 21:41:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.9696969696969697) internal successors, (195), 99 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have 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:41:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 195 transitions. [2022-03-15 21:41:54,292 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 195 transitions. Word has length 42 [2022-03-15 21:41:54,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:54,292 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 195 transitions. [2022-03-15 21:41:54,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 1.8142857142857143) internal successors, (127), 70 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have 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:41:54,292 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 195 transitions. [2022-03-15 21:41:54,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-15 21:41:54,293 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:54,293 INFO L514 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:54,323 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 21:41:54,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,SelfDestructingSolverStorable34 [2022-03-15 21:41:54,515 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:54,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1016053667, now seen corresponding path program 34 times [2022-03-15 21:41:54,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:54,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952182250] [2022-03-15 21:41:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:54,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:54,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:54,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952182250] [2022-03-15 21:41:54,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952182250] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:54,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778434180] [2022-03-15 21:41:54,736 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:41:54,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:54,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:54,737 INFO L229 MonitoredProcess]: Starting monitored process 35 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:41:54,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 21:41:54,774 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:41:54,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:54,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 21:41:54,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:54,851 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:54,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:54,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778434180] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:54,935 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:54,935 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 20 [2022-03-15 21:41:54,935 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [313794654] [2022-03-15 21:41:54,935 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:54,941 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:54,962 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 155 transitions. [2022-03-15 21:41:54,962 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:55,071 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 6 treesize of output 4 [2022-03-15 21:41:55,082 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 6 treesize of output 4 [2022-03-15 21:41:55,091 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 6 treesize of output 4 [2022-03-15 21:41:55,103 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 6 treesize of output 4 [2022-03-15 21:41:55,114 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 6 treesize of output 4 [2022-03-15 21:41:55,124 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 6 treesize of output 4 [2022-03-15 21:41:55,135 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 6 treesize of output 4 [2022-03-15 21:41:55,146 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 6 treesize of output 4 [2022-03-15 21:41:55,155 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 6 treesize of output 4 [2022-03-15 21:41:55,215 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 6 treesize of output 4 [2022-03-15 21:41:55,224 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 6 treesize of output 4 [2022-03-15 21:41:55,232 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 6 treesize of output 4 [2022-03-15 21:41:55,239 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 6 treesize of output 4 [2022-03-15 21:41:55,247 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 6 treesize of output 4 [2022-03-15 21:41:55,255 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 6 treesize of output 4 [2022-03-15 21:41:55,264 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 6 treesize of output 4 [2022-03-15 21:41:55,270 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 6 treesize of output 4 [2022-03-15 21:41:55,279 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:41:55,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 21:41:55,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:55,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 21:41:55,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:41:55,282 INFO L87 Difference]: Start difference. First operand 100 states and 195 transitions. Second operand has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 20 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:55,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:55,397 INFO L93 Difference]: Finished difference Result 759 states and 1471 transitions. [2022-03-15 21:41:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 21:41:55,397 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 20 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-03-15 21:41:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:55,399 INFO L225 Difference]: With dead ends: 759 [2022-03-15 21:41:55,399 INFO L226 Difference]: Without dead ends: 722 [2022-03-15 21:41:55,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:41:55,400 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 111 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:55,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 102 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:41:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2022-03-15 21:41:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 632. [2022-03-15 21:41:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 2.074484944532488) internal successors, (1309), 631 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have 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:41:55,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1309 transitions. [2022-03-15 21:41:55,408 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1309 transitions. Word has length 43 [2022-03-15 21:41:55,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:55,408 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 1309 transitions. [2022-03-15 21:41:55,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 20 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:55,409 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1309 transitions. [2022-03-15 21:41:55,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:41:55,410 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:55,410 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:55,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 21:41:55,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 21:41:55,627 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:55,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:55,628 INFO L85 PathProgramCache]: Analyzing trace with hash 509564962, now seen corresponding path program 35 times [2022-03-15 21:41:55,628 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:55,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479481750] [2022-03-15 21:41:55,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:55,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:56,337 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:56,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479481750] [2022-03-15 21:41:56,337 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479481750] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:56,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704683259] [2022-03-15 21:41:56,337 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:41:56,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:56,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:56,339 INFO L229 MonitoredProcess]: Starting monitored process 36 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:41:56,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 21:41:56,382 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-03-15 21:41:56,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:56,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 21:41:56,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:58,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:41:58,126 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 7 [2022-03-15 21:41:58,134 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 153 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:58,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:59,623 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:41:59,623 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 12 treesize of output 11 [2022-03-15 21:41:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 136 proven. 206 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:59,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704683259] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:59,658 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:59,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 91 [2022-03-15 21:41:59,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [714289671] [2022-03-15 21:41:59,658 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:59,664 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:59,680 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 158 transitions. [2022-03-15 21:41:59,680 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:03,628 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [32741#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 32753#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 32745#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 32748#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 32771#(or (= 5 (select queue (+ 16 front))) (<= back (+ 16 front))), 32743#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 32765#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 17))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 32772#(or (<= back (+ front 17)) (= 5 (select queue (+ front 17)))), 32774#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (= 5 (select queue (+ front 17))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 32758#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 17))) (not (= 5 (select queue back)))), 32769#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (= 5 (select queue (+ front 17))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 32755#(or (= 5 (select queue (+ front 17))) (not (= 5 (select queue back)))), 32757#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 17))) (not (= 5 (select queue back)))), 32752#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 32609#(or (not (< front back)) (= (select queue front) 5)), 32763#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 17))) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 32746#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 32750#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 32760#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 17))) (not (= 5 (select queue back)))), 32775#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (= 5 (select queue (+ front 17))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 32747#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 32761#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 17))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 32766#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 17))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 32756#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ front 17))) (not (= 5 (select queue back)))), 32768#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 17))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 32767#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 17))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 32751#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 32759#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 17))) (not (= 5 (select queue back)))), 32749#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 32770#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 32742#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 32744#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 32762#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 17))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 32764#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 17))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 32754#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 32773#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (= 5 (select queue (+ front 17))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5)))] [2022-03-15 21:42:03,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-03-15 21:42:03,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:03,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-03-15 21:42:03,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2555, Invalid=13701, Unknown=0, NotChecked=0, Total=16256 [2022-03-15 21:42:03,631 INFO L87 Difference]: Start difference. First operand 632 states and 1309 transitions. Second operand has 75 states, 74 states have (on average 1.8108108108108107) internal successors, (134), 74 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have 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:42:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:07,233 INFO L93 Difference]: Finished difference Result 1296 states and 2546 transitions. [2022-03-15 21:42:07,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 21:42:07,234 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.8108108108108107) internal successors, (134), 74 states have internal predecessors, (134), 0 states have call successors, (0), 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 44 [2022-03-15 21:42:07,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:07,236 INFO L225 Difference]: With dead ends: 1296 [2022-03-15 21:42:07,236 INFO L226 Difference]: Without dead ends: 806 [2022-03-15 21:42:07,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4475 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=4642, Invalid=22090, Unknown=0, NotChecked=0, Total=26732 [2022-03-15 21:42:07,238 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 1478 mSDsluCounter, 3194 mSDsCounter, 0 mSdLazyCounter, 2903 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 3422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 2903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:07,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1478 Valid, 1399 Invalid, 3422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 2903 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 21:42:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-03-15 21:42:07,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 105. [2022-03-15 21:42:07,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.9711538461538463) internal successors, (205), 104 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have 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:42:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 205 transitions. [2022-03-15 21:42:07,242 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 205 transitions. Word has length 44 [2022-03-15 21:42:07,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:07,243 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 205 transitions. [2022-03-15 21:42:07,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 1.8108108108108107) internal successors, (134), 74 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have 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:42:07,243 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 205 transitions. [2022-03-15 21:42:07,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 21:42:07,243 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:07,243 INFO L514 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:07,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 21:42:07,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 21:42:07,466 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:42:07,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:07,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1382611561, now seen corresponding path program 36 times [2022-03-15 21:42:07,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:07,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083796555] [2022-03-15 21:42:07,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:07,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:07,684 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:07,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083796555] [2022-03-15 21:42:07,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083796555] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:07,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754015077] [2022-03-15 21:42:07,684 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:42:07,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:07,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:07,688 INFO L229 MonitoredProcess]: Starting monitored process 37 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:42:07,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 21:42:07,728 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-03-15 21:42:07,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:07,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-15 21:42:07,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:07,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:07,884 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:07,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754015077] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:07,885 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:07,885 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 21 [2022-03-15 21:42:07,885 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1165173799] [2022-03-15 21:42:07,885 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:07,897 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:07,915 INFO L252 McrAutomatonBuilder]: Finished intersection with 105 states and 163 transitions. [2022-03-15 21:42:07,915 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:07,989 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 6 treesize of output 4 [2022-03-15 21:42:07,996 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 6 treesize of output 4 [2022-03-15 21:42:08,065 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 6 treesize of output 4 [2022-03-15 21:42:08,071 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 6 treesize of output 4 [2022-03-15 21:42:08,079 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 6 treesize of output 4 [2022-03-15 21:42:08,087 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 6 treesize of output 4 [2022-03-15 21:42:08,094 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 6 treesize of output 4 [2022-03-15 21:42:08,102 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 6 treesize of output 4 [2022-03-15 21:42:08,109 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 6 treesize of output 4 [2022-03-15 21:42:08,116 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 6 treesize of output 4 [2022-03-15 21:42:08,124 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 6 treesize of output 4 [2022-03-15 21:42:08,132 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 6 treesize of output 4 [2022-03-15 21:42:08,152 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 6 treesize of output 4 [2022-03-15 21:42:08,161 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 6 treesize of output 4 [2022-03-15 21:42:08,170 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 6 treesize of output 4 [2022-03-15 21:42:08,178 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 6 treesize of output 4 [2022-03-15 21:42:08,186 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 6 treesize of output 4 [2022-03-15 21:42:08,193 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 6 treesize of output 4 [2022-03-15 21:42:08,196 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:42:08,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 21:42:08,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:08,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 21:42:08,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2022-03-15 21:42:08,197 INFO L87 Difference]: Start difference. First operand 105 states and 205 transitions. Second operand has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:08,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:08,315 INFO L93 Difference]: Finished difference Result 829 states and 1609 transitions. [2022-03-15 21:42:08,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 21:42:08,316 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-03-15 21:42:08,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:08,318 INFO L225 Difference]: With dead ends: 829 [2022-03-15 21:42:08,318 INFO L226 Difference]: Without dead ends: 790 [2022-03-15 21:42:08,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2022-03-15 21:42:08,318 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 157 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:08,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 112 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:42:08,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2022-03-15 21:42:08,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 695. [2022-03-15 21:42:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 2.0720461095100866) internal successors, (1438), 694 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have 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:42:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1438 transitions. [2022-03-15 21:42:08,326 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1438 transitions. Word has length 45 [2022-03-15 21:42:08,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:08,326 INFO L470 AbstractCegarLoop]: Abstraction has 695 states and 1438 transitions. [2022-03-15 21:42:08,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:08,326 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1438 transitions. [2022-03-15 21:42:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-15 21:42:08,327 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:08,327 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:08,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 21:42:08,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:08,534 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:42:08,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:08,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1508014678, now seen corresponding path program 37 times [2022-03-15 21:42:08,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:08,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657279141] [2022-03-15 21:42:08,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:09,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:09,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657279141] [2022-03-15 21:42:09,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657279141] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:09,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421439014] [2022-03-15 21:42:09,302 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:42:09,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:09,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:09,303 INFO L229 MonitoredProcess]: Starting monitored process 38 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:42:09,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 21:42:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:09,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 79 conjunts are in the unsatisfiable core [2022-03-15 21:42:09,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:09,470 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 11 treesize of output 7 [2022-03-15 21:42:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:09,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:09,529 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:42:09,530 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 14 treesize of output 13 [2022-03-15 21:42:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:09,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421439014] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:09,615 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:09,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 39 [2022-03-15 21:42:09,616 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1094548791] [2022-03-15 21:42:09,616 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:09,620 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:09,651 INFO L252 McrAutomatonBuilder]: Finished intersection with 107 states and 166 transitions. [2022-03-15 21:42:09,651 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:12,897 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 38 new interpolants: [37193#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 37200#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 37176#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 18))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 37183#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (= 5 (select queue (+ front 18))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 37185#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (= 5 (select queue (+ front 18))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 37189#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 37198#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 37180#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 18))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 37202#(or (= 5 (select queue (+ 16 front))) (<= back (+ 16 front))), 37192#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 37186#(or (= (select queue front) 5) (<= back front)), 37191#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 37171#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ front 18))) (not (= 5 (select queue back)))), 37195#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 37181#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 18))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 37199#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 37194#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 37207#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (= 5 (select queue (+ front 18))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 37188#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 37173#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 18))) (not (= 5 (select queue back)))), 37170#(or (= 5 (select queue (+ front 18))) (not (= 5 (select queue back)))), 37187#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 37206#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (= 5 (select queue (+ front 18))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 37197#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 37178#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 18))) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 37184#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (= 5 (select queue (+ front 18))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 37182#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 18))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 37179#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 18))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 37174#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 18))) (not (= 5 (select queue back)))), 37172#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 18))) (not (= 5 (select queue back)))), 37203#(or (<= back (+ front 17)) (= 5 (select queue (+ front 17)))), 37175#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 18))) (not (= 5 (select queue back)))), 37190#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 37201#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 37205#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (= 5 (select queue (+ front 18))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 37196#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 37177#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 18))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 37204#(or (= 5 (select queue (+ front 18))) (<= back (+ front 18)))] [2022-03-15 21:42:12,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-03-15 21:42:12,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:12,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-03-15 21:42:12,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=5418, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 21:42:12,899 INFO L87 Difference]: Start difference. First operand 695 states and 1438 transitions. Second operand has 79 states, 78 states have (on average 1.8076923076923077) internal successors, (141), 78 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have 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:42:16,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:16,066 INFO L93 Difference]: Finished difference Result 1424 states and 2800 transitions. [2022-03-15 21:42:16,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 21:42:16,066 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 78 states have (on average 1.8076923076923077) internal successors, (141), 78 states have internal predecessors, (141), 0 states have call successors, (0), 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 46 [2022-03-15 21:42:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:16,069 INFO L225 Difference]: With dead ends: 1424 [2022-03-15 21:42:16,069 INFO L226 Difference]: Without dead ends: 888 [2022-03-15 21:42:16,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2340, Invalid=11232, Unknown=0, NotChecked=0, Total=13572 [2022-03-15 21:42:16,070 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 1666 mSDsluCounter, 3183 mSDsCounter, 0 mSdLazyCounter, 2909 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1666 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 3425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 2909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:16,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1666 Valid, 1396 Invalid, 3425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 2909 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 21:42:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2022-03-15 21:42:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 110. [2022-03-15 21:42:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.9724770642201834) internal successors, (215), 109 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have 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:42:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 215 transitions. [2022-03-15 21:42:16,075 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 215 transitions. Word has length 46 [2022-03-15 21:42:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:16,075 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 215 transitions. [2022-03-15 21:42:16,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 1.8076923076923077) internal successors, (141), 78 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have 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:42:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 215 transitions. [2022-03-15 21:42:16,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-15 21:42:16,076 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:16,076 INFO L514 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:16,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 21:42:16,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 21:42:16,287 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:42:16,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash -495441437, now seen corresponding path program 38 times [2022-03-15 21:42:16,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:16,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014061742] [2022-03-15 21:42:16,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:16,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:16,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:16,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014061742] [2022-03-15 21:42:16,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014061742] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:16,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004863553] [2022-03-15 21:42:16,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:42:16,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:16,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:16,518 INFO L229 MonitoredProcess]: Starting monitored process 39 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:42:16,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 21:42:16,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:42:16,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:16,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 21:42:16,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:16,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:16,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004863553] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:16,720 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:16,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 22 [2022-03-15 21:42:16,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [711668146] [2022-03-15 21:42:16,720 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:16,724 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:16,744 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 171 transitions. [2022-03-15 21:42:16,744 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:16,879 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 6 treesize of output 4 [2022-03-15 21:42:16,887 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 6 treesize of output 4 [2022-03-15 21:42:16,895 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 6 treesize of output 4 [2022-03-15 21:42:16,902 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 6 treesize of output 4 [2022-03-15 21:42:16,909 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 6 treesize of output 4 [2022-03-15 21:42:16,917 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 6 treesize of output 4 [2022-03-15 21:42:16,926 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 6 treesize of output 4 [2022-03-15 21:42:16,936 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 6 treesize of output 4 [2022-03-15 21:42:16,945 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 6 treesize of output 4 [2022-03-15 21:42:16,952 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 6 treesize of output 4 [2022-03-15 21:42:16,959 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 6 treesize of output 4 [2022-03-15 21:42:16,967 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 6 treesize of output 4 [2022-03-15 21:42:16,975 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 6 treesize of output 4 [2022-03-15 21:42:16,982 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 6 treesize of output 4 [2022-03-15 21:42:16,989 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 6 treesize of output 4 [2022-03-15 21:42:16,997 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 6 treesize of output 4 [2022-03-15 21:42:17,004 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 6 treesize of output 4 [2022-03-15 21:42:17,012 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 6 treesize of output 4 [2022-03-15 21:42:17,018 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 6 treesize of output 4 [2022-03-15 21:42:17,027 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:42:17,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:42:17,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:17,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:42:17,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:42:17,028 INFO L87 Difference]: Start difference. First operand 110 states and 215 transitions. Second operand has 23 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 22 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have 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:42:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:17,157 INFO L93 Difference]: Finished difference Result 902 states and 1753 transitions. [2022-03-15 21:42:17,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 21:42:17,158 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 22 states have internal predecessors, (107), 0 states have call successors, (0), 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 47 [2022-03-15 21:42:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:17,160 INFO L225 Difference]: With dead ends: 902 [2022-03-15 21:42:17,160 INFO L226 Difference]: Without dead ends: 861 [2022-03-15 21:42:17,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:42:17,160 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 157 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:17,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 127 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:42:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2022-03-15 21:42:17,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 761. [2022-03-15 21:42:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 760 states have (on average 2.069736842105263) internal successors, (1573), 760 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have 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:42:17,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1573 transitions. [2022-03-15 21:42:17,170 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1573 transitions. Word has length 47 [2022-03-15 21:42:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:17,170 INFO L470 AbstractCegarLoop]: Abstraction has 761 states and 1573 transitions. [2022-03-15 21:42:17,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 22 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have 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:42:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1573 transitions. [2022-03-15 21:42:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-15 21:42:17,171 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:17,172 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:17,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-03-15 21:42:17,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 21:42:17,383 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:42:17,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:17,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1447466270, now seen corresponding path program 39 times [2022-03-15 21:42:17,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:17,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586415681] [2022-03-15 21:42:17,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:17,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:18,269 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:18,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:18,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586415681] [2022-03-15 21:42:18,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586415681] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:18,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140954752] [2022-03-15 21:42:18,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:42:18,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:18,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:18,271 INFO L229 MonitoredProcess]: Starting monitored process 40 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:42:18,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 21:42:18,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-03-15 21:42:18,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:18,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 83 conjunts are in the unsatisfiable core [2022-03-15 21:42:18,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:18,494 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 11 treesize of output 7 [2022-03-15 21:42:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:18,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:18,552 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:42:18,552 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 14 treesize of output 13 [2022-03-15 21:42:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:18,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140954752] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:18,640 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:18,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 41 [2022-03-15 21:42:18,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [736930516] [2022-03-15 21:42:18,640 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:18,644 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:18,664 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 174 transitions. [2022-03-15 21:42:18,664 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:22,350 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [42007#(or (<= back (+ front 17)) (= 5 (select queue (+ front 17)))), 41987#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ 19 front)) 5) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 41988#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ 19 front)) 5) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 42000#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 41991#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 42011#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (= (select queue (+ 19 front)) 5) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 41992#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 42014#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (= (select queue (+ 19 front)) 5) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 41976#(or (= (select queue (+ 19 front)) 5) (not (= 5 (select queue back)))), 41986#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ 19 front)) 5) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 41989#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (= (select queue (+ 19 front)) 5) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 42003#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 41997#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 41998#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 41983#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ 19 front)) 5) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 41978#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 19 front)) 5) (not (= 5 (select queue back)))), 42015#(or (= (select queue (+ 19 front)) 5) (<= back (+ 19 front))), 42012#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (= (select queue (+ 19 front)) 5) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 41995#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 41977#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ 19 front)) 5) (not (= 5 (select queue back)))), 42009#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (= (select queue (+ 19 front)) 5) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 41985#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ 19 front)) 5) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 42010#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (= (select queue (+ 19 front)) 5) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 41996#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 41981#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ 19 front)) 5) (not (= 5 (select queue back)))), 41982#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ 19 front)) 5) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 42013#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (= (select queue (+ 19 front)) 5) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 42002#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 42004#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 42001#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 41999#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 41980#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ 19 front)) 5) (not (= 5 (select queue back)))), 41990#(or (= (select queue front) 5) (<= back front)), 42005#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 41993#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 41984#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= (select queue (+ 19 front)) 5) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 42008#(or (= 5 (select queue (+ front 18))) (<= back (+ front 18))), 41979#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 19 front)) 5) (not (= 5 (select queue back)))), 41994#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 42006#(or (= 5 (select queue (+ 16 front))) (<= back (+ 16 front)))] [2022-03-15 21:42:22,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-03-15 21:42:22,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:22,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-03-15 21:42:22,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=813, Invalid=5993, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 21:42:22,351 INFO L87 Difference]: Start difference. First operand 761 states and 1573 transitions. Second operand has 83 states, 82 states have (on average 1.8048780487804879) internal successors, (148), 82 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have 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:42:25,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:25,893 INFO L93 Difference]: Finished difference Result 1558 states and 3066 transitions. [2022-03-15 21:42:25,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 21:42:25,893 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 1.8048780487804879) internal successors, (148), 82 states have internal predecessors, (148), 0 states have call successors, (0), 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 48 [2022-03-15 21:42:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:25,896 INFO L225 Difference]: With dead ends: 1558 [2022-03-15 21:42:25,896 INFO L226 Difference]: Without dead ends: 974 [2022-03-15 21:42:25,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 112 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1369 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2573, Invalid=12433, Unknown=0, NotChecked=0, Total=15006 [2022-03-15 21:42:25,897 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 1783 mSDsluCounter, 3346 mSDsCounter, 0 mSdLazyCounter, 3100 mSolverCounterSat, 642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 3742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 3100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:25,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1783 Valid, 1460 Invalid, 3742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 3100 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 21:42:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2022-03-15 21:42:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 115. [2022-03-15 21:42:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.9736842105263157) internal successors, (225), 114 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have 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:42:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 225 transitions. [2022-03-15 21:42:25,903 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 225 transitions. Word has length 48 [2022-03-15 21:42:25,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:25,903 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 225 transitions. [2022-03-15 21:42:25,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 1.8048780487804879) internal successors, (148), 82 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have 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:42:25,903 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 225 transitions. [2022-03-15 21:42:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 21:42:25,904 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:25,904 INFO L514 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:25,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 21:42:26,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:26,107 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:42:26,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:26,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1921037609, now seen corresponding path program 40 times [2022-03-15 21:42:26,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:26,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952697381] [2022-03-15 21:42:26,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:26,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:26,388 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:26,389 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:26,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952697381] [2022-03-15 21:42:26,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952697381] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:26,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556233977] [2022-03-15 21:42:26,389 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:42:26,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:26,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:26,390 INFO L229 MonitoredProcess]: Starting monitored process 41 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:42:26,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 21:42:26,435 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:42:26,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:26,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 21:42:26,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:26,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:26,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556233977] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:26,609 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:26,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 23 [2022-03-15 21:42:26,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [594674596] [2022-03-15 21:42:26,609 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:26,616 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:26,644 INFO L252 McrAutomatonBuilder]: Finished intersection with 115 states and 179 transitions. [2022-03-15 21:42:26,644 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:26,810 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 6 treesize of output 4 [2022-03-15 21:42:26,819 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 6 treesize of output 4 [2022-03-15 21:42:26,827 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 6 treesize of output 4 [2022-03-15 21:42:26,834 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 6 treesize of output 4 [2022-03-15 21:42:26,841 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 6 treesize of output 4 [2022-03-15 21:42:26,848 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 6 treesize of output 4 [2022-03-15 21:42:26,857 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 6 treesize of output 4 [2022-03-15 21:42:26,865 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 6 treesize of output 4 [2022-03-15 21:42:26,872 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 6 treesize of output 4 [2022-03-15 21:42:26,880 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 6 treesize of output 4 [2022-03-15 21:42:26,888 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 6 treesize of output 4 [2022-03-15 21:42:26,894 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 6 treesize of output 4 [2022-03-15 21:42:26,903 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 6 treesize of output 4 [2022-03-15 21:42:26,914 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 6 treesize of output 4 [2022-03-15 21:42:26,921 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 6 treesize of output 4 [2022-03-15 21:42:26,929 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 6 treesize of output 4 [2022-03-15 21:42:26,936 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 6 treesize of output 4 [2022-03-15 21:42:26,944 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 6 treesize of output 4 [2022-03-15 21:42:26,968 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 6 treesize of output 4 [2022-03-15 21:42:26,987 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 6 treesize of output 4 [2022-03-15 21:42:26,996 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:42:26,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:42:26,996 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:26,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:42:26,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-03-15 21:42:26,997 INFO L87 Difference]: Start difference. First operand 115 states and 225 transitions. Second operand has 24 states, 24 states have (on average 4.666666666666667) internal successors, (112), 23 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have 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:42:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:27,124 INFO L93 Difference]: Finished difference Result 978 states and 1903 transitions. [2022-03-15 21:42:27,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 21:42:27,125 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.666666666666667) internal successors, (112), 23 states have internal predecessors, (112), 0 states have call successors, (0), 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 49 [2022-03-15 21:42:27,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:27,127 INFO L225 Difference]: With dead ends: 978 [2022-03-15 21:42:27,127 INFO L226 Difference]: Without dead ends: 935 [2022-03-15 21:42:27,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-03-15 21:42:27,128 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 173 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:27,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 107 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:42:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2022-03-15 21:42:27,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 830. [2022-03-15 21:42:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 2.0675512665862485) internal successors, (1714), 829 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states have 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:42:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1714 transitions. [2022-03-15 21:42:27,139 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1714 transitions. Word has length 49 [2022-03-15 21:42:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:27,139 INFO L470 AbstractCegarLoop]: Abstraction has 830 states and 1714 transitions. [2022-03-15 21:42:27,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.666666666666667) internal successors, (112), 23 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have 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:42:27,140 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1714 transitions. [2022-03-15 21:42:27,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-15 21:42:27,141 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:27,141 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:27,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-15 21:42:27,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 21:42:27,359 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:42:27,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:27,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1988868074, now seen corresponding path program 41 times [2022-03-15 21:42:27,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:27,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30390716] [2022-03-15 21:42:27,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:27,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:28,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:28,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30390716] [2022-03-15 21:42:28,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30390716] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:28,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925493444] [2022-03-15 21:42:28,246 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:42:28,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:28,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:28,247 INFO L229 MonitoredProcess]: Starting monitored process 42 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:42:28,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 21:42:28,290 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-03-15 21:42:28,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:28,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 21:42:28,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:30,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:42:30,573 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 7 [2022-03-15 21:42:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 210 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:30,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:32,519 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:42:32,519 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 12 treesize of output 11 [2022-03-15 21:42:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 190 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:32,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925493444] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:32,559 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:32,559 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 106 [2022-03-15 21:42:32,559 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1384289790] [2022-03-15 21:42:32,559 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:32,566 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:32,588 INFO L252 McrAutomatonBuilder]: Finished intersection with 117 states and 182 transitions. [2022-03-15 21:42:32,588 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:38,080 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 42 new interpolants: [47275#(or (<= back (+ front 20)) (= 5 (select queue (+ front 20)))), 47241#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 20))) (not (= 5 (select queue back)))), 47267#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 20))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 47253#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 47265#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 20))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 47273#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 20))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 47266#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 20))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 47252#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 47238#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 20))) (not (= 5 (select queue back)))), 47254#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 47269#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 20))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 47268#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 20))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 47272#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 20))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 47260#(or (= 5 (select queue (+ front 18))) (<= back (+ front 18))), 47258#(or (= 5 (select queue (+ 16 front))) (<= back (+ 16 front))), 47240#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 20))) (not (= 5 (select queue back)))), 47264#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 20))) (not (= 5 (select queue back)))), 47249#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 47237#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ front 20))) (not (= 5 (select queue back)))), 47250#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 47262#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 20))) (not (= 5 (select queue back)))), 47259#(or (<= back (+ front 17)) (= 5 (select queue (+ front 17)))), 47248#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 47271#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 20))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 47270#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 20))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 47083#(or (not (< front back)) (= (select queue front) 5)), 47242#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 20))) (not (= 5 (select queue back)))), 47263#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 20))) (not (= 5 (select queue back)))), 47255#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 47257#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 47239#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 20))) (not (= 5 (select queue back)))), 47236#(or (= 5 (select queue (+ front 20))) (not (= 5 (select queue back)))), 47261#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 20))) (not (= 5 (select queue back)))), 47247#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 47244#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 47274#(or (= (select queue (+ 19 front)) 5) (<= back (+ 19 front))), 47276#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ front 20))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 47256#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 47251#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 47245#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 47243#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 47246#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5))] [2022-03-15 21:42:38,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-03-15 21:42:38,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:38,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-03-15 21:42:38,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3422, Invalid=18630, Unknown=0, NotChecked=0, Total=22052 [2022-03-15 21:42:38,082 INFO L87 Difference]: Start difference. First operand 830 states and 1714 transitions. Second operand has 87 states, 86 states have (on average 1.802325581395349) internal successors, (155), 86 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have 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:42:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:42,888 INFO L93 Difference]: Finished difference Result 1698 states and 3344 transitions. [2022-03-15 21:42:42,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 21:42:42,888 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 86 states have (on average 1.802325581395349) internal successors, (155), 86 states have internal predecessors, (155), 0 states have call successors, (0), 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 50 [2022-03-15 21:42:42,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:42,891 INFO L225 Difference]: With dead ends: 1698 [2022-03-15 21:42:42,891 INFO L226 Difference]: Without dead ends: 1064 [2022-03-15 21:42:42,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6141 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=6235, Invalid=30055, Unknown=0, NotChecked=0, Total=36290 [2022-03-15 21:42:42,892 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 2121 mSDsluCounter, 3529 mSDsCounter, 0 mSdLazyCounter, 3262 mSolverCounterSat, 679 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2121 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 3941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 679 IncrementalHoareTripleChecker+Valid, 3262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:42,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2121 Valid, 1542 Invalid, 3941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [679 Valid, 3262 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 21:42:42,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2022-03-15 21:42:42,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 120. [2022-03-15 21:42:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.9747899159663866) internal successors, (235), 119 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have 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:42:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 235 transitions. [2022-03-15 21:42:42,897 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 235 transitions. Word has length 50 [2022-03-15 21:42:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:42,897 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 235 transitions. [2022-03-15 21:42:42,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 86 states have (on average 1.802325581395349) internal successors, (155), 86 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have 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:42:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 235 transitions. [2022-03-15 21:42:42,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-15 21:42:42,898 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:42,898 INFO L514 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:42,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 21:42:43,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:43,104 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:42:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1524624349, now seen corresponding path program 42 times [2022-03-15 21:42:43,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:43,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45800837] [2022-03-15 21:42:43,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:43,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:43,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:43,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45800837] [2022-03-15 21:42:43,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45800837] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:43,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189046870] [2022-03-15 21:42:43,404 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:42:43,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:43,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:43,406 INFO L229 MonitoredProcess]: Starting monitored process 43 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:42:43,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 21:42:43,476 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-03-15 21:42:43,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:43,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 21:42:43,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:44,712 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-03-15 21:42:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:44,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:46,007 INFO L353 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-03-15 21:42:46,007 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 18 [2022-03-15 21:42:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 211 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:46,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189046870] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:46,048 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:46,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 44, 44] total 71 [2022-03-15 21:42:46,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [146439152] [2022-03-15 21:42:46,048 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:46,055 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:46,103 INFO L252 McrAutomatonBuilder]: Finished intersection with 120 states and 187 transitions. [2022-03-15 21:42:46,104 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:46,266 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 6 treesize of output 4 [2022-03-15 21:42:46,292 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 6 treesize of output 4 [2022-03-15 21:42:46,301 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 6 treesize of output 4 [2022-03-15 21:42:46,311 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 6 treesize of output 4 [2022-03-15 21:42:46,320 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 6 treesize of output 4 [2022-03-15 21:42:46,328 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 6 treesize of output 4 [2022-03-15 21:42:46,334 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 6 treesize of output 4 [2022-03-15 21:42:46,344 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 6 treesize of output 4 [2022-03-15 21:42:46,351 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 6 treesize of output 4 [2022-03-15 21:42:46,359 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 6 treesize of output 4 [2022-03-15 21:42:46,367 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 6 treesize of output 4 [2022-03-15 21:42:46,374 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 6 treesize of output 4 [2022-03-15 21:42:46,381 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 6 treesize of output 4 [2022-03-15 21:42:46,390 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 6 treesize of output 4 [2022-03-15 21:42:46,397 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 6 treesize of output 4 [2022-03-15 21:42:46,405 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 6 treesize of output 4 [2022-03-15 21:42:46,413 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 6 treesize of output 4 [2022-03-15 21:42:46,420 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 6 treesize of output 4 [2022-03-15 21:42:46,428 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 6 treesize of output 4 [2022-03-15 21:42:46,436 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 6 treesize of output 4 [2022-03-15 21:42:46,455 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 6 treesize of output 4 [2022-03-15 21:42:46,458 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:42:46,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:42:46,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:46,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:42:46,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1751, Invalid=3361, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 21:42:46,460 INFO L87 Difference]: Start difference. First operand 120 states and 235 transitions. Second operand has 25 states, 25 states have (on average 4.68) internal successors, (117), 24 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have 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:42:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:46,615 INFO L93 Difference]: Finished difference Result 1057 states and 2059 transitions. [2022-03-15 21:42:46,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 21:42:46,615 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.68) internal successors, (117), 24 states have internal predecessors, (117), 0 states have call successors, (0), 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 51 [2022-03-15 21:42:46,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:46,618 INFO L225 Difference]: With dead ends: 1057 [2022-03-15 21:42:46,618 INFO L226 Difference]: Without dead ends: 1012 [2022-03-15 21:42:46,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1989 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1751, Invalid=3361, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 21:42:46,619 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 197 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:46,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 125 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:42:46,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2022-03-15 21:42:46,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 902. [2022-03-15 21:42:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 2.0654827968923417) internal successors, (1861), 901 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have 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:42:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1861 transitions. [2022-03-15 21:42:46,630 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1861 transitions. Word has length 51 [2022-03-15 21:42:46,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:46,631 INFO L470 AbstractCegarLoop]: Abstraction has 902 states and 1861 transitions. [2022-03-15 21:42:46,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.68) internal successors, (117), 24 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have 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:42:46,631 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1861 transitions. [2022-03-15 21:42:46,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-15 21:42:46,632 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:46,632 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:46,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 21:42:46,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:46,855 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:42:46,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:46,855 INFO L85 PathProgramCache]: Analyzing trace with hash 2009775522, now seen corresponding path program 43 times [2022-03-15 21:42:46,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:46,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582254330] [2022-03-15 21:42:46,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:46,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:47,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:47,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582254330] [2022-03-15 21:42:47,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582254330] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:47,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908093051] [2022-03-15 21:42:47,842 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:42:47,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:47,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:47,843 INFO L229 MonitoredProcess]: Starting monitored process 44 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:42:47,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 21:42:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:47,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 91 conjunts are in the unsatisfiable core [2022-03-15 21:42:47,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:48,041 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 11 treesize of output 7 [2022-03-15 21:42:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:48,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:48,105 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:42:48,105 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 14 treesize of output 13 [2022-03-15 21:42:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:48,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908093051] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:48,205 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:48,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 45 [2022-03-15 21:42:48,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [141965249] [2022-03-15 21:42:48,205 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:48,211 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:48,244 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 190 transitions. [2022-03-15 21:42:48,244 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:52,746 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 44 new interpolants: [52894#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 52928#(or (<= back (+ 21 front)) (= 5 (select queue (+ 21 front)))), 52891#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 52916#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue back)))), 52906#(or (= 5 (select queue (+ 21 front))) (not (= 5 (select queue back)))), 52920#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 52902#(or (<= back (+ front 17)) (= 5 (select queue (+ front 17)))), 52887#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 52901#(or (= 5 (select queue (+ 16 front))) (<= back (+ 16 front))), 52918#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 52926#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 52927#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 52892#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 52903#(or (= 5 (select queue (+ front 18))) (<= back (+ front 18))), 52915#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue back)))), 52917#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 52896#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 52913#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue back)))), 52890#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 52908#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue back)))), 52912#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue back)))), 52923#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 52921#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 52907#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue back)))), 52888#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 52910#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue back)))), 52914#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue back)))), 52899#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 52889#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 52924#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 52905#(or (<= back (+ front 20)) (= 5 (select queue (+ front 20)))), 52885#(or (= (select queue front) 5) (<= back front)), 52909#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue back)))), 52922#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 52925#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 52904#(or (= (select queue (+ 19 front)) 5) (<= back (+ 19 front))), 52895#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 52897#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 52886#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 52919#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 52898#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 52900#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 52911#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 21 front))) (not (= 5 (select queue back)))), 52893#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8)))] [2022-03-15 21:42:52,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-03-15 21:42:52,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:52,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-03-15 21:42:52,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=7230, Unknown=0, NotChecked=0, Total=8190 [2022-03-15 21:42:52,748 INFO L87 Difference]: Start difference. First operand 902 states and 1861 transitions. Second operand has 91 states, 90 states have (on average 1.8) internal successors, (162), 90 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have 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:42:57,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:57,104 INFO L93 Difference]: Finished difference Result 1844 states and 3634 transitions. [2022-03-15 21:42:57,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 21:42:57,104 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 90 states have (on average 1.8) internal successors, (162), 90 states have internal predecessors, (162), 0 states have call successors, (0), 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 52 [2022-03-15 21:42:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:57,107 INFO L225 Difference]: With dead ends: 1844 [2022-03-15 21:42:57,107 INFO L226 Difference]: Without dead ends: 1158 [2022-03-15 21:42:57,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 122 SyntacticMatches, 5 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1660 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=3072, Invalid=15018, Unknown=0, NotChecked=0, Total=18090 [2022-03-15 21:42:57,108 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 2343 mSDsluCounter, 3995 mSDsCounter, 0 mSdLazyCounter, 3696 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2343 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 4468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 3696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:57,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2343 Valid, 1737 Invalid, 4468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 3696 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 21:42:57,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2022-03-15 21:42:57,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 125. [2022-03-15 21:42:57,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.9758064516129032) internal successors, (245), 124 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have 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:42:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 245 transitions. [2022-03-15 21:42:57,113 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 245 transitions. Word has length 52 [2022-03-15 21:42:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:57,113 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 245 transitions. [2022-03-15 21:42:57,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 90 states have (on average 1.8) internal successors, (162), 90 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have 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:42:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 245 transitions. [2022-03-15 21:42:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-03-15 21:42:57,114 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:57,114 INFO L514 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:57,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-03-15 21:42:57,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-03-15 21:42:57,317 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:42:57,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:57,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2120724457, now seen corresponding path program 44 times [2022-03-15 21:42:57,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:57,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888365759] [2022-03-15 21:42:57,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:57,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:57,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:57,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888365759] [2022-03-15 21:42:57,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888365759] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:57,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224370990] [2022-03-15 21:42:57,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:42:57,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:57,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:57,643 INFO L229 MonitoredProcess]: Starting monitored process 45 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:42:57,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 21:42:57,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:42:57,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:57,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 21:42:57,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:57,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:57,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224370990] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:57,906 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:57,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 25 [2022-03-15 21:42:57,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2004786454] [2022-03-15 21:42:57,906 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:57,923 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:57,948 INFO L252 McrAutomatonBuilder]: Finished intersection with 125 states and 195 transitions. [2022-03-15 21:42:57,948 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:58,102 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 6 treesize of output 4 [2022-03-15 21:42:58,109 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 6 treesize of output 4 [2022-03-15 21:42:58,116 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 6 treesize of output 4 [2022-03-15 21:42:58,123 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 6 treesize of output 4 [2022-03-15 21:42:58,131 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 6 treesize of output 4 [2022-03-15 21:42:58,138 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 6 treesize of output 4 [2022-03-15 21:42:58,149 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 6 treesize of output 4 [2022-03-15 21:42:58,156 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 6 treesize of output 4 [2022-03-15 21:42:58,164 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 6 treesize of output 4 [2022-03-15 21:42:58,172 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 6 treesize of output 4 [2022-03-15 21:42:58,179 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 6 treesize of output 4 [2022-03-15 21:42:58,186 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 6 treesize of output 4 [2022-03-15 21:42:58,193 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 6 treesize of output 4 [2022-03-15 21:42:58,200 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 6 treesize of output 4 [2022-03-15 21:42:58,208 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 6 treesize of output 4 [2022-03-15 21:42:58,215 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 6 treesize of output 4 [2022-03-15 21:42:58,223 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 6 treesize of output 4 [2022-03-15 21:42:58,230 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 6 treesize of output 4 [2022-03-15 21:42:58,238 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 6 treesize of output 4 [2022-03-15 21:42:58,245 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 6 treesize of output 4 [2022-03-15 21:42:58,252 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 6 treesize of output 4 [2022-03-15 21:42:58,265 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 6 treesize of output 4 [2022-03-15 21:42:58,268 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:42:58,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 21:42:58,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:58,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 21:42:58,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:42:58,268 INFO L87 Difference]: Start difference. First operand 125 states and 245 transitions. Second operand has 26 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 25 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:58,413 INFO L93 Difference]: Finished difference Result 1139 states and 2221 transitions. [2022-03-15 21:42:58,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 21:42:58,414 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 25 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-03-15 21:42:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:58,417 INFO L225 Difference]: With dead ends: 1139 [2022-03-15 21:42:58,417 INFO L226 Difference]: Without dead ends: 1092 [2022-03-15 21:42:58,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:42:58,418 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 174 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:58,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 135 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:42:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2022-03-15 21:42:58,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 977. [2022-03-15 21:42:58,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 2.0635245901639343) internal successors, (2014), 976 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have 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:42:58,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2014 transitions. [2022-03-15 21:42:58,431 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2014 transitions. Word has length 53 [2022-03-15 21:42:58,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:58,432 INFO L470 AbstractCegarLoop]: Abstraction has 977 states and 2014 transitions. [2022-03-15 21:42:58,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 25 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:58,432 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2014 transitions. [2022-03-15 21:42:58,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-03-15 21:42:58,433 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:58,433 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:58,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-15 21:42:58,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 21:42:58,651 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:42:58,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:58,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1413387734, now seen corresponding path program 45 times [2022-03-15 21:42:58,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:58,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485850383] [2022-03-15 21:42:58,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:58,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:59,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:59,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485850383] [2022-03-15 21:42:59,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485850383] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:59,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442573991] [2022-03-15 21:42:59,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:42:59,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:59,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:59,824 INFO L229 MonitoredProcess]: Starting monitored process 46 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:42:59,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 21:42:59,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2022-03-15 21:42:59,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:59,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 95 conjunts are in the unsatisfiable core [2022-03-15 21:42:59,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:00,027 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 11 treesize of output 7 [2022-03-15 21:43:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:00,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:00,089 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:43:00,090 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 14 treesize of output 13 [2022-03-15 21:43:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:00,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442573991] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:00,191 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:00,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 47 [2022-03-15 21:43:00,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [714042964] [2022-03-15 21:43:00,191 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:00,196 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:00,240 INFO L252 McrAutomatonBuilder]: Finished intersection with 127 states and 198 transitions. [2022-03-15 21:43:00,240 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:05,104 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 46 new interpolants: [58916#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 22 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 58953#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ 22 front))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 58924#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 22 front))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 58914#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 22 front))) (not (= 5 (select queue back)))), 58940#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 58936#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 58920#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 22 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 58909#(or (= 5 (select queue (+ 22 front))) (not (= 5 (select queue back)))), 58921#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 22 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 58945#(or (= (select queue (+ 19 front)) 5) (<= back (+ 19 front))), 58951#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ 22 front))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 58948#(or (<= back (+ 22 front)) (= 5 (select queue (+ 22 front)))), 58910#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ 22 front))) (not (= 5 (select queue back)))), 58913#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 22 front))) (not (= 5 (select queue back)))), 58915#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 22 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 58947#(or (<= back (+ 21 front)) (= 5 (select queue (+ 21 front)))), 58939#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 58938#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 58919#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 22 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 58926#(or (= (select queue front) 5) (<= back front)), 58950#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ 22 front))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 58952#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ 22 front))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 58933#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 58911#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 22 front))) (not (= 5 (select queue back)))), 58925#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (= 5 (select queue (+ 22 front))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 58941#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 58912#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 22 front))) (not (= 5 (select queue back)))), 58931#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 58923#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 22 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 58943#(or (<= back (+ front 17)) (= 5 (select queue (+ front 17)))), 58944#(or (= 5 (select queue (+ front 18))) (<= back (+ front 18))), 58942#(or (= 5 (select queue (+ 16 front))) (<= back (+ 16 front))), 58918#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 22 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 58932#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 58954#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ 22 front))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 58928#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 58927#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 58922#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 22 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 58934#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 58946#(or (<= back (+ front 20)) (= 5 (select queue (+ front 20)))), 58935#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 58917#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (= 5 (select queue (+ 22 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 58949#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ 22 front))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 58930#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 58937#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 58929#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front))))] [2022-03-15 21:43:05,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-03-15 21:43:05,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:05,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-03-15 21:43:05,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=7892, Unknown=0, NotChecked=0, Total=8930 [2022-03-15 21:43:05,105 INFO L87 Difference]: Start difference. First operand 977 states and 2014 transitions. Second operand has 95 states, 94 states have (on average 1.797872340425532) internal successors, (169), 94 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have 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:43:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:09,863 INFO L93 Difference]: Finished difference Result 1996 states and 3936 transitions. [2022-03-15 21:43:09,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 21:43:09,864 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 94 states have (on average 1.797872340425532) internal successors, (169), 94 states have internal predecessors, (169), 0 states have call successors, (0), 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 54 [2022-03-15 21:43:09,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:09,867 INFO L225 Difference]: With dead ends: 1996 [2022-03-15 21:43:09,868 INFO L226 Difference]: Without dead ends: 1256 [2022-03-15 21:43:09,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1815 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=3338, Invalid=16402, Unknown=0, NotChecked=0, Total=19740 [2022-03-15 21:43:09,874 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 2690 mSDsluCounter, 4312 mSDsCounter, 0 mSdLazyCounter, 3902 mSolverCounterSat, 791 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2690 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 4693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 791 IncrementalHoareTripleChecker+Valid, 3902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:09,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2690 Valid, 1890 Invalid, 4693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [791 Valid, 3902 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 21:43:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2022-03-15 21:43:09,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 130. [2022-03-15 21:43:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.9767441860465116) internal successors, (255), 129 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have 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:43:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 255 transitions. [2022-03-15 21:43:09,881 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 255 transitions. Word has length 54 [2022-03-15 21:43:09,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:09,881 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 255 transitions. [2022-03-15 21:43:09,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 94 states have (on average 1.797872340425532) internal successors, (169), 94 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have 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:43:09,882 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 255 transitions. [2022-03-15 21:43:09,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-03-15 21:43:09,882 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:09,882 INFO L514 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:09,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 21:43:10,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-15 21:43:10,083 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:43:10,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:10,083 INFO L85 PathProgramCache]: Analyzing trace with hash 866090595, now seen corresponding path program 46 times [2022-03-15 21:43:10,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:10,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187895852] [2022-03-15 21:43:10,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:10,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:10,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:10,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187895852] [2022-03-15 21:43:10,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187895852] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:10,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536497023] [2022-03-15 21:43:10,429 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:43:10,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:10,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:10,430 INFO L229 MonitoredProcess]: Starting monitored process 47 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:43:10,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 21:43:10,466 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:43:10,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:43:10,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 21:43:10,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:10,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:10,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536497023] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:10,661 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:10,661 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 26 [2022-03-15 21:43:10,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [355470897] [2022-03-15 21:43:10,661 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:10,666 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:10,693 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 203 transitions. [2022-03-15 21:43:10,693 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:10,786 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 6 treesize of output 4 [2022-03-15 21:43:10,794 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 6 treesize of output 4 [2022-03-15 21:43:10,802 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 6 treesize of output 4 [2022-03-15 21:43:10,808 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 6 treesize of output 4 [2022-03-15 21:43:10,816 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 6 treesize of output 4 [2022-03-15 21:43:10,824 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 6 treesize of output 4 [2022-03-15 21:43:10,831 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 6 treesize of output 4 [2022-03-15 21:43:10,838 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 6 treesize of output 4 [2022-03-15 21:43:10,845 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 6 treesize of output 4 [2022-03-15 21:43:10,853 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 6 treesize of output 4 [2022-03-15 21:43:10,875 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 6 treesize of output 4 [2022-03-15 21:43:10,882 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 6 treesize of output 4 [2022-03-15 21:43:10,892 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 6 treesize of output 4 [2022-03-15 21:43:10,901 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 6 treesize of output 4 [2022-03-15 21:43:10,909 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 6 treesize of output 4 [2022-03-15 21:43:10,920 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 6 treesize of output 4 [2022-03-15 21:43:10,929 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 6 treesize of output 4 [2022-03-15 21:43:10,938 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 6 treesize of output 4 [2022-03-15 21:43:10,947 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 6 treesize of output 4 [2022-03-15 21:43:10,957 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 6 treesize of output 4 [2022-03-15 21:43:10,976 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 6 treesize of output 4 [2022-03-15 21:43:11,075 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 6 treesize of output 4 [2022-03-15 21:43:11,083 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 6 treesize of output 4 [2022-03-15 21:43:11,087 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:43:11,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:43:11,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:11,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:43:11,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:43:11,088 INFO L87 Difference]: Start difference. First operand 130 states and 255 transitions. Second operand has 27 states, 27 states have (on average 4.703703703703703) internal successors, (127), 26 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have 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:43:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:11,249 INFO L93 Difference]: Finished difference Result 1224 states and 2389 transitions. [2022-03-15 21:43:11,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 21:43:11,250 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.703703703703703) internal successors, (127), 26 states have internal predecessors, (127), 0 states have call successors, (0), 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 55 [2022-03-15 21:43:11,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:11,253 INFO L225 Difference]: With dead ends: 1224 [2022-03-15 21:43:11,253 INFO L226 Difference]: Without dead ends: 1175 [2022-03-15 21:43:11,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:43:11,254 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 157 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:11,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 154 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:43:11,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2022-03-15 21:43:11,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1055. [2022-03-15 21:43:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 1054 states have (on average 2.0616698292220113) internal successors, (2173), 1054 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have 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:43:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 2173 transitions. [2022-03-15 21:43:11,265 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 2173 transitions. Word has length 55 [2022-03-15 21:43:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:11,266 INFO L470 AbstractCegarLoop]: Abstraction has 1055 states and 2173 transitions. [2022-03-15 21:43:11,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.703703703703703) internal successors, (127), 26 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have 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:43:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 2173 transitions. [2022-03-15 21:43:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-03-15 21:43:11,267 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:11,267 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:11,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-03-15 21:43:11,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:11,483 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:43:11,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:11,483 INFO L85 PathProgramCache]: Analyzing trace with hash -171224990, now seen corresponding path program 47 times [2022-03-15 21:43:11,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:11,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425854717] [2022-03-15 21:43:11,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:11,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:12,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:12,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425854717] [2022-03-15 21:43:12,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425854717] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:12,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340784664] [2022-03-15 21:43:12,601 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:43:12,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:12,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:12,602 INFO L229 MonitoredProcess]: Starting monitored process 48 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:43:12,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 21:43:12,655 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2022-03-15 21:43:12,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:43:12,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-15 21:43:12,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:15,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:43:15,179 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 13 treesize of output 7 [2022-03-15 21:43:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 276 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:15,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:17,584 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:43:17,584 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 14 treesize of output 13 [2022-03-15 21:43:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 190 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:17,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340784664] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:17,639 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:17,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 121 [2022-03-15 21:43:17,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2013494299] [2022-03-15 21:43:17,640 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:17,646 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:17,683 INFO L252 McrAutomatonBuilder]: Finished intersection with 132 states and 206 transitions. [2022-03-15 21:43:17,683 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:30,626 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 48 new interpolants: [65455#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 65450#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue back)))), 65481#(or (<= back (+ 21 front)) (= 5 (select queue (+ 21 front)))), 65467#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 65462#(or (<= back (+ front 17)) (= 5 (select queue (+ front 17)))), 65483#(or (<= back (+ 23 front)) (= 5 (select queue (+ 23 front)))), 65469#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 65454#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 65445#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 65480#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 65271#(or (not (< (+ front 1) back)) (= 5 (select queue (+ front 1)))), 65449#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue back)))), 65275#(or (= 5 (select queue (+ 2 front))) (not (< (+ 2 front) back))), 65446#(or (= 5 (select queue (+ 23 front))) (not (= 5 (select queue back)))), 65461#(or (= 5 (select queue (+ 16 front))) (<= back (+ 16 front))), 65474#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 65466#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 65464#(or (= (select queue (+ 19 front)) 5) (<= back (+ 19 front))), 65476#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 65443#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 65472#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 65267#(or (not (< front back)) (= (select queue front) 5)), 65448#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue back)))), 65444#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 65447#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue back)))), 65457#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 65453#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 23 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 65478#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 65468#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 65452#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 23 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 65479#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 65471#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 65477#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 65463#(or (= 5 (select queue (+ front 18))) (<= back (+ front 18))), 65475#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 65459#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 65470#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 65465#(or (<= back (+ front 20)) (= 5 (select queue (+ front 20)))), 65484#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 65456#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 65279#(or (not (< (+ 3 front) back)) (= 5 (select queue (+ 3 front)))), 65458#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 65441#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 65473#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 65442#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 65460#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 65482#(or (<= back (+ 22 front)) (= 5 (select queue (+ 22 front)))), 65451#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 23 front))) (not (= 5 (select queue back))))] [2022-03-15 21:49:30,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2022-03-15 21:49:30,627 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:30,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2022-03-15 21:49:30,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4253, Invalid=23469, Unknown=0, NotChecked=0, Total=27722 [2022-03-15 21:49:30,628 INFO L87 Difference]: Start difference. First operand 1055 states and 2173 transitions. Second operand has 99 states, 98 states have (on average 1.7959183673469388) internal successors, (176), 98 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have 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:49:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:37,158 INFO L93 Difference]: Finished difference Result 2154 states and 4250 transitions. [2022-03-15 21:49:37,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 21:49:37,159 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 98 states have (on average 1.7959183673469388) internal successors, (176), 98 states have internal predecessors, (176), 0 states have call successors, (0), 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 56 [2022-03-15 21:49:37,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:37,162 INFO L225 Difference]: With dead ends: 2154 [2022-03-15 21:49:37,162 INFO L226 Difference]: Without dead ends: 1358 [2022-03-15 21:49:37,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8167 ImplicationChecksByTransitivity, 381.3s TimeCoverageRelationStatistics Valid=7828, Invalid=38182, Unknown=0, NotChecked=0, Total=46010 [2022-03-15 21:49:37,164 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 2714 mSDsluCounter, 4806 mSDsCounter, 0 mSdLazyCounter, 4354 mSolverCounterSat, 906 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2714 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 5260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 906 IncrementalHoareTripleChecker+Valid, 4354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:37,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2714 Valid, 2099 Invalid, 5260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [906 Valid, 4354 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 21:49:37,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2022-03-15 21:49:37,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 135. [2022-03-15 21:49:37,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 134 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have 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:49:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 265 transitions. [2022-03-15 21:49:37,169 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 265 transitions. Word has length 56 [2022-03-15 21:49:37,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:37,170 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 265 transitions. [2022-03-15 21:49:37,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 98 states have (on average 1.7959183673469388) internal successors, (176), 98 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have 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:49:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 265 transitions. [2022-03-15 21:49:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-15 21:49:37,170 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:37,170 INFO L514 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:37,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:37,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-03-15 21:49:37,371 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:49:37,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1012263593, now seen corresponding path program 48 times [2022-03-15 21:49:37,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:37,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996028037] [2022-03-15 21:49:37,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:37,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:37,744 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:37,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996028037] [2022-03-15 21:49:37,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996028037] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:37,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832996886] [2022-03-15 21:49:37,744 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:49:37,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:37,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:37,746 INFO L229 MonitoredProcess]: Starting monitored process 49 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:49:37,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 21:49:37,809 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-03-15 21:49:37,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:37,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 21:49:37,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:37,918 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:37,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:38,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832996886] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:38,027 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:38,027 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 27 [2022-03-15 21:49:38,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1926970730] [2022-03-15 21:49:38,027 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:38,033 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:38,093 INFO L252 McrAutomatonBuilder]: Finished intersection with 135 states and 211 transitions. [2022-03-15 21:49:38,093 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:38,189 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 6 treesize of output 4 [2022-03-15 21:49:38,197 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 6 treesize of output 4 [2022-03-15 21:49:38,206 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 6 treesize of output 4 [2022-03-15 21:49:38,214 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 6 treesize of output 4 [2022-03-15 21:49:38,221 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 6 treesize of output 4 [2022-03-15 21:49:38,230 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 6 treesize of output 4 [2022-03-15 21:49:38,240 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 6 treesize of output 4 [2022-03-15 21:49:38,254 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 6 treesize of output 4 [2022-03-15 21:49:38,265 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 6 treesize of output 4 [2022-03-15 21:49:38,274 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 6 treesize of output 4 [2022-03-15 21:49:38,285 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 6 treesize of output 4 [2022-03-15 21:49:38,295 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 6 treesize of output 4 [2022-03-15 21:49:38,306 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 6 treesize of output 4 [2022-03-15 21:49:38,316 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 6 treesize of output 4 [2022-03-15 21:49:38,326 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 6 treesize of output 4 [2022-03-15 21:49:38,335 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 6 treesize of output 4 [2022-03-15 21:49:38,347 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 6 treesize of output 4 [2022-03-15 21:49:38,465 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 6 treesize of output 4 [2022-03-15 21:49:38,476 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 6 treesize of output 4 [2022-03-15 21:49:38,486 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 6 treesize of output 4 [2022-03-15 21:49:38,497 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 6 treesize of output 4 [2022-03-15 21:49:38,508 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 6 treesize of output 4 [2022-03-15 21:49:38,518 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 6 treesize of output 4 [2022-03-15 21:49:38,529 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 6 treesize of output 4 [2022-03-15 21:49:38,544 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:49:38,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:49:38,545 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:38,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:49:38,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:49:38,545 INFO L87 Difference]: Start difference. First operand 135 states and 265 transitions. Second operand has 28 states, 28 states have (on average 4.714285714285714) internal successors, (132), 27 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have 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:49:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:38,715 INFO L93 Difference]: Finished difference Result 1312 states and 2563 transitions. [2022-03-15 21:49:38,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 21:49:38,716 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.714285714285714) internal successors, (132), 27 states have internal predecessors, (132), 0 states have call successors, (0), 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 57 [2022-03-15 21:49:38,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:38,718 INFO L225 Difference]: With dead ends: 1312 [2022-03-15 21:49:38,718 INFO L226 Difference]: Without dead ends: 1261 [2022-03-15 21:49:38,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:49:38,718 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 181 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:38,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 148 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:49:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2022-03-15 21:49:38,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1136. [2022-03-15 21:49:38,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 1135 states have (on average 2.0599118942731276) internal successors, (2338), 1135 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states have 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:49:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 2338 transitions. [2022-03-15 21:49:38,729 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 2338 transitions. Word has length 57 [2022-03-15 21:49:38,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:38,730 INFO L470 AbstractCegarLoop]: Abstraction has 1136 states and 2338 transitions. [2022-03-15 21:49:38,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.714285714285714) internal successors, (132), 27 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have 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:49:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 2338 transitions. [2022-03-15 21:49:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-15 21:49:38,732 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:38,732 INFO L514 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:38,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:38,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-15 21:49:38,954 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:49:38,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:38,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1440128106, now seen corresponding path program 49 times [2022-03-15 21:49:38,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:38,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966175966] [2022-03-15 21:49:38,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:38,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:40,209 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:40,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:40,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966175966] [2022-03-15 21:49:40,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966175966] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:40,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445981451] [2022-03-15 21:49:40,209 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:49:40,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:40,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:40,210 INFO L229 MonitoredProcess]: Starting monitored process 50 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:49:40,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 21:49:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:40,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 103 conjunts are in the unsatisfiable core [2022-03-15 21:49:40,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:40,421 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 11 treesize of output 7 [2022-03-15 21:49:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:40,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:40,486 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:49:40,486 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 14 treesize of output 13 [2022-03-15 21:49:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:40,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445981451] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:40,596 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:40,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2022-03-15 21:49:40,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1506733918] [2022-03-15 21:49:40,596 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:40,600 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:40,632 INFO L252 McrAutomatonBuilder]: Finished intersection with 137 states and 214 transitions. [2022-03-15 21:49:40,632 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:46,484 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 50 new interpolants: [72390#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 72387#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 72386#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 72367#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 72372#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue back)))), 72382#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 72373#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue back)))), 72379#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 72392#(or (<= back (+ front 20)) (= 5 (select queue (+ front 20)))), 72354#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 72365#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 72366#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 72349#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ front 24))) (not (= 5 (select queue back)))), 72353#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 72361#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 72393#(or (<= back (+ 21 front)) (= 5 (select queue (+ 21 front)))), 72391#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 72375#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 24))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 72350#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 24))) (not (= 5 (select queue back)))), 72397#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 72381#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 72358#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 72355#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 72368#(or (= 5 (select queue (+ 16 front))) (<= back (+ 16 front))), 72374#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 24))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 72389#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 72371#(or (= (select queue (+ 19 front)) 5) (<= back (+ 19 front))), 72384#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 72352#(or (= (select queue front) 5) (<= back front)), 72359#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 72362#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 72351#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 24))) (not (= 5 (select queue back)))), 72370#(or (= 5 (select queue (+ front 18))) (<= back (+ front 18))), 72385#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 72363#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 72348#(or (= 5 (select queue (+ front 24))) (not (= 5 (select queue back)))), 72360#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 72380#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 72396#(or (= 5 (select queue (+ front 24))) (<= back (+ front 24))), 72377#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 72356#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 72369#(or (<= back (+ front 17)) (= 5 (select queue (+ front 17)))), 72395#(or (<= back (+ 23 front)) (= 5 (select queue (+ 23 front)))), 72394#(or (<= back (+ 22 front)) (= 5 (select queue (+ 22 front)))), 72364#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 72376#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 72378#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 72383#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 72388#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (= 5 (select queue (+ front 24))) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 72357#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5))] [2022-03-15 21:49:46,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-03-15 21:49:46,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:46,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-03-15 21:49:46,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1203, Invalid=9303, Unknown=0, NotChecked=0, Total=10506 [2022-03-15 21:49:46,486 INFO L87 Difference]: Start difference. First operand 1136 states and 2338 transitions. Second operand has 103 states, 102 states have (on average 1.7941176470588236) internal successors, (183), 102 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have 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:49:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:52,174 INFO L93 Difference]: Finished difference Result 2318 states and 4576 transitions. [2022-03-15 21:49:52,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 21:49:52,174 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 102 states have (on average 1.7941176470588236) internal successors, (183), 102 states have internal predecessors, (183), 0 states have call successors, (0), 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 58 [2022-03-15 21:49:52,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:52,176 INFO L225 Difference]: With dead ends: 2318 [2022-03-15 21:49:52,176 INFO L226 Difference]: Without dead ends: 1464 [2022-03-15 21:49:52,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 137 SyntacticMatches, 5 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2148 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=3903, Invalid=19353, Unknown=0, NotChecked=0, Total=23256 [2022-03-15 21:49:52,177 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 3514 mSDsluCounter, 4893 mSDsCounter, 0 mSdLazyCounter, 4443 mSolverCounterSat, 973 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3514 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 5416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 973 IncrementalHoareTripleChecker+Valid, 4443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:52,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3514 Valid, 2138 Invalid, 5416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [973 Valid, 4443 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 21:49:52,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2022-03-15 21:49:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 140. [2022-03-15 21:49:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.9784172661870503) internal successors, (275), 139 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have 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:49:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 275 transitions. [2022-03-15 21:49:52,185 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 275 transitions. Word has length 58 [2022-03-15 21:49:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:52,185 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 275 transitions. [2022-03-15 21:49:52,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 102 states have (on average 1.7941176470588236) internal successors, (183), 102 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have 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:49:52,185 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 275 transitions. [2022-03-15 21:49:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-15 21:49:52,186 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:52,186 INFO L514 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:52,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:52,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:52,407 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:49:52,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:52,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1693554525, now seen corresponding path program 50 times [2022-03-15 21:49:52,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:52,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071496854] [2022-03-15 21:49:52,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:52,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:52,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:52,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071496854] [2022-03-15 21:49:52,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071496854] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:52,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533135578] [2022-03-15 21:49:52,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:49:52,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:52,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:52,808 INFO L229 MonitoredProcess]: Starting monitored process 51 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:49:52,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-15 21:49:52,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:49:52,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:52,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-15 21:49:52,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:52,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:53,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533135578] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:53,086 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:53,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 28 [2022-03-15 21:49:53,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [316452491] [2022-03-15 21:49:53,086 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:53,093 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:53,137 INFO L252 McrAutomatonBuilder]: Finished intersection with 140 states and 219 transitions. [2022-03-15 21:49:53,137 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:53,247 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 6 treesize of output 4 [2022-03-15 21:49:53,257 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 6 treesize of output 4 [2022-03-15 21:49:53,266 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 6 treesize of output 4 [2022-03-15 21:49:53,275 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 6 treesize of output 4 [2022-03-15 21:49:53,284 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 6 treesize of output 4 [2022-03-15 21:49:53,295 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 6 treesize of output 4 [2022-03-15 21:49:53,303 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 6 treesize of output 4 [2022-03-15 21:49:53,341 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 6 treesize of output 4 [2022-03-15 21:49:53,349 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 6 treesize of output 4 [2022-03-15 21:49:53,426 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 6 treesize of output 4 [2022-03-15 21:49:53,432 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 6 treesize of output 4 [2022-03-15 21:49:53,441 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 6 treesize of output 4 [2022-03-15 21:49:53,448 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 6 treesize of output 4 [2022-03-15 21:49:53,455 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 6 treesize of output 4 [2022-03-15 21:49:53,462 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 6 treesize of output 4 [2022-03-15 21:49:53,469 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 6 treesize of output 4 [2022-03-15 21:49:53,475 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 6 treesize of output 4 [2022-03-15 21:49:53,484 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 6 treesize of output 4 [2022-03-15 21:49:53,491 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 6 treesize of output 4 [2022-03-15 21:49:53,499 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 6 treesize of output 4 [2022-03-15 21:49:53,507 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 6 treesize of output 4 [2022-03-15 21:49:53,514 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 6 treesize of output 4 [2022-03-15 21:49:53,522 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 6 treesize of output 4 [2022-03-15 21:49:53,529 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 6 treesize of output 4 [2022-03-15 21:49:53,542 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 6 treesize of output 4 [2022-03-15 21:49:53,545 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:49:53,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:49:53,545 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:53,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:49:53,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:49:53,545 INFO L87 Difference]: Start difference. First operand 140 states and 275 transitions. Second operand has 29 states, 29 states have (on average 4.724137931034483) internal successors, (137), 28 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:53,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:53,708 INFO L93 Difference]: Finished difference Result 1403 states and 2743 transitions. [2022-03-15 21:49:53,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 21:49:53,708 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.724137931034483) internal successors, (137), 28 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-03-15 21:49:53,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:53,710 INFO L225 Difference]: With dead ends: 1403 [2022-03-15 21:49:53,710 INFO L226 Difference]: Without dead ends: 1350 [2022-03-15 21:49:53,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:49:53,711 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 220 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:53,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 129 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:49:53,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2022-03-15 21:49:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1220. [2022-03-15 21:49:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 1219 states have (on average 2.058244462674323) internal successors, (2509), 1219 states have internal predecessors, (2509), 0 states have call successors, (0), 0 states have 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:49:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 2509 transitions. [2022-03-15 21:49:53,724 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 2509 transitions. Word has length 59 [2022-03-15 21:49:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:53,724 INFO L470 AbstractCegarLoop]: Abstraction has 1220 states and 2509 transitions. [2022-03-15 21:49:53,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.724137931034483) internal successors, (137), 28 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 2509 transitions. [2022-03-15 21:49:53,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-03-15 21:49:53,725 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:53,726 INFO L514 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:53,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:53,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-03-15 21:49:53,936 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:49:53,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:53,936 INFO L85 PathProgramCache]: Analyzing trace with hash -554491102, now seen corresponding path program 51 times [2022-03-15 21:49:53,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:53,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568700576] [2022-03-15 21:49:53,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:53,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:55,309 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:55,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568700576] [2022-03-15 21:49:55,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568700576] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:55,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981956054] [2022-03-15 21:49:55,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:49:55,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:55,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:55,311 INFO L229 MonitoredProcess]: Starting monitored process 52 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:49:55,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-15 21:49:55,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2022-03-15 21:49:55,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:55,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 107 conjunts are in the unsatisfiable core [2022-03-15 21:49:55,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:55,549 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 11 treesize of output 7 [2022-03-15 21:49:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:55,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:55,618 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:49:55,618 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 14 treesize of output 13 [2022-03-15 21:49:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:55,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981956054] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:55,735 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:55,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 53 [2022-03-15 21:49:55,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [708289029] [2022-03-15 21:49:55,735 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:55,740 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:55,797 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 222 transitions. [2022-03-15 21:49:55,797 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:02,255 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 52 new interpolants: [79739#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 25))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 79741#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 25))) (not (= 5 (select queue (+ 16 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 79768#(or (= (select queue (+ 19 front)) 5) (<= back (+ 19 front))), 79762#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 79751#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 79758#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 79764#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 79736#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 25))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 79753#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 79746#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 25))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 79734#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 25))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 79745#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 25))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 79761#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 79726#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ front 25))) (not (= 5 (select queue back)))), 79766#(or (<= back (+ front 17)) (= 5 (select queue (+ front 17)))), 79752#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 79755#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 79742#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 25))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 79754#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 79740#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 25))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 79743#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 25))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 79733#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (= 5 (select queue (+ front 25))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 79771#(or (<= back (+ 22 front)) (= 5 (select queue (+ 22 front)))), 79749#(or (= (select queue front) 5) (<= back front)), 79735#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 25))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 79775#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 25))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 79770#(or (<= back (+ 21 front)) (= 5 (select queue (+ 21 front)))), 79763#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 79776#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 25))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 79732#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 25))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 79757#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 79773#(or (= 5 (select queue (+ front 24))) (<= back (+ front 24))), 79738#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 25))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 79765#(or (= 5 (select queue (+ 16 front))) (<= back (+ 16 front))), 79744#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 25))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 79767#(or (= 5 (select queue (+ front 18))) (<= back (+ front 18))), 79760#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 79730#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 25))) (not (= 5 (select queue back)))), 79769#(or (<= back (+ front 20)) (= 5 (select queue (+ front 20)))), 79756#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 79731#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 25))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 79727#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 25))) (not (= 5 (select queue back)))), 79750#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 79725#(or (= 5 (select queue (+ front 25))) (not (= 5 (select queue back)))), 79772#(or (<= back (+ 23 front)) (= 5 (select queue (+ 23 front)))), 79737#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 25))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 79774#(or (<= back (+ front 25)) (= 5 (select queue (+ front 25)))), 79728#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 25))) (not (= 5 (select queue back)))), 79747#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 25))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 79729#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 25))) (not (= 5 (select queue back)))), 79759#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 79748#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 25))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5)))] [2022-03-15 21:50:02,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2022-03-15 21:50:02,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:02,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2022-03-15 21:50:02,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1290, Invalid=10052, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 21:50:02,257 INFO L87 Difference]: Start difference. First operand 1220 states and 2509 transitions. Second operand has 107 states, 106 states have (on average 1.7924528301886793) internal successors, (190), 106 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have 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:50:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:08,693 INFO L93 Difference]: Finished difference Result 2488 states and 4914 transitions. [2022-03-15 21:50:08,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 21:50:08,694 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 106 states have (on average 1.7924528301886793) internal successors, (190), 106 states have internal predecessors, (190), 0 states have call successors, (0), 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 60 [2022-03-15 21:50:08,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:08,696 INFO L225 Difference]: With dead ends: 2488 [2022-03-15 21:50:08,696 INFO L226 Difference]: Without dead ends: 1574 [2022-03-15 21:50:08,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 142 SyntacticMatches, 5 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2325 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=4202, Invalid=20920, Unknown=0, NotChecked=0, Total=25122 [2022-03-15 21:50:08,697 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 3413 mSDsluCounter, 5599 mSDsCounter, 0 mSdLazyCounter, 5102 mSolverCounterSat, 1003 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3413 SdHoareTripleChecker+Valid, 2432 SdHoareTripleChecker+Invalid, 6105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1003 IncrementalHoareTripleChecker+Valid, 5102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:08,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3413 Valid, 2432 Invalid, 6105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1003 Valid, 5102 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 21:50:08,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2022-03-15 21:50:08,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 145. [2022-03-15 21:50:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.9791666666666667) internal successors, (285), 144 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have 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:50:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 285 transitions. [2022-03-15 21:50:08,703 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 285 transitions. Word has length 60 [2022-03-15 21:50:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:08,703 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 285 transitions. [2022-03-15 21:50:08,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 106 states have (on average 1.7924528301886793) internal successors, (190), 106 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have 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:50:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 285 transitions. [2022-03-15 21:50:08,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-15 21:50:08,703 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:08,703 INFO L514 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:08,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-03-15 21:50:08,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:08,916 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:50:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:08,916 INFO L85 PathProgramCache]: Analyzing trace with hash -8611177, now seen corresponding path program 52 times [2022-03-15 21:50:08,917 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:08,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490050189] [2022-03-15 21:50:08,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:08,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:09,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:09,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490050189] [2022-03-15 21:50:09,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490050189] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:09,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978497327] [2022-03-15 21:50:09,277 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:50:09,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:09,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:09,278 INFO L229 MonitoredProcess]: Starting monitored process 53 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:50:09,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-15 21:50:09,318 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:50:09,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:09,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 21:50:09,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:09,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:09,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978497327] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:09,540 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:09,540 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 29 [2022-03-15 21:50:09,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [426359843] [2022-03-15 21:50:09,540 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:09,548 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:09,594 INFO L252 McrAutomatonBuilder]: Finished intersection with 145 states and 227 transitions. [2022-03-15 21:50:09,595 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:09,707 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 6 treesize of output 4 [2022-03-15 21:50:09,715 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 6 treesize of output 4 [2022-03-15 21:50:09,723 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 6 treesize of output 4 [2022-03-15 21:50:09,743 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 6 treesize of output 4 [2022-03-15 21:50:09,753 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 6 treesize of output 4 [2022-03-15 21:50:09,762 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 6 treesize of output 4 [2022-03-15 21:50:09,770 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 6 treesize of output 4 [2022-03-15 21:50:09,779 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 6 treesize of output 4 [2022-03-15 21:50:09,789 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 6 treesize of output 4 [2022-03-15 21:50:09,797 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 6 treesize of output 4 [2022-03-15 21:50:09,806 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 6 treesize of output 4 [2022-03-15 21:50:09,813 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 6 treesize of output 4 [2022-03-15 21:50:09,823 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 6 treesize of output 4 [2022-03-15 21:50:09,831 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 6 treesize of output 4 [2022-03-15 21:50:09,839 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 6 treesize of output 4 [2022-03-15 21:50:09,847 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 6 treesize of output 4 [2022-03-15 21:50:09,855 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 6 treesize of output 4 [2022-03-15 21:50:09,863 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 6 treesize of output 4 [2022-03-15 21:50:09,872 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 6 treesize of output 4 [2022-03-15 21:50:09,880 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 6 treesize of output 4 [2022-03-15 21:50:09,888 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 6 treesize of output 4 [2022-03-15 21:50:09,896 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 6 treesize of output 4 [2022-03-15 21:50:09,903 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 6 treesize of output 4 [2022-03-15 21:50:09,911 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 6 treesize of output 4 [2022-03-15 21:50:09,918 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 6 treesize of output 4 [2022-03-15 21:50:10,053 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 6 treesize of output 4 [2022-03-15 21:50:10,056 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:50:10,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:50:10,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:10,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:50:10,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2022-03-15 21:50:10,057 INFO L87 Difference]: Start difference. First operand 145 states and 285 transitions. Second operand has 30 states, 30 states have (on average 4.733333333333333) internal successors, (142), 29 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have 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:50:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:10,261 INFO L93 Difference]: Finished difference Result 1497 states and 2929 transitions. [2022-03-15 21:50:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 21:50:10,261 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.733333333333333) internal successors, (142), 29 states have internal predecessors, (142), 0 states have call successors, (0), 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 61 [2022-03-15 21:50:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:10,264 INFO L225 Difference]: With dead ends: 1497 [2022-03-15 21:50:10,264 INFO L226 Difference]: Without dead ends: 1442 [2022-03-15 21:50:10,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2022-03-15 21:50:10,264 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 240 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:10,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 132 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:50:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2022-03-15 21:50:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1307. [2022-03-15 21:50:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 1306 states have (on average 2.0566615620214397) internal successors, (2686), 1306 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have 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:50:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 2686 transitions. [2022-03-15 21:50:10,281 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 2686 transitions. Word has length 61 [2022-03-15 21:50:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:10,281 INFO L470 AbstractCegarLoop]: Abstraction has 1307 states and 2686 transitions. [2022-03-15 21:50:10,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.733333333333333) internal successors, (142), 29 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have 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:50:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 2686 transitions. [2022-03-15 21:50:10,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-03-15 21:50:10,282 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:10,283 INFO L514 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:10,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-03-15 21:50:10,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-03-15 21:50:10,491 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:50:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash -585322154, now seen corresponding path program 53 times [2022-03-15 21:50:10,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:10,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298437908] [2022-03-15 21:50:10,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:11,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:11,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298437908] [2022-03-15 21:50:11,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298437908] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:11,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764310220] [2022-03-15 21:50:11,890 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:50:11,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:11,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:11,892 INFO L229 MonitoredProcess]: Starting monitored process 54 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:50:11,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-15 21:50:11,946 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2022-03-15 21:50:11,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:11,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 113 conjunts are in the unsatisfiable core [2022-03-15 21:50:11,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:12,145 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 11 treesize of output 7 [2022-03-15 21:50:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:12,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:12,215 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:50:12,215 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 14 treesize of output 13 [2022-03-15 21:50:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:12,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764310220] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:12,335 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:12,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 55 [2022-03-15 21:50:12,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1494413313] [2022-03-15 21:50:12,335 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:12,363 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:12,401 INFO L252 McrAutomatonBuilder]: Finished intersection with 147 states and 230 transitions. [2022-03-15 21:50:12,401 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:19,417 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 54 new interpolants: [87624#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 87606#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 87630#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 87623#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 87636#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 87594#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 26))) (not (= 5 (select queue back)))), 87631#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 87617#(or (<= back (+ 21 front)) (= 5 (select queue (+ 21 front)))), 87590#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 87601#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 87598#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 26))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 87619#(or (<= back (+ 23 front)) (= 5 (select queue (+ 23 front)))), 87627#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 87613#(or (<= back (+ front 17)) (= 5 (select queue (+ front 17)))), 87599#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 87620#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 87615#(or (= (select queue (+ 19 front)) 5) (<= back (+ 19 front))), 87583#(or (= (select queue front) 5) (<= back front)), 87635#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 87588#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 87632#(or (= 5 (select queue (+ front 24))) (<= back (+ front 24))), 87616#(or (<= back (+ front 20)) (= 5 (select queue (+ front 20)))), 87586#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 87591#(or (= 5 (select queue (+ front 26))) (not (= 5 (select queue back)))), 87629#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 87592#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ front 26))) (not (= 5 (select queue back)))), 87634#(or (= 5 (select queue (+ front 26))) (<= back (+ front 26))), 87596#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 26))) (not (= 5 (select queue back)))), 87585#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 87618#(or (<= back (+ 22 front)) (= 5 (select queue (+ 22 front)))), 87608#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 87602#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 87622#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 87614#(or (= 5 (select queue (+ front 18))) (<= back (+ front 18))), 87605#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 87607#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 87597#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 26))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 87633#(or (<= back (+ front 25)) (= 5 (select queue (+ front 25)))), 87589#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 87604#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 87626#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 87595#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 26))) (not (= 5 (select queue back)))), 87611#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 87625#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 87609#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 87584#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 87612#(or (= 5 (select queue (+ 16 front))) (<= back (+ 16 front))), 87593#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 26))) (not (= 5 (select queue back)))), 87603#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 87610#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 87587#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 87628#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 87600#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 87621#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 26))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5)))] [2022-03-15 21:50:19,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-03-15 21:50:19,417 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:19,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-03-15 21:50:19,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=10830, Unknown=0, NotChecked=0, Total=12210 [2022-03-15 21:50:19,419 INFO L87 Difference]: Start difference. First operand 1307 states and 2686 transitions. Second operand has 111 states, 110 states have (on average 1.790909090909091) internal successors, (197), 110 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have 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:50:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:26,238 INFO L93 Difference]: Finished difference Result 2664 states and 5264 transitions. [2022-03-15 21:50:26,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 21:50:26,239 INFO L78 Accepts]: Start accepts. Automaton has has 111 states, 110 states have (on average 1.790909090909091) internal successors, (197), 110 states have internal predecessors, (197), 0 states have call successors, (0), 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 62 [2022-03-15 21:50:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:26,241 INFO L225 Difference]: With dead ends: 2664 [2022-03-15 21:50:26,242 INFO L226 Difference]: Without dead ends: 1688 [2022-03-15 21:50:26,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 147 SyntacticMatches, 5 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2509 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=4512, Invalid=22548, Unknown=0, NotChecked=0, Total=27060 [2022-03-15 21:50:26,243 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 3732 mSDsluCounter, 5570 mSDsCounter, 0 mSdLazyCounter, 5130 mSolverCounterSat, 1141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3732 SdHoareTripleChecker+Valid, 2414 SdHoareTripleChecker+Invalid, 6271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1141 IncrementalHoareTripleChecker+Valid, 5130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:26,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3732 Valid, 2414 Invalid, 6271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1141 Valid, 5130 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 21:50:26,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2022-03-15 21:50:26,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 150. [2022-03-15 21:50:26,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.9798657718120805) internal successors, (295), 149 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have 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:50:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 295 transitions. [2022-03-15 21:50:26,253 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 295 transitions. Word has length 62 [2022-03-15 21:50:26,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:26,253 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 295 transitions. [2022-03-15 21:50:26,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 110 states have (on average 1.790909090909091) internal successors, (197), 110 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have 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:50:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 295 transitions. [2022-03-15 21:50:26,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-15 21:50:26,254 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:26,254 INFO L514 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:26,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-03-15 21:50:26,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-03-15 21:50:26,473 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:50:26,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:26,474 INFO L85 PathProgramCache]: Analyzing trace with hash -964373789, now seen corresponding path program 54 times [2022-03-15 21:50:26,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:26,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887086659] [2022-03-15 21:50:26,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:26,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:26,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:26,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887086659] [2022-03-15 21:50:26,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887086659] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:26,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813935275] [2022-03-15 21:50:26,916 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:50:26,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:26,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:26,918 INFO L229 MonitoredProcess]: Starting monitored process 55 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:50:26,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-03-15 21:50:26,968 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-03-15 21:50:26,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:26,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 21:50:26,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:27,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:27,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813935275] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:27,190 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:27,190 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 30 [2022-03-15 21:50:27,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [599369353] [2022-03-15 21:50:27,191 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:27,195 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:27,235 INFO L252 McrAutomatonBuilder]: Finished intersection with 150 states and 235 transitions. [2022-03-15 21:50:27,235 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:27,416 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 6 treesize of output 4 [2022-03-15 21:50:27,425 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 6 treesize of output 4 [2022-03-15 21:50:27,431 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 6 treesize of output 4 [2022-03-15 21:50:27,439 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 6 treesize of output 4 [2022-03-15 21:50:27,447 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 6 treesize of output 4 [2022-03-15 21:50:27,454 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 6 treesize of output 4 [2022-03-15 21:50:27,462 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 6 treesize of output 4 [2022-03-15 21:50:27,468 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 6 treesize of output 4 [2022-03-15 21:50:27,476 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 6 treesize of output 4 [2022-03-15 21:50:27,484 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 6 treesize of output 4 [2022-03-15 21:50:27,492 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 6 treesize of output 4 [2022-03-15 21:50:27,499 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 6 treesize of output 4 [2022-03-15 21:50:27,525 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 6 treesize of output 4 [2022-03-15 21:50:27,533 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 6 treesize of output 4 [2022-03-15 21:50:27,541 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 6 treesize of output 4 [2022-03-15 21:50:27,548 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 6 treesize of output 4 [2022-03-15 21:50:27,556 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 6 treesize of output 4 [2022-03-15 21:50:27,563 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 6 treesize of output 4 [2022-03-15 21:50:27,570 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 6 treesize of output 4 [2022-03-15 21:50:27,578 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 6 treesize of output 4 [2022-03-15 21:50:27,586 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 6 treesize of output 4 [2022-03-15 21:50:27,593 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 6 treesize of output 4 [2022-03-15 21:50:27,601 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 6 treesize of output 4 [2022-03-15 21:50:27,608 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 6 treesize of output 4 [2022-03-15 21:50:27,616 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 6 treesize of output 4 [2022-03-15 21:50:27,624 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 6 treesize of output 4 [2022-03-15 21:50:27,631 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 6 treesize of output 4 [2022-03-15 21:50:27,633 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:50:27,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:50:27,634 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:27,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:50:27,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2022-03-15 21:50:27,634 INFO L87 Difference]: Start difference. First operand 150 states and 295 transitions. Second operand has 31 states, 31 states have (on average 4.741935483870968) internal successors, (147), 30 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have 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:50:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:27,814 INFO L93 Difference]: Finished difference Result 1594 states and 3121 transitions. [2022-03-15 21:50:27,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 21:50:27,814 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.741935483870968) internal successors, (147), 30 states have internal predecessors, (147), 0 states have call successors, (0), 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 63 [2022-03-15 21:50:27,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:27,817 INFO L225 Difference]: With dead ends: 1594 [2022-03-15 21:50:27,817 INFO L226 Difference]: Without dead ends: 1537 [2022-03-15 21:50:27,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2022-03-15 21:50:27,818 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 234 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:27,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 155 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:50:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-03-15 21:50:27,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1397. [2022-03-15 21:50:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1396 states have (on average 2.055157593123209) internal successors, (2869), 1396 states have internal predecessors, (2869), 0 states have call successors, (0), 0 states have 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:50:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2869 transitions. [2022-03-15 21:50:27,837 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2869 transitions. Word has length 63 [2022-03-15 21:50:27,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:27,837 INFO L470 AbstractCegarLoop]: Abstraction has 1397 states and 2869 transitions. [2022-03-15 21:50:27,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.741935483870968) internal successors, (147), 30 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have 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:50:27,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2869 transitions. [2022-03-15 21:50:27,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-15 21:50:27,839 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:27,839 INFO L514 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:27,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-03-15 21:50:28,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:28,062 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:50:28,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:28,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1132841502, now seen corresponding path program 55 times [2022-03-15 21:50:28,063 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:28,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502618474] [2022-03-15 21:50:28,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:28,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:29,674 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:29,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502618474] [2022-03-15 21:50:29,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502618474] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:29,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78586779] [2022-03-15 21:50:29,674 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:50:29,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:29,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:29,676 INFO L229 MonitoredProcess]: Starting monitored process 56 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:50:29,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-03-15 21:50:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:29,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 115 conjunts are in the unsatisfiable core [2022-03-15 21:50:29,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:29,923 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 11 treesize of output 7 [2022-03-15 21:50:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:29,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:29,996 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:50:29,997 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 14 treesize of output 13 [2022-03-15 21:50:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:30,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78586779] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:30,120 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:30,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 57 [2022-03-15 21:50:30,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [674067280] [2022-03-15 21:50:30,121 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:30,126 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:30,167 INFO L252 McrAutomatonBuilder]: Finished intersection with 152 states and 238 transitions. [2022-03-15 21:50:30,167 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:37,807 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 56 new interpolants: [95983#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 95978#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 95971#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 95986#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 95959#(or (<= back (+ 22 front)) (= 5 (select queue (+ 22 front)))), 95947#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 95970#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 27))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 95965#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 27))) (not (= 5 (select queue back)))), 95953#(or (= 5 (select queue (+ 16 front))) (<= back (+ 16 front))), 95975#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 95984#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 95964#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ front 27))) (not (= 5 (select queue back)))), 95991#(or (<= back (+ front 27)) (= 5 (select queue (+ front 27)))), 95973#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 95939#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 95990#(or (= 5 (select queue (+ front 26))) (<= back (+ front 26))), 95968#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 27))) (not (= 5 (select queue back)))), 95979#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 95957#(or (<= back (+ front 20)) (= 5 (select queue (+ front 20)))), 95945#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 95944#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 95967#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 27))) (not (= 5 (select queue back)))), 95992#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 95949#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 95987#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 95956#(or (= (select queue (+ 19 front)) 5) (<= back (+ 19 front))), 95954#(or (<= back (+ front 17)) (= 5 (select queue (+ front 17)))), 95943#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 95963#(or (= 5 (select queue (+ front 27))) (not (= 5 (select queue back)))), 95951#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 95961#(or (= 5 (select queue (+ front 24))) (<= back (+ front 24))), 95958#(or (<= back (+ 21 front)) (= 5 (select queue (+ 21 front)))), 95969#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ front 27))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 95942#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 95988#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 95938#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 95989#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 95948#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 95980#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 95966#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ front 27))) (not (= 5 (select queue back)))), 95976#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 95960#(or (<= back (+ 23 front)) (= 5 (select queue (+ 23 front)))), 95974#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 95955#(or (= 5 (select queue (+ front 18))) (<= back (+ front 18))), 95937#(or (= (select queue front) 5) (<= back front)), 95952#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 95981#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 95950#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 95977#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 95940#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 95941#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 95972#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 95946#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 95982#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 95962#(or (<= back (+ front 25)) (= 5 (select queue (+ front 25)))), 95985#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (= 5 (select queue (+ front 27))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5)))] [2022-03-15 21:50:37,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 115 states [2022-03-15 21:50:37,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:37,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2022-03-15 21:50:37,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1473, Invalid=11637, Unknown=0, NotChecked=0, Total=13110 [2022-03-15 21:50:37,808 INFO L87 Difference]: Start difference. First operand 1397 states and 2869 transitions. Second operand has 115 states, 114 states have (on average 1.7894736842105263) internal successors, (204), 114 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have 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:50:45,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:45,261 INFO L93 Difference]: Finished difference Result 2846 states and 5626 transitions. [2022-03-15 21:50:45,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 21:50:45,261 INFO L78 Accepts]: Start accepts. Automaton has has 115 states, 114 states have (on average 1.7894736842105263) internal successors, (204), 114 states have internal predecessors, (204), 0 states have call successors, (0), 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 64 [2022-03-15 21:50:45,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:45,265 INFO L225 Difference]: With dead ends: 2846 [2022-03-15 21:50:45,265 INFO L226 Difference]: Without dead ends: 1806 [2022-03-15 21:50:45,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 152 SyntacticMatches, 5 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2700 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=4833, Invalid=24237, Unknown=0, NotChecked=0, Total=29070 [2022-03-15 21:50:45,266 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 3936 mSDsluCounter, 6162 mSDsCounter, 0 mSdLazyCounter, 5590 mSolverCounterSat, 1190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3936 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 6780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1190 IncrementalHoareTripleChecker+Valid, 5590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:45,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3936 Valid, 2679 Invalid, 6780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1190 Valid, 5590 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 21:50:45,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2022-03-15 21:50:45,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 155. [2022-03-15 21:50:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.9805194805194806) internal successors, (305), 154 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have 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:50:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 305 transitions. [2022-03-15 21:50:45,277 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 305 transitions. Word has length 64 [2022-03-15 21:50:45,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:45,277 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 305 transitions. [2022-03-15 21:50:45,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 115 states, 114 states have (on average 1.7894736842105263) internal successors, (204), 114 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have 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:50:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 305 transitions. [2022-03-15 21:50:45,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-15 21:50:45,277 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:45,277 INFO L514 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:45,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-03-15 21:50:45,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:45,498 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:50:45,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:45,498 INFO L85 PathProgramCache]: Analyzing trace with hash -757604393, now seen corresponding path program 56 times [2022-03-15 21:50:45,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:45,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513618428] [2022-03-15 21:50:45,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:45,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:45,899 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:45,900 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:45,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513618428] [2022-03-15 21:50:45,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513618428] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:45,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166858307] [2022-03-15 21:50:45,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:50:45,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:45,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:45,908 INFO L229 MonitoredProcess]: Starting monitored process 57 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:50:45,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-03-15 21:50:45,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:50:45,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:45,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-15 21:50:45,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:46,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:46,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166858307] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:46,210 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:46,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 31 [2022-03-15 21:50:46,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [384179466] [2022-03-15 21:50:46,210 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:46,215 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:46,286 INFO L252 McrAutomatonBuilder]: Finished intersection with 155 states and 243 transitions. [2022-03-15 21:50:46,286 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:46,441 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 6 treesize of output 4 [2022-03-15 21:50:46,447 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 6 treesize of output 4 [2022-03-15 21:50:46,456 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 6 treesize of output 4 [2022-03-15 21:50:46,462 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 6 treesize of output 4 [2022-03-15 21:50:46,470 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 6 treesize of output 4 [2022-03-15 21:50:46,478 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 6 treesize of output 4 [2022-03-15 21:50:46,485 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 6 treesize of output 4 [2022-03-15 21:50:46,493 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 6 treesize of output 4 [2022-03-15 21:50:46,499 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 6 treesize of output 4 [2022-03-15 21:50:46,506 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 6 treesize of output 4 [2022-03-15 21:50:46,515 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 6 treesize of output 4 [2022-03-15 21:50:46,522 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 6 treesize of output 4 [2022-03-15 21:50:46,530 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 6 treesize of output 4 [2022-03-15 21:50:46,536 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 6 treesize of output 4 [2022-03-15 21:50:46,544 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 6 treesize of output 4 [2022-03-15 21:50:46,552 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 6 treesize of output 4 [2022-03-15 21:50:46,559 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 6 treesize of output 4 [2022-03-15 21:50:46,567 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 6 treesize of output 4 [2022-03-15 21:50:46,590 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 6 treesize of output 4 [2022-03-15 21:50:46,612 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 6 treesize of output 4 [2022-03-15 21:50:46,621 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 6 treesize of output 4 [2022-03-15 21:50:46,628 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 6 treesize of output 4 [2022-03-15 21:50:46,636 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 6 treesize of output 4 [2022-03-15 21:50:46,646 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 6 treesize of output 4 [2022-03-15 21:50:46,657 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 6 treesize of output 4 [2022-03-15 21:50:46,668 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 6 treesize of output 4 [2022-03-15 21:50:46,678 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 6 treesize of output 4 [2022-03-15 21:50:46,685 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 6 treesize of output 4 [2022-03-15 21:50:46,701 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:50:46,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:50:46,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:46,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:50:46,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2022-03-15 21:50:46,701 INFO L87 Difference]: Start difference. First operand 155 states and 305 transitions. Second operand has 32 states, 32 states have (on average 4.75) internal successors, (152), 31 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have 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:50:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:46,880 INFO L93 Difference]: Finished difference Result 1694 states and 3319 transitions. [2022-03-15 21:50:46,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 21:50:46,880 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.75) internal successors, (152), 31 states have internal predecessors, (152), 0 states have call successors, (0), 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 65 [2022-03-15 21:50:46,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:46,884 INFO L225 Difference]: With dead ends: 1694 [2022-03-15 21:50:46,884 INFO L226 Difference]: Without dead ends: 1635 [2022-03-15 21:50:46,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2022-03-15 21:50:46,884 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 315 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:46,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 137 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:50:46,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2022-03-15 21:50:46,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1490. [2022-03-15 21:50:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1489 states have (on average 2.0537273337810613) internal successors, (3058), 1489 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have 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:50:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 3058 transitions. [2022-03-15 21:50:46,905 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 3058 transitions. Word has length 65 [2022-03-15 21:50:46,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:46,905 INFO L470 AbstractCegarLoop]: Abstraction has 1490 states and 3058 transitions. [2022-03-15 21:50:46,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.75) internal successors, (152), 31 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have 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:50:46,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 3058 transitions. [2022-03-15 21:50:46,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-03-15 21:50:46,907 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:46,907 INFO L514 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:46,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-03-15 21:50:47,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:47,123 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:50:47,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash 553680662, now seen corresponding path program 57 times [2022-03-15 21:50:47,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:47,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514258932] [2022-03-15 21:50:47,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:47,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:48,729 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:48,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514258932] [2022-03-15 21:50:48,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514258932] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:48,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407636240] [2022-03-15 21:50:48,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:50:48,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:48,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:48,730 INFO L229 MonitoredProcess]: Starting monitored process 58 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:50:48,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-03-15 21:50:48,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-03-15 21:50:48,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:48,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 119 conjunts are in the unsatisfiable core [2022-03-15 21:50:48,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:48,999 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 11 treesize of output 7 [2022-03-15 21:50:49,005 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:49,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:49,072 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:50:49,072 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 14 treesize of output 13 [2022-03-15 21:50:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:49,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407636240] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:49,201 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:49,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 59 [2022-03-15 21:50:49,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1582053225] [2022-03-15 21:50:49,201 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:49,207 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:49,251 INFO L252 McrAutomatonBuilder]: Finished intersection with 157 states and 246 transitions. [2022-03-15 21:50:49,251 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:57,628 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 58 new interpolants: [104835#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 104818#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 104846#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 104830#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 104851#(or (<= back (+ front 20)) (= 5 (select queue (+ front 20)))), 104840#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 28)))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 104806#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue back)))), 104845#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 104825#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 104812#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 104821#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 104858#(or (<= back (+ front 27)) (= 5 (select queue (+ front 27)))), 104855#(or (= 5 (select queue (+ front 24))) (<= back (+ front 24))), 104833#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 104839#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 104815#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 104807#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue back)))), 104857#(or (= 5 (select queue (+ front 26))) (<= back (+ front 26))), 104808#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 104842#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 104852#(or (<= back (+ 21 front)) (= 5 (select queue (+ 21 front)))), 104804#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 2 back)))) (not (= 5 (select queue back)))), 104822#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 104848#(or (<= back (+ front 17)) (= 5 (select queue (+ front 17)))), 104849#(or (= 5 (select queue (+ front 18))) (<= back (+ front 18))), 104823#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 104811#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 104844#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 104859#(or (= (select queue (+ front 28)) 5) (<= back (+ front 28))), 104817#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 104829#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 104834#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 104843#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 104826#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 104827#(or (= (select queue front) 5) (<= back front)), 104816#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 104847#(or (= 5 (select queue (+ 16 front))) (<= back (+ 16 front))), 104850#(or (= (select queue (+ 19 front)) 5) (<= back (+ 19 front))), 104824#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 104838#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 104854#(or (<= back (+ 23 front)) (= 5 (select queue (+ 23 front)))), 104814#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 104819#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 104828#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 104836#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 104803#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue back)))), 104853#(or (<= back (+ 22 front)) (= 5 (select queue (+ 22 front)))), 104805#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= 5 (select queue back)))), 104856#(or (<= back (+ front 25)) (= 5 (select queue (+ front 25)))), 104841#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 104832#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 104837#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 104831#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 104820#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 104802#(or (= (select queue (+ front 28)) 5) (not (= 5 (select queue back)))), 104809#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 104810#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 104813#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ front 28)) 5) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5)))] [2022-03-15 21:50:57,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 119 states [2022-03-15 21:50:57,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:57,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2022-03-15 21:50:57,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1569, Invalid=12473, Unknown=0, NotChecked=0, Total=14042 [2022-03-15 21:50:57,630 INFO L87 Difference]: Start difference. First operand 1490 states and 3058 transitions. Second operand has 119 states, 118 states have (on average 1.7881355932203389) internal successors, (211), 118 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have 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:05,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:05,775 INFO L93 Difference]: Finished difference Result 3034 states and 6000 transitions. [2022-03-15 21:51:05,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 21:51:05,779 INFO L78 Accepts]: Start accepts. Automaton has has 119 states, 118 states have (on average 1.7881355932203389) internal successors, (211), 118 states have internal predecessors, (211), 0 states have call successors, (0), 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 66 [2022-03-15 21:51:05,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:05,782 INFO L225 Difference]: With dead ends: 3034 [2022-03-15 21:51:05,783 INFO L226 Difference]: Without dead ends: 1928 [2022-03-15 21:51:05,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 157 SyntacticMatches, 5 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2899 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=5165, Invalid=25987, Unknown=0, NotChecked=0, Total=31152 [2022-03-15 21:51:05,784 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 3917 mSDsluCounter, 6716 mSDsCounter, 0 mSdLazyCounter, 6154 mSolverCounterSat, 1205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3917 SdHoareTripleChecker+Valid, 2903 SdHoareTripleChecker+Invalid, 7359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1205 IncrementalHoareTripleChecker+Valid, 6154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:05,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3917 Valid, 2903 Invalid, 7359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1205 Valid, 6154 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-03-15 21:51:05,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2022-03-15 21:51:05,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 160. [2022-03-15 21:51:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.9811320754716981) internal successors, (315), 159 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have 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:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 315 transitions. [2022-03-15 21:51:05,794 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 315 transitions. Word has length 66 [2022-03-15 21:51:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:05,795 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 315 transitions. [2022-03-15 21:51:05,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 119 states, 118 states have (on average 1.7881355932203389) internal successors, (211), 118 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have 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:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 315 transitions. [2022-03-15 21:51:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-03-15 21:51:05,795 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:05,795 INFO L514 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:05,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-03-15 21:51:06,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-03-15 21:51:06,011 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:51:06,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:06,012 INFO L85 PathProgramCache]: Analyzing trace with hash -15024861, now seen corresponding path program 58 times [2022-03-15 21:51:06,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:06,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856874368] [2022-03-15 21:51:06,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:06,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:06,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:06,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856874368] [2022-03-15 21:51:06,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856874368] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:06,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593138736] [2022-03-15 21:51:06,449 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:51:06,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:06,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:06,450 INFO L229 MonitoredProcess]: Starting monitored process 59 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:06,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-03-15 21:51:06,494 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:51:06,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:06,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-15 21:51:06,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:06,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:06,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593138736] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:06,746 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:06,746 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 32 [2022-03-15 21:51:06,746 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1971746468] [2022-03-15 21:51:06,746 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:06,752 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:06,800 INFO L252 McrAutomatonBuilder]: Finished intersection with 160 states and 251 transitions. [2022-03-15 21:51:06,800 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:06,913 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 6 treesize of output 4 [2022-03-15 21:51:06,921 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 6 treesize of output 4 [2022-03-15 21:51:06,927 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 6 treesize of output 4 [2022-03-15 21:51:06,936 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 6 treesize of output 4 [2022-03-15 21:51:06,942 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 6 treesize of output 4 [2022-03-15 21:51:06,952 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 6 treesize of output 4 [2022-03-15 21:51:06,960 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 6 treesize of output 4 [2022-03-15 21:51:06,968 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 6 treesize of output 4 [2022-03-15 21:51:06,980 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 6 treesize of output 4 [2022-03-15 21:51:07,070 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 6 treesize of output 4 [2022-03-15 21:51:07,077 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 6 treesize of output 4 [2022-03-15 21:51:07,086 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 6 treesize of output 4 [2022-03-15 21:51:07,094 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 6 treesize of output 4 [2022-03-15 21:51:07,101 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 6 treesize of output 4 [2022-03-15 21:51:07,108 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 6 treesize of output 4 [2022-03-15 21:51:07,116 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 6 treesize of output 4 [2022-03-15 21:51:07,124 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 6 treesize of output 4 [2022-03-15 21:51:07,132 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 6 treesize of output 4 [2022-03-15 21:51:07,139 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 6 treesize of output 4 [2022-03-15 21:51:07,159 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 6 treesize of output 4 [2022-03-15 21:51:07,171 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 6 treesize of output 4 [2022-03-15 21:51:07,181 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 6 treesize of output 4 [2022-03-15 21:51:07,191 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 6 treesize of output 4 [2022-03-15 21:51:07,200 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 6 treesize of output 4 [2022-03-15 21:51:07,209 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 6 treesize of output 4 [2022-03-15 21:51:07,217 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 6 treesize of output 4 [2022-03-15 21:51:07,224 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 6 treesize of output 4 [2022-03-15 21:51:07,232 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 6 treesize of output 4 [2022-03-15 21:51:07,239 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 6 treesize of output 4 [2022-03-15 21:51:07,253 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:51:07,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:51:07,253 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:07,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:51:07,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:51:07,254 INFO L87 Difference]: Start difference. First operand 160 states and 315 transitions. Second operand has 33 states, 33 states have (on average 4.757575757575758) internal successors, (157), 32 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have 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:07,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:07,490 INFO L93 Difference]: Finished difference Result 1797 states and 3523 transitions. [2022-03-15 21:51:07,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 21:51:07,490 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.757575757575758) internal successors, (157), 32 states have internal predecessors, (157), 0 states have call successors, (0), 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 67 [2022-03-15 21:51:07,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:07,492 INFO L225 Difference]: With dead ends: 1797 [2022-03-15 21:51:07,492 INFO L226 Difference]: Without dead ends: 1736 [2022-03-15 21:51:07,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:51:07,493 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 273 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:07,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 202 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:51:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2022-03-15 21:51:07,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1586. [2022-03-15 21:51:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 1585 states have (on average 2.052365930599369) internal successors, (3253), 1585 states have internal predecessors, (3253), 0 states have call successors, (0), 0 states have 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:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 3253 transitions. [2022-03-15 21:51:07,513 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 3253 transitions. Word has length 67 [2022-03-15 21:51:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:07,513 INFO L470 AbstractCegarLoop]: Abstraction has 1586 states and 3253 transitions. [2022-03-15 21:51:07,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.757575757575758) internal successors, (157), 32 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have 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:07,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 3253 transitions. [2022-03-15 21:51:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-03-15 21:51:07,514 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:07,514 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:07,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-03-15 21:51:07,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-03-15 21:51:07,715 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:51:07,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:07,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1704495266, now seen corresponding path program 59 times [2022-03-15 21:51:07,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:07,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453889649] [2022-03-15 21:51:07,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:07,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:09,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:09,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453889649] [2022-03-15 21:51:09,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453889649] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:09,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449122656] [2022-03-15 21:51:09,407 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:51:09,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:09,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:09,412 INFO L229 MonitoredProcess]: Starting monitored process 60 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:09,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-03-15 21:51:09,491 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2022-03-15 21:51:09,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:09,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-15 21:51:09,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:14,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:14,072 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 7 [2022-03-15 21:51:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 435 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:14,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:17,999 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:51:18,000 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 12 treesize of output 11 [2022-03-15 21:51:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 406 proven. 524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:18,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449122656] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:18,057 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:18,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 151 [2022-03-15 21:51:18,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2143138764] [2022-03-15 21:51:18,058 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:18,063 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:18,114 INFO L252 McrAutomatonBuilder]: Finished intersection with 162 states and 254 transitions. [2022-03-15 21:51:18,114 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:30,347 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 60 new interpolants: [114315#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue back)))), 114301#(or (= (select queue (+ 19 front)) 5) (<= back (+ 19 front))), 114289#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 114316#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue back)))), 114330#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114308#(or (= 5 (select queue (+ front 26))) (<= back (+ front 26))), 114286#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 114320#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue back)))), 114338#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114294#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 114317#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue back)))), 114304#(or (<= back (+ 22 front)) (= 5 (select queue (+ 22 front)))), 114310#(or (= (select queue (+ front 28)) 5) (<= back (+ front 28))), 114335#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114319#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue back)))), 114323#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114339#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114295#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 114306#(or (= 5 (select queue (+ front 24))) (<= back (+ front 24))), 114312#(or (= 5 (select queue (+ 29 front))) (not (= 5 (select queue back)))), 114324#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114287#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 114336#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114067#(or (not (< front back)) (= (select queue front) 5)), 114302#(or (<= back (+ front 20)) (= 5 (select queue (+ front 20)))), 114293#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 114322#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue back)))), 114296#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 114325#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114328#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114307#(or (<= back (+ front 25)) (= 5 (select queue (+ front 25)))), 114332#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114297#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 114299#(or (<= back (+ front 17)) (= 5 (select queue (+ front 17)))), 114292#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 114288#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 114341#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ 29 back)))) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 28)))) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114337#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114305#(or (<= back (+ 23 front)) (= 5 (select queue (+ 23 front)))), 114329#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114303#(or (<= back (+ 21 front)) (= 5 (select queue (+ 21 front)))), 114314#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue back)))), 114298#(or (= 5 (select queue (+ 16 front))) (<= back (+ 16 front))), 114300#(or (= 5 (select queue (+ front 18))) (<= back (+ front 18))), 114321#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue back)))), 114290#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 114291#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 114311#(or (<= back (+ 29 front)) (= 5 (select queue (+ 29 front)))), 114318#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue back)))), 114284#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 114334#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114309#(or (<= back (+ front 27)) (= 5 (select queue (+ front 27)))), 114333#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114313#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue back)))), 114340#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 28)))) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114283#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 114285#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 114327#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114326#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 114331#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (= 5 (select queue (+ 29 front))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5)))] [2022-03-15 21:51:30,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2022-03-15 21:51:30,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:30,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2022-03-15 21:51:30,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6779, Invalid=37953, Unknown=0, NotChecked=0, Total=44732 [2022-03-15 21:51:30,350 INFO L87 Difference]: Start difference. First operand 1586 states and 3253 transitions. Second operand has 123 states, 122 states have (on average 1.7868852459016393) internal successors, (218), 122 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have 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,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:41,490 INFO L93 Difference]: Finished difference Result 3228 states and 6386 transitions. [2022-03-15 21:51:41,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 21:51:41,491 INFO L78 Accepts]: Start accepts. Automaton has has 123 states, 122 states have (on average 1.7868852459016393) internal successors, (218), 122 states have internal predecessors, (218), 0 states have call successors, (0), 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 68 [2022-03-15 21:51:41,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:41,493 INFO L225 Difference]: With dead ends: 3228 [2022-03-15 21:51:41,493 INFO L226 Difference]: Without dead ends: 2054 [2022-03-15 21:51:41,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12678 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=12418, Invalid=61294, Unknown=0, NotChecked=0, Total=73712 [2022-03-15 21:51:41,496 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 4438 mSDsluCounter, 7442 mSDsCounter, 0 mSdLazyCounter, 6753 mSolverCounterSat, 1373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4438 SdHoareTripleChecker+Valid, 3221 SdHoareTripleChecker+Invalid, 8126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1373 IncrementalHoareTripleChecker+Valid, 6753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:41,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4438 Valid, 3221 Invalid, 8126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1373 Valid, 6753 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-03-15 21:51:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2022-03-15 21:51:41,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 165. [2022-03-15 21:51:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.9817073170731707) internal successors, (325), 164 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have 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,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 325 transitions. [2022-03-15 21:51:41,503 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 325 transitions. Word has length 68 [2022-03-15 21:51:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:41,503 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 325 transitions. [2022-03-15 21:51:41,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 123 states, 122 states have (on average 1.7868852459016393) internal successors, (218), 122 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have 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,504 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 325 transitions. [2022-03-15 21:51:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-03-15 21:51:41,504 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:41,504 INFO L514 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:41,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-03-15 21:51:41,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:41,704 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:51:41,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:41,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1300489495, now seen corresponding path program 60 times [2022-03-15 21:51:41,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:41,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162336416] [2022-03-15 21:51:41,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:41,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:42,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:42,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162336416] [2022-03-15 21:51:42,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162336416] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:42,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996531705] [2022-03-15 21:51:42,149 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:51:42,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:42,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:42,151 INFO L229 MonitoredProcess]: Starting monitored process 61 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,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-03-15 21:51:42,217 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2022-03-15 21:51:42,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:42,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-15 21:51:42,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:42,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:42,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996531705] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:42,467 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:42,467 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 33 [2022-03-15 21:51:42,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1204456187] [2022-03-15 21:51:42,467 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:42,473 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:42,548 INFO L252 McrAutomatonBuilder]: Finished intersection with 165 states and 259 transitions. [2022-03-15 21:51:42,548 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:42,664 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 6 treesize of output 4 [2022-03-15 21:51:42,672 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 6 treesize of output 4 [2022-03-15 21:51:42,679 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 6 treesize of output 4 [2022-03-15 21:51:42,686 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 6 treesize of output 4 [2022-03-15 21:51:42,695 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 6 treesize of output 4 [2022-03-15 21:51:42,701 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 6 treesize of output 4 [2022-03-15 21:51:42,710 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 6 treesize of output 4 [2022-03-15 21:51:42,717 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 6 treesize of output 4 [2022-03-15 21:51:42,725 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 6 treesize of output 4 [2022-03-15 21:51:42,762 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 6 treesize of output 4 [2022-03-15 21:51:42,769 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 6 treesize of output 4 [2022-03-15 21:51:42,776 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 6 treesize of output 4 [2022-03-15 21:51:42,785 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 6 treesize of output 4 [2022-03-15 21:51:42,792 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 6 treesize of output 4 [2022-03-15 21:51:42,801 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 6 treesize of output 4 [2022-03-15 21:51:42,807 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 6 treesize of output 4 [2022-03-15 21:51:42,817 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 6 treesize of output 4 [2022-03-15 21:51:42,825 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 6 treesize of output 4 [2022-03-15 21:51:42,832 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 6 treesize of output 4 [2022-03-15 21:51:42,840 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 6 treesize of output 4 [2022-03-15 21:51:42,848 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 6 treesize of output 4 [2022-03-15 21:51:42,854 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 6 treesize of output 4 [2022-03-15 21:51:42,863 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 6 treesize of output 4 [2022-03-15 21:51:42,870 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 6 treesize of output 4 [2022-03-15 21:51:42,878 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 6 treesize of output 4 [2022-03-15 21:51:42,886 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 6 treesize of output 4 [2022-03-15 21:51:42,893 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 6 treesize of output 4 [2022-03-15 21:51:42,956 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 6 treesize of output 4 [2022-03-15 21:51:42,976 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 6 treesize of output 4 [2022-03-15 21:51:42,982 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 6 treesize of output 4 [2022-03-15 21:51:42,985 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:51:42,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 21:51:42,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:42,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 21:51:42,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:51:42,986 INFO L87 Difference]: Start difference. First operand 165 states and 325 transitions. Second operand has 34 states, 34 states have (on average 4.764705882352941) internal successors, (162), 33 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have 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,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:43,198 INFO L93 Difference]: Finished difference Result 1903 states and 3733 transitions. [2022-03-15 21:51:43,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 21:51:43,199 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.764705882352941) internal successors, (162), 33 states have internal predecessors, (162), 0 states have call successors, (0), 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 69 [2022-03-15 21:51:43,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:43,201 INFO L225 Difference]: With dead ends: 1903 [2022-03-15 21:51:43,201 INFO L226 Difference]: Without dead ends: 1840 [2022-03-15 21:51:43,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:51:43,201 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 209 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:43,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 210 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:51:43,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2022-03-15 21:51:43,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1685. [2022-03-15 21:51:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 1684 states have (on average 2.0510688836104514) internal successors, (3454), 1684 states have internal predecessors, (3454), 0 states have call successors, (0), 0 states have 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,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 3454 transitions. [2022-03-15 21:51:43,216 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 3454 transitions. Word has length 69 [2022-03-15 21:51:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:43,216 INFO L470 AbstractCegarLoop]: Abstraction has 1685 states and 3454 transitions. [2022-03-15 21:51:43,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.764705882352941) internal successors, (162), 33 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have 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,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 3454 transitions. [2022-03-15 21:51:43,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-15 21:51:43,218 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:43,218 INFO L514 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:43,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-03-15 21:51:43,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:43,418 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:51:43,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:43,419 INFO L85 PathProgramCache]: Analyzing trace with hash 196922582, now seen corresponding path program 61 times [2022-03-15 21:51:43,427 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:43,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970578027] [2022-03-15 21:51:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:43,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:45,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:45,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970578027] [2022-03-15 21:51:45,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970578027] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:45,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909981821] [2022-03-15 21:51:45,236 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:51:45,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:45,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:45,237 INFO L229 MonitoredProcess]: Starting monitored process 62 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:45,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-03-15 21:51:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:45,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 127 conjunts are in the unsatisfiable core [2022-03-15 21:51:45,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:45,493 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 11 treesize of output 7 [2022-03-15 21:51:45,499 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:45,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:45,569 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:51:45,570 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 14 treesize of output 13 [2022-03-15 21:51:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:45,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909981821] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:45,707 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:45,707 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 63 [2022-03-15 21:51:45,707 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [636058920] [2022-03-15 21:51:45,707 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:45,716 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:45,785 INFO L252 McrAutomatonBuilder]: Finished intersection with 167 states and 262 transitions. [2022-03-15 21:51:45,785 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:55,269 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 62 new interpolants: [124236#(or (<= back (+ 22 front)) (= 5 (select queue (+ 22 front)))), 124266#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124247#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= 5 (select queue back)))), 124222#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 124229#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 124251#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 124248#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue back)))), 124233#(or (= (select queue (+ 19 front)) 5) (<= back (+ 19 front))), 124267#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124218#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 124252#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 124238#(or (= 5 (select queue (+ front 24))) (<= back (+ front 24))), 124219#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 124214#(or (= (select queue front) 5) (<= back front)), 124221#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 124246#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= 5 (select queue back)))), 124240#(or (= 5 (select queue (+ front 26))) (<= back (+ front 26))), 124231#(or (<= back (+ front 17)) (= 5 (select queue (+ front 17)))), 124230#(or (= 5 (select queue (+ 16 front))) (<= back (+ 16 front))), 124235#(or (<= back (+ 21 front)) (= 5 (select queue (+ 21 front)))), 124269#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124253#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 124250#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 124215#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 124263#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124217#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 124244#(or (= (select queue (+ 30 front)) 5) (not (= 5 (select queue back)))), 124232#(or (= 5 (select queue (+ front 18))) (<= back (+ front 18))), 124237#(or (<= back (+ 23 front)) (= 5 (select queue (+ 23 front)))), 124243#(or (<= back (+ 29 front)) (= 5 (select queue (+ 29 front)))), 124254#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 124262#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124265#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124256#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124249#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue back)))), 124274#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ 30 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ 29 back)))) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 28)))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124259#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124242#(or (= (select queue (+ front 28)) 5) (<= back (+ front 28))), 124224#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 124225#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 124245#(or (not (= 5 (select queue (+ back 1)))) (= (select queue (+ 30 front)) 5) (not (= 5 (select queue back)))), 124234#(or (<= back (+ front 20)) (= 5 (select queue (+ front 20)))), 124264#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124270#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124241#(or (<= back (+ front 27)) (= 5 (select queue (+ front 27)))), 124216#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 124220#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 124228#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 124227#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 124268#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124239#(or (<= back (+ front 25)) (= 5 (select queue (+ front 25)))), 124261#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124272#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 28)))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124223#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 124226#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 124273#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ 29 back)))) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 28)))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124257#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124255#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124275#(or (= (select queue (+ 30 front)) 5) (<= back (+ 30 front))), 124258#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124260#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 124271#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= (select queue (+ 30 front)) 5) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5)))] [2022-03-15 21:51:55,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2022-03-15 21:51:55,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:55,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2022-03-15 21:51:55,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=14232, Unknown=0, NotChecked=0, Total=16002 [2022-03-15 21:51:55,271 INFO L87 Difference]: Start difference. First operand 1685 states and 3454 transitions. Second operand has 127 states, 126 states have (on average 1.7857142857142858) internal successors, (225), 126 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have 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:04,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:04,704 INFO L93 Difference]: Finished difference Result 3428 states and 6784 transitions. [2022-03-15 21:52:04,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 21:52:04,705 INFO L78 Accepts]: Start accepts. Automaton has has 127 states, 126 states have (on average 1.7857142857142858) internal successors, (225), 126 states have internal predecessors, (225), 0 states have call successors, (0), 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 70 [2022-03-15 21:52:04,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:04,707 INFO L225 Difference]: With dead ends: 3428 [2022-03-15 21:52:04,707 INFO L226 Difference]: Without dead ends: 2184 [2022-03-15 21:52:04,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 167 SyntacticMatches, 5 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3316 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=5862, Invalid=29670, Unknown=0, NotChecked=0, Total=35532 [2022-03-15 21:52:04,709 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 4622 mSDsluCounter, 7723 mSDsCounter, 0 mSdLazyCounter, 6997 mSolverCounterSat, 1451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4622 SdHoareTripleChecker+Valid, 3345 SdHoareTripleChecker+Invalid, 8448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1451 IncrementalHoareTripleChecker+Valid, 6997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:04,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4622 Valid, 3345 Invalid, 8448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1451 Valid, 6997 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 21:52:04,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2022-03-15 21:52:04,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 170. [2022-03-15 21:52:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.982248520710059) internal successors, (335), 169 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have 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:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 335 transitions. [2022-03-15 21:52:04,716 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 335 transitions. Word has length 70 [2022-03-15 21:52:04,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:04,716 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 335 transitions. [2022-03-15 21:52:04,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 127 states, 126 states have (on average 1.7857142857142858) internal successors, (225), 126 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have 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:04,716 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 335 transitions. [2022-03-15 21:52:04,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-03-15 21:52:04,716 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:04,716 INFO L514 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:04,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:04,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:04,917 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:52:04,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:04,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1810376547, now seen corresponding path program 62 times [2022-03-15 21:52:04,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:04,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955304977] [2022-03-15 21:52:04,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:04,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:05,401 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:05,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955304977] [2022-03-15 21:52:05,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955304977] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:05,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326708503] [2022-03-15 21:52:05,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:52:05,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:05,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:05,403 INFO L229 MonitoredProcess]: Starting monitored process 63 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:05,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-03-15 21:52:05,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:52:05,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:05,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 21:52:05,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:05,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:05,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326708503] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:05,715 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:05,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 34 [2022-03-15 21:52:05,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [730406024] [2022-03-15 21:52:05,716 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:05,722 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:05,800 INFO L252 McrAutomatonBuilder]: Finished intersection with 170 states and 267 transitions. [2022-03-15 21:52:05,800 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:06,007 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 6 treesize of output 4 [2022-03-15 21:52:06,014 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 6 treesize of output 4 [2022-03-15 21:52:06,022 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 6 treesize of output 4 [2022-03-15 21:52:06,029 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 6 treesize of output 4 [2022-03-15 21:52:06,036 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 6 treesize of output 4 [2022-03-15 21:52:06,044 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 6 treesize of output 4 [2022-03-15 21:52:06,051 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 6 treesize of output 4 [2022-03-15 21:52:06,059 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 6 treesize of output 4 [2022-03-15 21:52:06,067 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 6 treesize of output 4 [2022-03-15 21:52:06,075 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 6 treesize of output 4 [2022-03-15 21:52:06,083 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 6 treesize of output 4 [2022-03-15 21:52:06,089 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 6 treesize of output 4 [2022-03-15 21:52:06,097 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 6 treesize of output 4 [2022-03-15 21:52:06,105 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 6 treesize of output 4 [2022-03-15 21:52:06,113 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 6 treesize of output 4 [2022-03-15 21:52:06,120 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 6 treesize of output 4 [2022-03-15 21:52:06,127 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 6 treesize of output 4 [2022-03-15 21:52:06,135 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 6 treesize of output 4 [2022-03-15 21:52:06,143 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 6 treesize of output 4 [2022-03-15 21:52:06,150 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 6 treesize of output 4 [2022-03-15 21:52:06,158 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 6 treesize of output 4 [2022-03-15 21:52:06,165 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 6 treesize of output 4 [2022-03-15 21:52:06,172 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 6 treesize of output 4 [2022-03-15 21:52:06,180 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 6 treesize of output 4 [2022-03-15 21:52:06,188 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 6 treesize of output 4 [2022-03-15 21:52:06,195 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 6 treesize of output 4 [2022-03-15 21:52:06,203 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 6 treesize of output 4 [2022-03-15 21:52:06,211 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 6 treesize of output 4 [2022-03-15 21:52:06,218 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 6 treesize of output 4 [2022-03-15 21:52:06,226 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 6 treesize of output 4 [2022-03-15 21:52:06,232 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 6 treesize of output 4 [2022-03-15 21:52:06,251 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:52:06,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:52:06,251 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:06,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:52:06,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:52:06,252 INFO L87 Difference]: Start difference. First operand 170 states and 335 transitions. Second operand has 35 states, 35 states have (on average 4.771428571428571) internal successors, (167), 34 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have 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:06,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:06,468 INFO L93 Difference]: Finished difference Result 2012 states and 3949 transitions. [2022-03-15 21:52:06,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 21:52:06,470 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.771428571428571) internal successors, (167), 34 states have internal predecessors, (167), 0 states have call successors, (0), 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 71 [2022-03-15 21:52:06,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:06,472 INFO L225 Difference]: With dead ends: 2012 [2022-03-15 21:52:06,472 INFO L226 Difference]: Without dead ends: 1947 [2022-03-15 21:52:06,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:52:06,473 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 344 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:06,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 194 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:52:06,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2022-03-15 21:52:06,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1787. [2022-03-15 21:52:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1786 states have (on average 2.0498320268756998) internal successors, (3661), 1786 states have internal predecessors, (3661), 0 states have call successors, (0), 0 states have 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:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 3661 transitions. [2022-03-15 21:52:06,492 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 3661 transitions. Word has length 71 [2022-03-15 21:52:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:06,492 INFO L470 AbstractCegarLoop]: Abstraction has 1787 states and 3661 transitions. [2022-03-15 21:52:06,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.771428571428571) internal successors, (167), 34 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have 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:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 3661 transitions. [2022-03-15 21:52:06,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-03-15 21:52:06,494 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:06,494 INFO L514 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:06,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-03-15 21:52:06,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:06,695 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:52:06,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:06,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2139495266, now seen corresponding path program 63 times [2022-03-15 21:52:06,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:06,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857144961] [2022-03-15 21:52:06,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:06,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:08,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:08,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857144961] [2022-03-15 21:52:08,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857144961] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:08,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637962454] [2022-03-15 21:52:08,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:52:08,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:08,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:08,603 INFO L229 MonitoredProcess]: Starting monitored process 64 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:08,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-03-15 21:52:08,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2022-03-15 21:52:08,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:08,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 21:52:08,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:13,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:13,775 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 7 [2022-03-15 21:52:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 496 proven. 560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:13,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:18,335 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:52:18,335 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 12 treesize of output 11 [2022-03-15 21:52:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 465 proven. 591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:18,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637962454] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:18,396 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:18,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 161 [2022-03-15 21:52:18,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [675230543] [2022-03-15 21:52:18,396 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:18,402 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:18,479 INFO L252 McrAutomatonBuilder]: Finished intersection with 172 states and 270 transitions. [2022-03-15 21:52:18,479 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:32,377 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 64 new interpolants: [134857#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ 29 back)))) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 28)))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134836#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (= 5 (select queue (+ 31 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 134809#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 134812#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 134828#(or (= 5 (select queue (+ 31 front))) (not (= 5 (select queue back)))), 134839#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134816#(or (= (select queue (+ 19 front)) 5) (<= back (+ 19 front))), 134807#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 134813#(or (= 5 (select queue (+ 16 front))) (<= back (+ 16 front))), 134840#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134846#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134803#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 134814#(or (<= back (+ front 17)) (= 5 (select queue (+ front 17)))), 134835#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 31 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 134843#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134805#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 134826#(or (<= back (+ 29 front)) (= 5 (select queue (+ 29 front)))), 134842#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134844#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue (+ 16 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134824#(or (<= back (+ front 27)) (= 5 (select queue (+ front 27)))), 134827#(or (= (select queue (+ 30 front)) 5) (<= back (+ 30 front))), 134802#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 134848#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134823#(or (= 5 (select queue (+ front 26))) (<= back (+ front 26))), 134815#(or (= 5 (select queue (+ front 18))) (<= back (+ front 18))), 134568#(or (not (< front back)) (= (select queue front) 5)), 134801#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 134830#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue back)))), 134834#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 31 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 134806#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 134818#(or (<= back (+ 21 front)) (= 5 (select queue (+ 21 front)))), 134832#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue back)))), 134799#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 134811#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 134800#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 134849#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134837#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 134855#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134856#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 28)))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134858#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ 30 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ 29 back)))) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 28)))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134852#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134810#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 134850#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134798#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 134804#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 134808#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 134820#(or (<= back (+ 23 front)) (= 5 (select queue (+ 23 front)))), 134847#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134838#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 134822#(or (<= back (+ front 25)) (= 5 (select queue (+ front 25)))), 134853#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134817#(or (<= back (+ front 20)) (= 5 (select queue (+ front 20)))), 134859#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ 30 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ 29 back)))) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 28)))) (not (= 5 (select queue (+ back 31)))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134821#(or (= 5 (select queue (+ front 24))) (<= back (+ front 24))), 134833#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue back)))), 134851#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134841#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134829#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue back)))), 134854#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134825#(or (= (select queue (+ front 28)) 5) (<= back (+ front 28))), 134845#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 134831#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 31 front))) (not (= 5 (select queue back)))), 134819#(or (<= back (+ 22 front)) (= 5 (select queue (+ 22 front)))), 134860#(or (= 5 (select queue (+ 31 front))) (<= back (+ 31 front)))] [2022-03-15 21:52:32,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-03-15 21:52:32,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:32,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-03-15 21:52:32,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7679, Invalid=43171, Unknown=0, NotChecked=0, Total=50850 [2022-03-15 21:52:32,380 INFO L87 Difference]: Start difference. First operand 1787 states and 3661 transitions. Second operand has 131 states, 130 states have (on average 1.7846153846153847) internal successors, (232), 130 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have 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:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:45,267 INFO L93 Difference]: Finished difference Result 3634 states and 7194 transitions. [2022-03-15 21:52:45,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-15 21:52:45,268 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 130 states have (on average 1.7846153846153847) internal successors, (232), 130 states have internal predecessors, (232), 0 states have call successors, (0), 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 72 [2022-03-15 21:52:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:45,270 INFO L225 Difference]: With dead ends: 3634 [2022-03-15 21:52:45,270 INFO L226 Difference]: Without dead ends: 2318 [2022-03-15 21:52:45,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14450 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=14078, Invalid=69732, Unknown=0, NotChecked=0, Total=83810 [2022-03-15 21:52:45,274 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 5052 mSDsluCounter, 7802 mSDsCounter, 0 mSdLazyCounter, 7181 mSolverCounterSat, 1589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5052 SdHoareTripleChecker+Valid, 3362 SdHoareTripleChecker+Invalid, 8770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1589 IncrementalHoareTripleChecker+Valid, 7181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:45,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5052 Valid, 3362 Invalid, 8770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1589 Valid, 7181 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-03-15 21:52:45,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2022-03-15 21:52:45,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 175. [2022-03-15 21:52:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.9827586206896552) internal successors, (345), 174 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have 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:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 345 transitions. [2022-03-15 21:52:45,283 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 345 transitions. Word has length 72 [2022-03-15 21:52:45,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:45,283 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 345 transitions. [2022-03-15 21:52:45,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 130 states have (on average 1.7846153846153847) internal successors, (232), 130 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have 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:45,283 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 345 transitions. [2022-03-15 21:52:45,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-03-15 21:52:45,284 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:45,284 INFO L514 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:45,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:45,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-03-15 21:52:45,484 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:52:45,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:45,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1900587607, now seen corresponding path program 64 times [2022-03-15 21:52:45,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:45,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384521006] [2022-03-15 21:52:45,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:45,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:45,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:45,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384521006] [2022-03-15 21:52:45,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384521006] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:45,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079263033] [2022-03-15 21:52:45,986 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:52:45,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:45,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:45,987 INFO L229 MonitoredProcess]: Starting monitored process 65 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:45,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-03-15 21:52:46,040 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:52:46,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:46,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-15 21:52:46,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:46,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:46,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:46,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079263033] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:46,298 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:46,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 35 [2022-03-15 21:52:46,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [166375985] [2022-03-15 21:52:46,298 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:46,321 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:46,379 INFO L252 McrAutomatonBuilder]: Finished intersection with 175 states and 275 transitions. [2022-03-15 21:52:46,379 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:46,597 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 6 treesize of output 4 [2022-03-15 21:52:46,605 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 6 treesize of output 4 [2022-03-15 21:52:46,613 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 6 treesize of output 4 [2022-03-15 21:52:46,620 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 6 treesize of output 4 [2022-03-15 21:52:46,627 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 6 treesize of output 4 [2022-03-15 21:52:46,634 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 6 treesize of output 4 [2022-03-15 21:52:46,642 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 6 treesize of output 4 [2022-03-15 21:52:46,648 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 6 treesize of output 4 [2022-03-15 21:52:46,656 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 6 treesize of output 4 [2022-03-15 21:52:46,664 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 6 treesize of output 4 [2022-03-15 21:52:46,671 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 6 treesize of output 4 [2022-03-15 21:52:46,678 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 6 treesize of output 4 [2022-03-15 21:52:46,684 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 6 treesize of output 4 [2022-03-15 21:52:46,692 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 6 treesize of output 4 [2022-03-15 21:52:46,700 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 6 treesize of output 4 [2022-03-15 21:52:46,707 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 6 treesize of output 4 [2022-03-15 21:52:46,715 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 6 treesize of output 4 [2022-03-15 21:52:46,721 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 6 treesize of output 4 [2022-03-15 21:52:46,729 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 6 treesize of output 4 [2022-03-15 21:52:46,736 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 6 treesize of output 4 [2022-03-15 21:52:46,744 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 6 treesize of output 4 [2022-03-15 21:52:46,751 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 6 treesize of output 4 [2022-03-15 21:52:46,758 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 6 treesize of output 4 [2022-03-15 21:52:46,764 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 6 treesize of output 4 [2022-03-15 21:52:46,773 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 6 treesize of output 4 [2022-03-15 21:52:46,780 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 6 treesize of output 4 [2022-03-15 21:52:46,787 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 6 treesize of output 4 [2022-03-15 21:52:46,795 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 6 treesize of output 4 [2022-03-15 21:52:46,806 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 6 treesize of output 4 [2022-03-15 21:52:46,814 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 6 treesize of output 4 [2022-03-15 21:52:46,822 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 6 treesize of output 4 [2022-03-15 21:52:46,828 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 6 treesize of output 4 [2022-03-15 21:52:46,837 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:52:46,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:52:46,837 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:46,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:52:46,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:52:46,838 INFO L87 Difference]: Start difference. First operand 175 states and 345 transitions. Second operand has 36 states, 36 states have (on average 4.777777777777778) internal successors, (172), 35 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have 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,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:47,062 INFO L93 Difference]: Finished difference Result 2124 states and 4171 transitions. [2022-03-15 21:52:47,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:52:47,063 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.777777777777778) internal successors, (172), 35 states have internal predecessors, (172), 0 states have call successors, (0), 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 73 [2022-03-15 21:52:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:47,065 INFO L225 Difference]: With dead ends: 2124 [2022-03-15 21:52:47,065 INFO L226 Difference]: Without dead ends: 2057 [2022-03-15 21:52:47,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:52:47,065 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 298 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:47,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 185 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:52:47,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2022-03-15 21:52:47,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 1892. [2022-03-15 21:52:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1891 states have (on average 2.04865150713908) internal successors, (3874), 1891 states have internal predecessors, (3874), 0 states have call successors, (0), 0 states have 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,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 3874 transitions. [2022-03-15 21:52:47,082 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 3874 transitions. Word has length 73 [2022-03-15 21:52:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:47,082 INFO L470 AbstractCegarLoop]: Abstraction has 1892 states and 3874 transitions. [2022-03-15 21:52:47,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.777777777777778) internal successors, (172), 35 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have 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,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 3874 transitions. [2022-03-15 21:52:47,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-03-15 21:52:47,084 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:47,084 INFO L514 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:47,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:47,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:47,285 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:52:47,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:47,285 INFO L85 PathProgramCache]: Analyzing trace with hash 356096662, now seen corresponding path program 65 times [2022-03-15 21:52:47,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:47,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739677604] [2022-03-15 21:52:47,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:47,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:49,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:49,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739677604] [2022-03-15 21:52:49,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739677604] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:49,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276391143] [2022-03-15 21:52:49,259 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:52:49,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:49,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:49,260 INFO L229 MonitoredProcess]: Starting monitored process 66 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:49,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-03-15 21:52:49,334 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-03-15 21:52:49,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:49,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-15 21:52:49,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:54,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:52:54,747 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 7 [2022-03-15 21:52:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 528 proven. 594 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:54,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:59,458 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-15 21:52:59,459 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 12 treesize of output 11 [2022-03-15 21:52:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 496 proven. 626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:59,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276391143] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:59,520 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:59,520 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 166 [2022-03-15 21:52:59,520 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1711433272] [2022-03-15 21:52:59,520 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:59,526 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:59,628 INFO L252 McrAutomatonBuilder]: Finished intersection with 177 states and 278 transitions. [2022-03-15 21:52:59,629 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:14,670 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 66 new interpolants: [145972#(or (= 5 (select queue (+ front 18))) (<= back (+ front 18))), 145983#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 146008#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 146014#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 28)))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 145966#(or (= (select queue (+ front 12)) 5) (<= back (+ front 12))), 145962#(or (= 5 (select queue (+ front 8))) (<= back (+ front 8))), 145986#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 146007#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 145984#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 146012#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 145963#(or (<= back (+ 9 front)) (= 5 (select queue (+ 9 front)))), 146010#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 145958#(or (<= back (+ front 4)) (= (select queue (+ front 4)) 5)), 146006#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 145960#(or (= 5 (select queue (+ 6 front))) (<= back (+ 6 front))), 145718#(or (not (< front back)) (= (select queue front) 5)), 145997#(or (<= back (+ 29 front)) (= 5 (select queue (+ 29 front)))), 145995#(or (<= back (+ front 27)) (= 5 (select queue (+ front 27)))), 146013#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 146018#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ 30 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ 32 back)) 5)) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ 29 back)))) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 28)))) (not (= 5 (select queue (+ back 31)))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 145964#(or (<= back (+ front 10)) (= (select queue (+ front 10)) 5)), 145973#(or (= (select queue (+ 19 front)) 5) (<= back (+ 19 front))), 145957#(or (<= back (+ 3 front)) (= 5 (select queue (+ 3 front)))), 146015#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ 29 back)))) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 28)))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 145994#(or (= 5 (select queue (+ front 26))) (<= back (+ front 26))), 146005#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 146016#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ 30 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ 29 back)))) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 28)))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 145993#(or (<= back (+ front 25)) (= 5 (select queue (+ front 25)))), 145980#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= 5 (select queue back)))), 145971#(or (<= back (+ front 17)) (= 5 (select queue (+ front 17)))), 145970#(or (= 5 (select queue (+ 16 front))) (<= back (+ 16 front))), 145999#(or (= 5 (select queue (+ 31 front))) (<= back (+ 31 front))), 145976#(or (<= back (+ 22 front)) (= 5 (select queue (+ 22 front)))), 145965#(or (<= back (+ front 11)) (= (select queue (+ front 11)) 5)), 146011#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 145992#(or (= 5 (select queue (+ front 24))) (<= back (+ front 24))), 145990#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 145956#(or (= 5 (select queue (+ 2 front))) (<= back (+ 2 front))), 146009#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ back 20)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 145982#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue back)))), 145969#(or (<= back (+ front 15)) (= 5 (select queue (+ front 15)))), 145978#(or (not (= 5 (select queue (+ back 1)))) (= 5 (select queue (+ 32 front))) (not (= 5 (select queue back)))), 145968#(or (<= back (+ 14 front)) (= (select queue (+ 14 front)) 5)), 145955#(or (<= back (+ front 1)) (= 5 (select queue (+ front 1)))), 146019#(or (<= back (+ 32 front)) (= 5 (select queue (+ 32 front)))), 145991#(or (<= back (+ 23 front)) (= 5 (select queue (+ 23 front)))), 145985#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 145961#(or (<= back (+ 7 front)) (= 5 (select queue (+ 7 front)))), 145975#(or (<= back (+ 21 front)) (= 5 (select queue (+ 21 front)))), 146003#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 146001#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 146002#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 145998#(or (= (select queue (+ 30 front)) 5) (<= back (+ 30 front))), 145974#(or (<= back (+ front 20)) (= 5 (select queue (+ front 20)))), 146000#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 145959#(or (<= back (+ 5 front)) (= (select queue (+ 5 front)) 5)), 146017#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= 5 (select queue (+ 21 back)))) (not (= 5 (select queue (+ 30 back)))) (not (= 5 (select queue (+ back 20)))) (not (= 5 (select queue (+ back 24)))) (not (= (select queue (+ 23 back)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 22 back)))) (not (= (select queue (+ back 25)) 5)) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= 5 (select queue (+ 29 back)))) (not (= 5 (select queue (+ back 27)))) (not (= (select queue (+ 6 back)) 5)) (not (= (select queue (+ back 26)) 5)) (not (= 5 (select queue (+ back 28)))) (not (= 5 (select queue (+ back 31)))) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue (+ 19 back)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 145987#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back)))), 145988#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 145979#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= 5 (select queue back)))), 146004#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue (+ back 13)))) (not (= 5 (select queue (+ back 18)))) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ 14 back)))) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= 5 (select queue (+ 16 back)))) (not (= 5 (select queue (+ back 17)))) (not (= (select queue (+ back 15)) 5)) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 145989#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 5 back)))) (not (= (select queue (+ 7 back)) 5)) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= (select queue (+ back 10)) 5)) (not (= 5 (select queue (+ back 8)))) (not (= 5 (select queue (+ 9 back)))) (not (= (select queue (+ 6 back)) 5)) (not (= 5 (select queue (+ back 12)))) (not (= 5 (select queue back))) (not (= (select queue (+ back 11)) 5))), 145967#(or (<= back (+ front 13)) (= 5 (select queue (+ front 13)))), 145996#(or (= (select queue (+ front 28)) 5) (<= back (+ front 28))), 145981#(or (not (= 5 (select queue (+ back 1)))) (not (= 5 (select queue (+ 3 back)))) (not (= 5 (select queue (+ 2 back)))) (= 5 (select queue (+ 32 front))) (not (= (select queue (+ back 4)) 5)) (not (= 5 (select queue back)))), 145977#(or (= 5 (select queue (+ 32 front))) (not (= 5 (select queue back))))] [2022-03-15 21:53:14,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 135 states [2022-03-15 21:53:14,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:14,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2022-03-15 21:53:14,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8150, Invalid=45906, Unknown=0, NotChecked=0, Total=54056 [2022-03-15 21:53:14,673 INFO L87 Difference]: Start difference. First operand 1892 states and 3874 transitions. Second operand has 135 states, 134 states have (on average 1.7835820895522387) internal successors, (239), 134 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:53:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:28,482 INFO L93 Difference]: Finished difference Result 3846 states and 7616 transitions. [2022-03-15 21:53:28,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-15 21:53:28,483 INFO L78 Accepts]: Start accepts. Automaton has has 135 states, 134 states have (on average 1.7835820895522387) internal successors, (239), 134 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) Word has length 74 [2022-03-15 21:53:28,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:28,486 INFO L225 Difference]: With dead ends: 3846 [2022-03-15 21:53:28,486 INFO L226 Difference]: Without dead ends: 2456 [2022-03-15 21:53:28,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15380 ImplicationChecksByTransitivity, 33.2s TimeCoverageRelationStatistics Valid=14947, Invalid=74155, Unknown=0, NotChecked=0, Total=89102 [2022-03-15 21:53:28,489 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 5246 mSDsluCounter, 8342 mSDsCounter, 0 mSdLazyCounter, 7577 mSolverCounterSat, 1601 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5246 SdHoareTripleChecker+Valid, 3607 SdHoareTripleChecker+Invalid, 9178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1601 IncrementalHoareTripleChecker+Valid, 7577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:28,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5246 Valid, 3607 Invalid, 9178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1601 Valid, 7577 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-03-15 21:53:28,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2022-03-15 21:53:28,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 180. [2022-03-15 21:53:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.9832402234636872) internal successors, (355), 179 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have 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:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 355 transitions. [2022-03-15 21:53:28,498 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 355 transitions. Word has length 74 [2022-03-15 21:53:28,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:28,498 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 355 transitions. [2022-03-15 21:53:28,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 135 states, 134 states have (on average 1.7835820895522387) internal successors, (239), 134 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:53:28,498 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 355 transitions. [2022-03-15 21:53:28,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-03-15 21:53:28,499 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:28,499 INFO L514 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:28,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-03-15 21:53:28,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-03-15 21:53:28,699 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:53:28,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:28,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1845161565, now seen corresponding path program 66 times [2022-03-15 21:53:28,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:28,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493133339] [2022-03-15 21:53:28,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:28,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:29,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:29,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493133339] [2022-03-15 21:53:29,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493133339] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:29,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607865429] [2022-03-15 21:53:29,314 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:53:29,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:29,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:29,315 INFO L229 MonitoredProcess]: Starting monitored process 67 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:29,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-03-15 21:53:29,376 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-03-15 21:53:29,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:29,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-15 21:53:29,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:29,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:29,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607865429] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:29,662 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:29,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 36 [2022-03-15 21:53:29,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1856532259] [2022-03-15 21:53:29,662 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:29,669 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:29,764 INFO L252 McrAutomatonBuilder]: Finished intersection with 180 states and 283 transitions. [2022-03-15 21:53:29,764 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:29,930 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 6 treesize of output 4 [2022-03-15 21:53:29,937 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 6 treesize of output 4 [2022-03-15 21:53:29,945 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 6 treesize of output 4 [2022-03-15 21:53:29,953 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 6 treesize of output 4 [2022-03-15 21:53:29,960 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 6 treesize of output 4 [2022-03-15 21:53:29,968 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 6 treesize of output 4 [2022-03-15 21:53:29,974 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 6 treesize of output 4 [2022-03-15 21:53:29,983 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 6 treesize of output 4 [2022-03-15 21:53:29,989 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 6 treesize of output 4 [2022-03-15 21:53:29,998 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 6 treesize of output 4 [2022-03-15 21:53:30,006 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 6 treesize of output 4 [2022-03-15 21:53:30,014 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 6 treesize of output 4 [2022-03-15 21:53:30,021 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 6 treesize of output 4 [2022-03-15 21:53:30,028 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 6 treesize of output 4 [2022-03-15 21:53:30,036 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 6 treesize of output 4 [2022-03-15 21:53:30,044 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 6 treesize of output 4 [2022-03-15 21:53:30,052 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 6 treesize of output 4 [2022-03-15 21:53:30,060 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 6 treesize of output 4 [2022-03-15 21:53:30,066 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 6 treesize of output 4 [2022-03-15 21:53:30,076 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 6 treesize of output 4 [2022-03-15 21:53:30,086 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 6 treesize of output 4 [2022-03-15 21:53:30,097 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 6 treesize of output 4 [2022-03-15 21:53:30,108 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 6 treesize of output 4 [2022-03-15 21:53:30,115 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 6 treesize of output 4 [2022-03-15 21:53:30,122 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 6 treesize of output 4 [2022-03-15 21:53:30,131 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 6 treesize of output 4 [2022-03-15 21:53:30,223 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 6 treesize of output 4 [2022-03-15 21:53:30,231 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 6 treesize of output 4 [2022-03-15 21:53:30,238 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 6 treesize of output 4 [2022-03-15 21:53:30,246 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 6 treesize of output 4 [2022-03-15 21:53:30,254 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 6 treesize of output 4 [2022-03-15 21:53:30,274 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 6 treesize of output 4 [2022-03-15 21:53:30,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:53:30,283 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:53:30,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 21:53:30,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:30,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 21:53:30,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:53:30,284 INFO L87 Difference]: Start difference. First operand 180 states and 355 transitions. Second operand has 37 states, 37 states have (on average 4.783783783783784) internal successors, (177), 36 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have 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:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:30,509 INFO L93 Difference]: Finished difference Result 2239 states and 4399 transitions. [2022-03-15 21:53:30,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 21:53:30,509 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.783783783783784) internal successors, (177), 36 states have internal predecessors, (177), 0 states have call successors, (0), 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 75 [2022-03-15 21:53:30,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:30,512 INFO L225 Difference]: With dead ends: 2239 [2022-03-15 21:53:30,512 INFO L226 Difference]: Without dead ends: 2170 [2022-03-15 21:53:30,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 284 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:53:30,513 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 375 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:30,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 159 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:53:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2022-03-15 21:53:30,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2000. [2022-03-15 21:53:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1999 states have (on average 2.0475237618809405) internal successors, (4093), 1999 states have internal predecessors, (4093), 0 states have call successors, (0), 0 states have 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:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 4093 transitions. [2022-03-15 21:53:30,539 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 4093 transitions. Word has length 75 [2022-03-15 21:53:30,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:30,539 INFO L470 AbstractCegarLoop]: Abstraction has 2000 states and 4093 transitions. [2022-03-15 21:53:30,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.783783783783784) internal successors, (177), 36 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have 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:30,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 4093 transitions. [2022-03-15 21:53:30,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-15 21:53:30,541 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:30,542 INFO L514 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:30,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-03-15 21:53:30,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-03-15 21:53:30,748 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:53:30,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:30,748 INFO L85 PathProgramCache]: Analyzing trace with hash -42275294, now seen corresponding path program 67 times [2022-03-15 21:53:30,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:30,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322361017] [2022-03-15 21:53:30,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:30,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:32,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:32,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:32,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322361017] [2022-03-15 21:53:32,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322361017] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:32,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083884650] [2022-03-15 21:53:32,897 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:53:32,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:32,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:32,898 INFO L229 MonitoredProcess]: Starting monitored process 68 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:32,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-03-15 21:53:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:32,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 139 conjunts are in the unsatisfiable core [2022-03-15 21:53:32,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:33,208 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 11 treesize of output 7 [2022-03-15 21:53:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:33,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:33,303 INFO L353 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-03-15 21:53:33,303 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 14 treesize of output 13 [2022-03-15 21:53:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:33,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083884650] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:33,454 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:33,454 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 69 [2022-03-15 21:53:33,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1534809727] [2022-03-15 21:53:33,454 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:33,461 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:33,560 INFO L252 McrAutomatonBuilder]: Finished intersection with 182 states and 286 transitions. [2022-03-15 21:53:33,561 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider Received shutdown request... [2022-03-15 21:53:36,377 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2022-03-15 21:53:36,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-03-15 21:53:36,404 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 21:53:36,405 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:53:36,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-03-15 21:53:36,578 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 34,while PredicateComparison was comparing new predicate (quantifier-free) to 89 known predicates. [2022-03-15 21:53:36,580 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 21:53:36,580 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 21:53:36,581 INFO L732 BasicCegarLoop]: Path program histogram: [67, 1, 1] [2022-03-15 21:53:36,583 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 21:53:36,583 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 21:53:36,584 INFO L202 PluginConnector]: Adding new model simple-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 09:53:36 BasicIcfg [2022-03-15 21:53:36,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 21:53:36,584 INFO L158 Benchmark]: Toolchain (without parser) took 789382.39ms. Allocated memory was 207.6MB in the beginning and 750.8MB in the end (delta: 543.2MB). Free memory was 164.6MB in the beginning and 155.7MB in the end (delta: 8.9MB). Peak memory consumption was 553.3MB. Max. memory is 8.0GB. [2022-03-15 21:53:36,584 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 207.6MB. Free memory is still 165.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:53:36,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.31ms. Allocated memory is still 207.6MB. Free memory was 164.6MB in the beginning and 163.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 21:53:36,585 INFO L158 Benchmark]: Boogie Preprocessor took 18.99ms. Allocated memory is still 207.6MB. Free memory was 163.1MB in the beginning and 162.2MB in the end (delta: 919.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:53:36,585 INFO L158 Benchmark]: RCFGBuilder took 219.04ms. Allocated memory is still 207.6MB. Free memory was 162.1MB in the beginning and 153.3MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-03-15 21:53:36,585 INFO L158 Benchmark]: TraceAbstraction took 789107.80ms. Allocated memory was 207.6MB in the beginning and 750.8MB in the end (delta: 543.2MB). Free memory was 152.8MB in the beginning and 155.7MB in the end (delta: -3.0MB). Peak memory consumption was 540.7MB. Max. memory is 8.0GB. [2022-03-15 21:53:36,585 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.12ms. Allocated memory is still 207.6MB. Free memory is still 165.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.31ms. Allocated memory is still 207.6MB. Free memory was 164.6MB in the beginning and 163.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.99ms. Allocated memory is still 207.6MB. Free memory was 163.1MB in the beginning and 162.2MB in the end (delta: 919.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 219.04ms. Allocated memory is still 207.6MB. Free memory was 162.1MB in the beginning and 153.3MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 789107.80ms. Allocated memory was 207.6MB in the beginning and 750.8MB in the end (delta: 543.2MB). Free memory was 152.8MB in the beginning and 155.7MB in the end (delta: -3.0MB). Peak memory consumption was 540.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 20 PlacesBefore, 18 PlacesAfterwards, 15 TransitionsBefore, 13 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 18 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 18, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, 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: 46]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 34,while PredicateComparison was comparing new predicate (quantifier-free) to 89 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 34,while PredicateComparison was comparing new predicate (quantifier-free) to 89 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 34,while PredicateComparison was comparing new predicate (quantifier-free) to 89 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 20 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 789.0s, OverallIterations: 69, TraceHistogramMax: 34, PathProgramHistogramMax: 67, EmptinessCheckTime: 0.1s, AutomataDifference: 135.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68479 SdHoareTripleChecker+Valid, 47.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68479 mSDsluCounter, 48269 SdHoareTripleChecker+Invalid, 39.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 109627 mSDsCounter, 20279 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100728 IncrementalHoareTripleChecker+Invalid, 121007 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20279 mSolverCounterUnsat, 2478 mSDtfsCounter, 100728 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12584 GetRequests, 7724 SyntacticMatches, 151 SemanticMatches, 4709 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100259 ImplicationChecksByTransitivity, 644.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2000occurred in iteration=68, InterpolantAutomatonStates: 1887, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 68 MinimizatonAttempts, 29674 StatesRemovedByMinimization, 65 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 96.0s InterpolantComputationTime, 5627 NumberOfCodeBlocks, 5627 NumberOfCodeBlocksAsserted, 450 NumberOfCheckSat, 8232 ConstructedInterpolants, 476 QuantifiedInterpolants, 54563 SizeOfPredicates, 82 NumberOfNonLiveVariables, 11649 ConjunctsInSsa, 3156 ConjunctsInUnsatCore, 200 InterpolantComputations, 2 PerfectInterpolantSequences, 25918/80323 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