/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/multiply-verify.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:12:53,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:12:53,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:12:53,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:12:53,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:12:53,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:12:53,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:12:53,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:12:53,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:12:53,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:12:53,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:12:53,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:12:53,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:12:53,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:12:53,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:12:53,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:12:53,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:12:53,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:12:53,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:12:53,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:12:53,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:12:53,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:12:53,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:12:53,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:12:53,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:12:53,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:12:53,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:12:53,923 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:12:53,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:12:53,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:12:53,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:12:53,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:12:53,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:12:53,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:12:53,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:12:53,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:12:53,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:12:53,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:12:53,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:12:53,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:12:53,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:12:53,929 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 22:12:53,944 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:12:53,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:12:53,945 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:12:53,945 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:12:53,946 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:12:53,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:12:53,946 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:12:53,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:12:53,946 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:12:53,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:12:53,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:12:53,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:12:53,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:12:53,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:12:53,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:12:53,947 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:12:53,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:12:53,947 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:12:53,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:12:53,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:12:53,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:12:53,948 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:12:53,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:12:53,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:12:53,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:12:53,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:12:53,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:12:53,948 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:12:53,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:12:53,949 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:12:53,949 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:12:53,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:12:53,950 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 22:12:54,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:12:54,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:12:54,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:12:54,150 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:12:54,151 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:12:54,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/multiply-verify.wvr.bpl [2022-03-15 22:12:54,152 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/multiply-verify.wvr.bpl' [2022-03-15 22:12:54,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:12:54,177 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:12:54,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:12:54,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:12:54,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:12:54,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:12:54" (1/1) ... [2022-03-15 22:12:54,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:12:54" (1/1) ... [2022-03-15 22:12:54,199 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:12:54,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:12:54,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:12:54,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:12:54,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:12:54,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:12:54" (1/1) ... [2022-03-15 22:12:54,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:12:54" (1/1) ... [2022-03-15 22:12:54,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:12:54" (1/1) ... [2022-03-15 22:12:54,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:12:54" (1/1) ... [2022-03-15 22:12:54,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:12:54" (1/1) ... [2022-03-15 22:12:54,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:12:54" (1/1) ... [2022-03-15 22:12:54,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:12:54" (1/1) ... [2022-03-15 22:12:54,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:12:54,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:12:54,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:12:54,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:12:54,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:12:54" (1/1) ... [2022-03-15 22:12:54,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:12:54,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:12:54,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 22:12:54,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 22:12:54,268 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:12:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:12:54,268 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:12:54,268 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:12:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:12:54,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:12:54,269 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:12:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:12:54,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:12:54,269 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 22:12:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 22:12:54,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 22:12:54,269 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 22:12:54,303 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:12:54,304 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:12:54,370 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:12:54,378 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:12:54,379 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:12:54,380 INFO L202 PluginConnector]: Adding new model multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:12:54 BoogieIcfgContainer [2022-03-15 22:12:54,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:12:54,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:12:54,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:12:54,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:12:54,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:12:54" (1/2) ... [2022-03-15 22:12:54,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3223fa18 and model type multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:12:54, skipping insertion in model container [2022-03-15 22:12:54,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:12:54" (2/2) ... [2022-03-15 22:12:54,386 INFO L111 eAbstractionObserver]: Analyzing ICFG multiply-verify.wvr.bpl [2022-03-15 22:12:54,389 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:12:54,389 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:12:54,390 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:12:54,390 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:12:54,414 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 22:12:54,442 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:12:54,446 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 22:12:54,447 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 22:12:54,454 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:12:54,464 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 33 transitions, 90 flow [2022-03-15 22:12:54,469 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 90 flow [2022-03-15 22:12:54,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 90 flow [2022-03-15 22:12:54,486 INFO L129 PetriNetUnfolder]: 2/30 cut-off events. [2022-03-15 22:12:54,487 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 22:12:54,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 2/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2022-03-15 22:12:54,490 INFO L116 LiptonReduction]: Number of co-enabled transitions 300 [2022-03-15 22:12:54,795 INFO L131 LiptonReduction]: Checked pairs total: 255 [2022-03-15 22:12:54,795 INFO L133 LiptonReduction]: Total number of compositions: 15 [2022-03-15 22:12:54,800 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 19 transitions, 62 flow [2022-03-15 22:12:54,811 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 42 states, 41 states have (on average 2.4390243902439024) internal successors, (100), 41 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:12:54,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 41 states have (on average 2.4390243902439024) internal successors, (100), 41 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:12:54,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:12:54,817 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:12:54,817 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:12:54,817 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:12:54,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:12:54,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1541577784, now seen corresponding path program 1 times [2022-03-15 22:12:54,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:12:54,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404223410] [2022-03-15 22:12:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:12:54,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:12:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:54,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:12:54,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404223410] [2022-03-15 22:12:54,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404223410] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:12:54,959 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:12:54,959 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:12:54,960 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [509942389] [2022-03-15 22:12:54,963 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:12:54,968 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:12:54,999 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 44 transitions. [2022-03-15 22:12:54,999 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:12:55,249 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [132#(not (= end (+ 2 start))), 133#(not (= end (+ start 1))), 134#(<= end start)] [2022-03-15 22:12:55,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 22:12:55,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:12:55,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 22:12:55,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-03-15 22:12:55,266 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 2.4390243902439024) internal successors, (100), 41 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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 22:12:55,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:12:55,316 INFO L93 Difference]: Finished difference Result 32 states and 67 transitions. [2022-03-15 22:12:55,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 22:12:55,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 22:12:55,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:12:55,325 INFO L225 Difference]: With dead ends: 32 [2022-03-15 22:12:55,326 INFO L226 Difference]: Without dead ends: 32 [2022-03-15 22:12:55,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-03-15 22:12:55,332 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 23 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:12:55,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 1 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:12:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-15 22:12:55,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-03-15 22:12:55,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:12:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 67 transitions. [2022-03-15 22:12:55,362 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 67 transitions. Word has length 13 [2022-03-15 22:12:55,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:12:55,362 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 67 transitions. [2022-03-15 22:12:55,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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 22:12:55,363 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 67 transitions. [2022-03-15 22:12:55,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:12:55,364 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:12:55,364 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:12:55,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:12:55,365 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:12:55,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:12:55,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1738659664, now seen corresponding path program 2 times [2022-03-15 22:12:55,367 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:12:55,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285333901] [2022-03-15 22:12:55,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:12:55,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:12:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:55,527 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:12:55,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285333901] [2022-03-15 22:12:55,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285333901] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:12:55,530 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:12:55,530 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 22:12:55,531 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [871786918] [2022-03-15 22:12:55,531 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:12:55,532 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:12:55,535 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 43 transitions. [2022-03-15 22:12:55,535 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:12:55,920 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [240#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) 0))), 239#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (= (select queue start) x2) (not (= (select queue end) x1)))), 241#(and (or (not (= (select queue end) 0)) (< start (+ end 1))) (or (= (select queue start) x2) (not (= (select queue end) 0))) (or (not (= (select queue end) 0)) (<= end start))), 242#(and (or (not (= (select queue end) 0)) (< start (+ end 1))) (or (not (= (select queue end) 0)) (<= end start)))] [2022-03-15 22:12:55,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 22:12:55,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:12:55,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 22:12:55,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-03-15 22:12:55,922 INFO L87 Difference]: Start difference. First operand 32 states and 67 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:12:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:12:56,142 INFO L93 Difference]: Finished difference Result 61 states and 142 transitions. [2022-03-15 22:12:56,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 22:12:56,142 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 22:12:56,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:12:56,145 INFO L225 Difference]: With dead ends: 61 [2022-03-15 22:12:56,145 INFO L226 Difference]: Without dead ends: 53 [2022-03-15 22:12:56,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-03-15 22:12:56,147 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:12:56,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 2 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:12:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-03-15 22:12:56,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2022-03-15 22:12:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 2.311111111111111) internal successors, (104), 45 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:12:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 104 transitions. [2022-03-15 22:12:56,158 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 104 transitions. Word has length 13 [2022-03-15 22:12:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:12:56,159 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 104 transitions. [2022-03-15 22:12:56,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:12:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 104 transitions. [2022-03-15 22:12:56,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:12:56,160 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:12:56,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:12:56,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:12:56,160 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:12:56,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:12:56,160 INFO L85 PathProgramCache]: Analyzing trace with hash -154914892, now seen corresponding path program 3 times [2022-03-15 22:12:56,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:12:56,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665834041] [2022-03-15 22:12:56,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:12:56,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:12:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:56,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:12:56,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665834041] [2022-03-15 22:12:56,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665834041] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:12:56,230 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:12:56,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 22:12:56,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1329369064] [2022-03-15 22:12:56,230 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:12:56,231 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:12:56,233 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 37 transitions. [2022-03-15 22:12:56,233 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:12:56,345 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [412#(and (= (select queue start) 0) (<= end (+ start 1)) (< start end)), 413#(and (= end start) (= x2 0))] [2022-03-15 22:12:56,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:12:56,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:12:56,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:12:56,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-03-15 22:12:56,346 INFO L87 Difference]: Start difference. First operand 46 states and 104 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 22:12:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:12:56,462 INFO L93 Difference]: Finished difference Result 67 states and 152 transitions. [2022-03-15 22:12:56,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 22:12:56,463 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 22:12:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:12:56,463 INFO L225 Difference]: With dead ends: 67 [2022-03-15 22:12:56,463 INFO L226 Difference]: Without dead ends: 59 [2022-03-15 22:12:56,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-03-15 22:12:56,464 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 24 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:12:56,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 2 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:12:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-15 22:12:56,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2022-03-15 22:12:56,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 49 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:12:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 110 transitions. [2022-03-15 22:12:56,468 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 110 transitions. Word has length 13 [2022-03-15 22:12:56,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:12:56,469 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 110 transitions. [2022-03-15 22:12:56,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 22:12:56,469 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 110 transitions. [2022-03-15 22:12:56,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:12:56,470 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:12:56,470 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:12:56,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 22:12:56,470 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:12:56,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:12:56,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2004926927, now seen corresponding path program 1 times [2022-03-15 22:12:56,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:12:56,471 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318550393] [2022-03-15 22:12:56,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:12:56,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:12:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:56,491 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 22:12:56,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:12:56,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318550393] [2022-03-15 22:12:56,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318550393] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:12:56,492 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:12:56,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 22:12:56,492 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1753076235] [2022-03-15 22:12:56,492 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:12:56,493 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:12:56,496 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 58 transitions. [2022-03-15 22:12:56,496 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:12:56,642 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [592#(< i1 A), 593#(< 0 A), 595#(or (< 0 A) (<= A i2)), 596#(or (<= A 0) (< i1 A)), 594#(or (<= A i2) (< i1 A))] [2022-03-15 22:12:56,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:12:56,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:12:56,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:12:56,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-03-15 22:12:56,643 INFO L87 Difference]: Start difference. First operand 50 states and 110 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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 22:12:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:12:56,799 INFO L93 Difference]: Finished difference Result 70 states and 149 transitions. [2022-03-15 22:12:56,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 22:12:56,799 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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 14 [2022-03-15 22:12:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:12:56,800 INFO L225 Difference]: With dead ends: 70 [2022-03-15 22:12:56,800 INFO L226 Difference]: Without dead ends: 63 [2022-03-15 22:12:56,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:12:56,801 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 38 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:12:56,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 8 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:12:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-03-15 22:12:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 39. [2022-03-15 22:12:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 2.210526315789474) internal successors, (84), 38 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:12:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 84 transitions. [2022-03-15 22:12:56,804 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 84 transitions. Word has length 14 [2022-03-15 22:12:56,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:12:56,804 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 84 transitions. [2022-03-15 22:12:56,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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 22:12:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 84 transitions. [2022-03-15 22:12:56,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:12:56,805 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:12:56,805 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:12:56,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 22:12:56,828 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:12:56,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:12:56,828 INFO L85 PathProgramCache]: Analyzing trace with hash 978792085, now seen corresponding path program 1 times [2022-03-15 22:12:56,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:12:56,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627362234] [2022-03-15 22:12:56,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:12:56,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:12:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:56,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:12:56,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627362234] [2022-03-15 22:12:56,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627362234] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:12:56,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168346843] [2022-03-15 22:12:56,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:12:56,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:12:56,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:12:56,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:12:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:56,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 22:12:56,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:12:56,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 22:12:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:56,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:12:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:56,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168346843] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:12:56,951 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:12:56,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-03-15 22:12:56,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [417059758] [2022-03-15 22:12:56,951 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:12:56,952 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:12:56,954 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 53 transitions. [2022-03-15 22:12:56,954 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:12:57,121 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [850#(or (<= (+ i2 1) A) (< i1 A)), 851#(or (<= 1 A) (< i1 A)), 852#(or (<= (+ i2 1) A) (< (+ i1 1) A) (<= A i1)), 853#(or (<= 1 A) (< (+ i1 1) A) (<= A i1)), 854#(or (< 1 A) (<= (+ i2 1) A) (<= A 0))] [2022-03-15 22:12:57,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:12:57,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:12:57,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:12:57,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-15 22:12:57,122 INFO L87 Difference]: Start difference. First operand 39 states and 84 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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 22:12:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:12:57,292 INFO L93 Difference]: Finished difference Result 93 states and 190 transitions. [2022-03-15 22:12:57,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 22:12:57,292 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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 14 [2022-03-15 22:12:57,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:12:57,293 INFO L225 Difference]: With dead ends: 93 [2022-03-15 22:12:57,293 INFO L226 Difference]: Without dead ends: 93 [2022-03-15 22:12:57,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2022-03-15 22:12:57,294 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 90 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:12:57,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 6 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:12:57,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-03-15 22:12:57,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 50. [2022-03-15 22:12:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 2.4285714285714284) internal successors, (119), 49 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:12:57,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 119 transitions. [2022-03-15 22:12:57,298 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 119 transitions. Word has length 14 [2022-03-15 22:12:57,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:12:57,298 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 119 transitions. [2022-03-15 22:12:57,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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 22:12:57,298 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 119 transitions. [2022-03-15 22:12:57,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:12:57,299 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:12:57,299 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:12:57,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 22:12:57,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:12:57,515 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:12:57,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:12:57,515 INFO L85 PathProgramCache]: Analyzing trace with hash -157500079, now seen corresponding path program 2 times [2022-03-15 22:12:57,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:12:57,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316574597] [2022-03-15 22:12:57,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:12:57,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:12:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:57,537 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 22:12:57,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:12:57,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316574597] [2022-03-15 22:12:57,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316574597] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:12:57,537 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:12:57,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 22:12:57,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [777769977] [2022-03-15 22:12:57,537 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:12:57,538 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:12:57,540 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 52 transitions. [2022-03-15 22:12:57,540 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:12:57,625 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1075#(<= A 0), 1074#(<= A i1), 1076#(<= i2 0), 1077#(<= 1 A)] [2022-03-15 22:12:57,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 22:12:57,625 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:12:57,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 22:12:57,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 22:12:57,626 INFO L87 Difference]: Start difference. First operand 50 states and 119 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 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 22:12:57,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:12:57,771 INFO L93 Difference]: Finished difference Result 71 states and 151 transitions. [2022-03-15 22:12:57,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 22:12:57,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 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 14 [2022-03-15 22:12:57,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:12:57,772 INFO L225 Difference]: With dead ends: 71 [2022-03-15 22:12:57,772 INFO L226 Difference]: Without dead ends: 67 [2022-03-15 22:12:57,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:12:57,773 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 56 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:12:57,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 8 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:12:57,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-03-15 22:12:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2022-03-15 22:12:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 2.25531914893617) internal successors, (106), 47 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:12:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 106 transitions. [2022-03-15 22:12:57,776 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 106 transitions. Word has length 14 [2022-03-15 22:12:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:12:57,776 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 106 transitions. [2022-03-15 22:12:57,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 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 22:12:57,776 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 106 transitions. [2022-03-15 22:12:57,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:12:57,776 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:12:57,776 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:12:57,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 22:12:57,777 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:12:57,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:12:57,777 INFO L85 PathProgramCache]: Analyzing trace with hash 346585226, now seen corresponding path program 1 times [2022-03-15 22:12:57,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:12:57,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262080522] [2022-03-15 22:12:57,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:12:57,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:12:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:57,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:57,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:12:57,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262080522] [2022-03-15 22:12:57,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262080522] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:12:57,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902371822] [2022-03-15 22:12:57,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:12:57,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:12:57,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:12:57,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:12:57,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 22:12:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:57,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 22:12:57,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:12:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:57,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:12:58,086 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:12:58,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 52 [2022-03-15 22:12:58,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:58,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902371822] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:12:58,143 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:12:58,143 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-03-15 22:12:58,143 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2002325470] [2022-03-15 22:12:58,143 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:12:58,144 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:12:58,147 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 73 transitions. [2022-03-15 22:12:58,147 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:12:58,922 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [1372#(and (or (not (= (select queue end) B)) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) B)) (<= end start)) (or (not (= (select queue end) B)) (< start (+ end 1)))), 1375#(and (or (not (= (select queue end) B)) (<= end start)) (or (not (= (select queue end) B)) (< start (+ end 1)))), 1373#(and (or (not (= (select queue end) x1)) (= (select queue start) B)) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 1367#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (= (select queue start) x2) (not (= (select queue end) x1)))), 1368#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ x2 B)))), 1369#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) x2) (not (= (select queue end) (+ x1 B))))), 1374#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) B) (not (= (select queue end) (+ x1 B))))), 1371#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 1370#(and (or (not (= (select queue end) B)) (<= end start)) (or (not (= (select queue end) B)) (< start (+ end 1))) (or (= (select queue start) x2) (not (= (select queue end) B))))] [2022-03-15 22:12:58,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 22:12:58,922 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:12:58,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 22:12:58,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:12:58,923 INFO L87 Difference]: Start difference. First operand 48 states and 106 transitions. Second operand has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 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 22:12:59,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:12:59,438 INFO L93 Difference]: Finished difference Result 86 states and 205 transitions. [2022-03-15 22:12:59,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 22:12:59,438 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 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 15 [2022-03-15 22:12:59,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:12:59,439 INFO L225 Difference]: With dead ends: 86 [2022-03-15 22:12:59,439 INFO L226 Difference]: Without dead ends: 78 [2022-03-15 22:12:59,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:12:59,440 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 31 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:12:59,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 2 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:12:59,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-03-15 22:12:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2022-03-15 22:12:59,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.4153846153846152) internal successors, (157), 65 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 22:12:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 157 transitions. [2022-03-15 22:12:59,443 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 157 transitions. Word has length 15 [2022-03-15 22:12:59,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:12:59,444 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 157 transitions. [2022-03-15 22:12:59,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 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 22:12:59,444 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 157 transitions. [2022-03-15 22:12:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:12:59,444 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:12:59,444 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:12:59,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 22:12:59,655 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,SelfDestructingSolverStorable6 [2022-03-15 22:12:59,655 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:12:59,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:12:59,656 INFO L85 PathProgramCache]: Analyzing trace with hash 860432264, now seen corresponding path program 2 times [2022-03-15 22:12:59,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:12:59,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23938499] [2022-03-15 22:12:59,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:12:59,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:12:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:59,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:59,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:12:59,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23938499] [2022-03-15 22:12:59,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23938499] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:12:59,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817263967] [2022-03-15 22:12:59,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:12:59,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:12:59,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:12:59,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:12:59,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 22:12:59,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:12:59,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:12:59,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 22:12:59,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:12:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:59,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:12:59,874 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:12:59,875 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 24 treesize of output 12 [2022-03-15 22:12:59,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:59,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817263967] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:12:59,902 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:12:59,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-03-15 22:12:59,902 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1515756353] [2022-03-15 22:12:59,902 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:12:59,903 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:12:59,906 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 65 transitions. [2022-03-15 22:12:59,906 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:00,247 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [1719#(and (= end start) (= x2 0)), 1715#(and (<= end (+ start 1)) (= (select queue start) (+ x1 B)) (< start end)), 1716#(and (= (select queue start) B) (<= end (+ start 1)) (< start end)), 1718#(and (= x2 B) (= end start)), 1717#(and (= x2 (+ x1 B)) (= end start))] [2022-03-15 22:13:00,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:13:00,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:00,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:13:00,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:13:00,248 INFO L87 Difference]: Start difference. First operand 66 states and 157 transitions. Second operand has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 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 22:13:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:00,597 INFO L93 Difference]: Finished difference Result 106 states and 268 transitions. [2022-03-15 22:13:00,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 22:13:00,598 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 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 15 [2022-03-15 22:13:00,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:00,598 INFO L225 Difference]: With dead ends: 106 [2022-03-15 22:13:00,598 INFO L226 Difference]: Without dead ends: 98 [2022-03-15 22:13:00,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:13:00,599 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:00,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:13:00,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-03-15 22:13:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2022-03-15 22:13:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 2.5324675324675323) internal successors, (195), 77 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 22:13:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 195 transitions. [2022-03-15 22:13:00,603 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 195 transitions. Word has length 15 [2022-03-15 22:13:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:00,603 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 195 transitions. [2022-03-15 22:13:00,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 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 22:13:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 195 transitions. [2022-03-15 22:13:00,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:13:00,604 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:00,604 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:00,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 22:13:00,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:00,819 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:00,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:00,820 INFO L85 PathProgramCache]: Analyzing trace with hash -2071958219, now seen corresponding path program 3 times [2022-03-15 22:13:00,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:00,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655922689] [2022-03-15 22:13:00,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:00,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:00,848 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:00,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655922689] [2022-03-15 22:13:00,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655922689] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:00,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310514870] [2022-03-15 22:13:00,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:13:00,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:00,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:00,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:00,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 22:13:00,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:13:00,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:13:00,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 22:13:00,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:00,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:00,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310514870] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:00,936 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:00,936 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 22:13:00,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [717168055] [2022-03-15 22:13:00,937 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:00,937 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:00,941 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 93 transitions. [2022-03-15 22:13:00,942 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:01,318 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [2109#(or (< 1 A) (<= A (+ i2 1)) (<= A 0)), 2099#(< i1 A), 2102#(or (<= A i2) (< i1 A)), 2105#(or (<= A (+ i2 1)) (< i1 A)), 2101#(or (< 1 A) (<= A 0)), 2108#(or (<= A 1) (< (+ i1 1) A) (<= A i1)), 2100#(or (< (+ i1 1) A) (<= A i1)), 2107#(or (<= A 1) (< i1 A)), 2103#(or (<= A i2) (< (+ i1 1) A) (<= A i1)), 2106#(or (<= A (+ i2 1)) (< (+ i1 1) A) (<= A i1)), 2104#(or (< 1 A) (<= A i2) (<= A 0))] [2022-03-15 22:13:01,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:13:01,319 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:01,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:13:01,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:13:01,319 INFO L87 Difference]: Start difference. First operand 78 states and 195 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:01,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:01,864 INFO L93 Difference]: Finished difference Result 121 states and 289 transitions. [2022-03-15 22:13:01,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 22:13:01,865 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:13:01,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:01,866 INFO L225 Difference]: With dead ends: 121 [2022-03-15 22:13:01,866 INFO L226 Difference]: Without dead ends: 111 [2022-03-15 22:13:01,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=462, Invalid=1430, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:13:01,867 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 81 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:01,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 10 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:13:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-03-15 22:13:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2022-03-15 22:13:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 2.611111111111111) internal successors, (188), 72 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:01,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 188 transitions. [2022-03-15 22:13:01,870 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 188 transitions. Word has length 16 [2022-03-15 22:13:01,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:01,871 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 188 transitions. [2022-03-15 22:13:01,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:01,871 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 188 transitions. [2022-03-15 22:13:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:13:01,871 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:01,871 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:01,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 22:13:02,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:02,087 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:02,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:02,088 INFO L85 PathProgramCache]: Analyzing trace with hash 477600047, now seen corresponding path program 4 times [2022-03-15 22:13:02,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:02,089 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566295836] [2022-03-15 22:13:02,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:02,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:02,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:02,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566295836] [2022-03-15 22:13:02,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566295836] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:02,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410419667] [2022-03-15 22:13:02,120 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:13:02,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:02,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:02,121 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:02,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 22:13:02,145 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:13:02,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:13:02,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 22:13:02,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:02,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:02,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410419667] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:02,211 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:02,211 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 22:13:02,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1938400596] [2022-03-15 22:13:02,211 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:02,212 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:02,215 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 88 transitions. [2022-03-15 22:13:02,215 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:02,648 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [2548#(or (<= (+ i2 1) A) (< i1 A)), 2557#(or (<= 2 A) (< (+ i1 1) A) (<= A i1)), 2550#(or (<= (+ i2 1) A) (< (+ i1 1) A) (<= A i1)), 2553#(or (<= (+ 2 i2) A) (< (+ i1 1) A) (<= A i1)), 2556#(or (<= 2 A) (< i1 A)), 2551#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ i2 1) A)), 2555#(or (< 2 A) (<= A 1) (<= (+ 2 i2) A)), 2549#(or (<= (+ 2 i2) A) (< i1 A)), 2558#(or (<= 2 A) (<= A (+ i1 1)) (< (+ 2 i1) A)), 2554#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 2 i2) A)), 2552#(or (< 2 A) (<= (+ i2 1) A) (<= A 1))] [2022-03-15 22:13:02,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:13:02,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:02,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:13:02,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:13:02,649 INFO L87 Difference]: Start difference. First operand 73 states and 188 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:03,200 INFO L93 Difference]: Finished difference Result 165 states and 393 transitions. [2022-03-15 22:13:03,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 22:13:03,200 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:13:03,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:03,202 INFO L225 Difference]: With dead ends: 165 [2022-03-15 22:13:03,202 INFO L226 Difference]: Without dead ends: 165 [2022-03-15 22:13:03,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=448, Invalid=1358, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:13:03,203 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 145 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:03,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 9 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:13:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-03-15 22:13:03,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 94. [2022-03-15 22:13:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.817204301075269) internal successors, (262), 93 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 262 transitions. [2022-03-15 22:13:03,217 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 262 transitions. Word has length 16 [2022-03-15 22:13:03,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:03,218 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 262 transitions. [2022-03-15 22:13:03,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 262 transitions. [2022-03-15 22:13:03,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:13:03,220 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:03,220 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:03,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 22:13:03,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 22:13:03,438 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:03,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:03,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1253490685, now seen corresponding path program 5 times [2022-03-15 22:13:03,439 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:03,439 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618007212] [2022-03-15 22:13:03,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:03,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:03,464 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:03,464 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618007212] [2022-03-15 22:13:03,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618007212] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:03,464 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404450359] [2022-03-15 22:13:03,464 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:13:03,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:03,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:03,466 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:03,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 22:13:03,488 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:13:03,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:13:03,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 22:13:03,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:03,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:03,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404450359] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:03,555 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:03,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2022-03-15 22:13:03,555 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [919751211] [2022-03-15 22:13:03,555 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:03,556 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:03,559 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 85 transitions. [2022-03-15 22:13:03,559 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:03,829 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [3086#(<= A 1), 3085#(or (<= 0 i1) (<= A i1)), 3090#(or (<= 2 A) (<= A 0)), 3081#(<= A i1), 3088#(or (<= i2 0) (<= A 0)), 3082#(<= A (+ i1 1)), 3083#(or (<= i2 (+ i1 1)) (<= A i1)), 3084#(or (<= A i1) (<= i2 i1)), 3087#(or (<= i2 1) (<= A 0)), 3089#(or (<= A i2) (<= (+ 2 i2) A))] [2022-03-15 22:13:03,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 22:13:03,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:03,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 22:13:03,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:13:03,830 INFO L87 Difference]: Start difference. First operand 94 states and 262 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:04,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:04,633 INFO L93 Difference]: Finished difference Result 171 states and 431 transitions. [2022-03-15 22:13:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:13:04,634 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:13:04,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:04,635 INFO L225 Difference]: With dead ends: 171 [2022-03-15 22:13:04,635 INFO L226 Difference]: Without dead ends: 161 [2022-03-15 22:13:04,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=731, Invalid=2349, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 22:13:04,636 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 120 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:04,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 12 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:13:04,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-03-15 22:13:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 86. [2022-03-15 22:13:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 2.541176470588235) internal successors, (216), 85 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 216 transitions. [2022-03-15 22:13:04,639 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 216 transitions. Word has length 16 [2022-03-15 22:13:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:04,639 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 216 transitions. [2022-03-15 22:13:04,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 216 transitions. [2022-03-15 22:13:04,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:13:04,639 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:04,639 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:04,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 22:13:04,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:04,856 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:04,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:04,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1989501232, now seen corresponding path program 6 times [2022-03-15 22:13:04,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:04,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302208912] [2022-03-15 22:13:04,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:04,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:05,008 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:05,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302208912] [2022-03-15 22:13:05,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302208912] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:05,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953661282] [2022-03-15 22:13:05,008 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:13:05,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:05,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:05,009 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:05,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 22:13:05,035 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 22:13:05,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:13:05,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 22:13:05,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:05,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:13:05,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:13:05,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:13:05,228 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2022-03-15 22:13:05,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:05,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:05,344 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:13:05,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 52 [2022-03-15 22:13:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:05,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953661282] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:05,402 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:05,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2022-03-15 22:13:05,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [994258759] [2022-03-15 22:13:05,402 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:05,403 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:05,407 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 113 transitions. [2022-03-15 22:13:05,407 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:06,975 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [3669#(and (or (= (select queue start) (+ (* 2 B) x2)) (not (= (* 2 B) (select queue end)))) (or (not (= (* 2 B) (select queue end))) (< start (+ end 1))) (or (not (= (* 2 B) (select queue end))) (<= end start))), 3667#(and (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 3668#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 3671#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (* 2 B) (select queue start)) (not (= (select queue end) (+ x1 B))))), 3666#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 2 B) x2)))), 3661#(and (or (= (select queue start) x2) (not (= (* 2 B) (select queue end)))) (or (not (= (* 2 B) (select queue end))) (< start (+ end 1))) (or (not (= (* 2 B) (select queue end))) (<= end start))), 3670#(and (or (not (= (select queue end) x1)) (= (* 2 B) (select queue start))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 3658#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (= (select queue start) x2) (not (= (select queue end) x1)))), 3664#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 3672#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (= (* 2 B) (select queue start)) (not (= (select queue end) (+ (* 2 B) x1))))), 3673#(and (or (not (= (* 2 B) (select queue end))) (< start (+ end 1))) (or (not (= (* 2 B) (select queue end))) (<= end start))), 3665#(and (or (not (= (* 2 B) (select queue end))) (< start (+ end 1))) (or (not (= (* 2 B) (select queue end))) (= (select queue start) (+ x2 B))) (or (not (= (* 2 B) (select queue end))) (<= end start))), 3659#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) x2) (not (= (select queue end) (+ x1 B))))), 3663#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 3660#(and (or (= (select queue start) x2) (not (= (select queue end) (+ (* 2 B) x1)))) (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 3662#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ x2 B))))] [2022-03-15 22:13:06,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:13:06,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:06,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:13:06,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1155, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 22:13:06,976 INFO L87 Difference]: Start difference. First operand 86 states and 216 transitions. Second operand has 28 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:08,316 INFO L93 Difference]: Finished difference Result 165 states and 455 transitions. [2022-03-15 22:13:08,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 22:13:08,325 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:13:08,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:08,327 INFO L225 Difference]: With dead ends: 165 [2022-03-15 22:13:08,327 INFO L226 Difference]: Without dead ends: 157 [2022-03-15 22:13:08,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=261, Invalid=2601, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 22:13:08,328 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:08,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 2 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1829 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:13:08,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-03-15 22:13:08,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 114. [2022-03-15 22:13:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 2.690265486725664) internal successors, (304), 113 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 304 transitions. [2022-03-15 22:13:08,334 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 304 transitions. Word has length 17 [2022-03-15 22:13:08,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:08,334 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 304 transitions. [2022-03-15 22:13:08,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:08,334 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 304 transitions. [2022-03-15 22:13:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:13:08,335 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:08,335 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:08,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 22:13:08,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:08,548 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:08,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:08,548 INFO L85 PathProgramCache]: Analyzing trace with hash -598710412, now seen corresponding path program 7 times [2022-03-15 22:13:08,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:08,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459252490] [2022-03-15 22:13:08,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:08,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:08,669 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:08,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459252490] [2022-03-15 22:13:08,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459252490] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:08,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80423562] [2022-03-15 22:13:08,669 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:13:08,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:08,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:08,670 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:08,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 22:13:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:08,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 22:13:08,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:08,856 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:13:08,856 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 59 treesize of output 33 [2022-03-15 22:13:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:08,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:08,932 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:13:08,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 48 [2022-03-15 22:13:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:09,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80423562] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:09,015 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:09,015 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-03-15 22:13:09,015 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [760950023] [2022-03-15 22:13:09,015 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:09,016 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:09,020 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 103 transitions. [2022-03-15 22:13:09,020 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:09,580 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [4223#(and (= x2 (+ (* 2 B) x1)) (= end start)), 4224#(and (= (* 2 B) x2) (= end start)), 4221#(and (= (select queue start) (+ (* 2 B) x1)) (<= end (+ start 1)) (< start end)), 4220#(and (= x2 (+ x1 B)) (= end start)), 4225#(and (= x2 B) (= end start)), 4222#(and (= (* 2 B) (select queue start)) (<= end (+ start 1)) (< start end)), 4226#(and (= end start) (= x2 0)), 4219#(and (<= end (+ start 1)) (= (select queue start) (+ x1 B)) (< start end))] [2022-03-15 22:13:09,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:13:09,581 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:09,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:13:09,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2022-03-15 22:13:09,581 INFO L87 Difference]: Start difference. First operand 114 states and 304 transitions. Second operand has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:10,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:10,366 INFO L93 Difference]: Finished difference Result 227 states and 661 transitions. [2022-03-15 22:13:10,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:13:10,366 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:13:10,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:10,367 INFO L225 Difference]: With dead ends: 227 [2022-03-15 22:13:10,367 INFO L226 Difference]: Without dead ends: 219 [2022-03-15 22:13:10,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=1637, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:13:10,368 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 1868 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:10,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 2 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1868 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:13:10,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-03-15 22:13:10,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 148. [2022-03-15 22:13:10,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 2.836734693877551) internal successors, (417), 147 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 417 transitions. [2022-03-15 22:13:10,372 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 417 transitions. Word has length 17 [2022-03-15 22:13:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:10,373 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 417 transitions. [2022-03-15 22:13:10,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 417 transitions. [2022-03-15 22:13:10,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:13:10,373 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:10,373 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:10,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 22:13:10,589 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,SelfDestructingSolverStorable12 [2022-03-15 22:13:10,590 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:10,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:10,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1613797711, now seen corresponding path program 8 times [2022-03-15 22:13:10,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:10,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381542390] [2022-03-15 22:13:10,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:10,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:10,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:10,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381542390] [2022-03-15 22:13:10,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381542390] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:10,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565886956] [2022-03-15 22:13:10,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:13:10,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:10,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:10,634 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:10,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 22:13:10,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:13:10,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:13:10,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:13:10,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:10,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:10,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565886956] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:10,745 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:10,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2022-03-15 22:13:10,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1456315007] [2022-03-15 22:13:10,745 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:10,746 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:10,752 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 138 transitions. [2022-03-15 22:13:10,752 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:11,396 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [4915#(or (< 2 A) (<= A 1)), 4913#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ 2 i2))), 4909#(or (<= A (+ 2 i2)) (< i1 A)), 4917#(or (< 2 A) (<= A 1) (<= A (+ i2 1))), 4903#(or (<= A i2) (< (+ i1 1) A) (<= A i1)), 4908#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ i2 1))), 4912#(or (<= A 2) (< (+ i1 1) A) (<= A i1)), 4900#(< i1 A), 4901#(or (<= A i2) (< i1 A)), 4902#(or (< (+ i1 1) A) (<= A i1)), 4905#(or (<= A i2) (<= A (+ i1 1)) (< (+ 2 i1) A)), 4914#(or (<= A 2) (<= A (+ i1 1)) (< (+ 2 i1) A)), 4918#(or (< 2 A) (<= A 1) (<= A (+ 2 i2))), 4907#(or (<= A (+ i2 1)) (< (+ i1 1) A) (<= A i1)), 4906#(or (<= A (+ i2 1)) (< i1 A)), 4916#(or (< 2 A) (<= A i2) (<= A 1)), 4911#(or (<= A (+ 2 i2)) (< (+ i1 1) A) (<= A i1)), 4910#(or (<= A 2) (< i1 A)), 4904#(or (<= A (+ i1 1)) (< (+ 2 i1) A))] [2022-03-15 22:13:11,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:13:11,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:11,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:13:11,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:13:11,397 INFO L87 Difference]: Start difference. First operand 148 states and 417 transitions. Second operand has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:12,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:12,393 INFO L93 Difference]: Finished difference Result 279 states and 750 transitions. [2022-03-15 22:13:12,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 22:13:12,394 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:13:12,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:12,395 INFO L225 Difference]: With dead ends: 279 [2022-03-15 22:13:12,395 INFO L226 Difference]: Without dead ends: 264 [2022-03-15 22:13:12,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1164, Invalid=4092, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 22:13:12,396 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 176 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:12,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 15 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:13:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-03-15 22:13:12,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 147. [2022-03-15 22:13:12,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.835616438356164) internal successors, (414), 146 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:12,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 414 transitions. [2022-03-15 22:13:12,401 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 414 transitions. Word has length 18 [2022-03-15 22:13:12,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:12,401 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 414 transitions. [2022-03-15 22:13:12,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:12,401 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 414 transitions. [2022-03-15 22:13:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:13:12,401 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:12,401 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:12,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 22:13:12,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 22:13:12,602 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:12,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:12,602 INFO L85 PathProgramCache]: Analyzing trace with hash -954274667, now seen corresponding path program 9 times [2022-03-15 22:13:12,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:12,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973569595] [2022-03-15 22:13:12,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:12,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:12,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:12,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973569595] [2022-03-15 22:13:12,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973569595] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:12,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653043829] [2022-03-15 22:13:12,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:13:12,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:12,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:12,655 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:12,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 22:13:12,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:13:12,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:13:12,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:13:12,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:12,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:12,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:12,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653043829] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:12,789 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:12,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2022-03-15 22:13:12,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1116059185] [2022-03-15 22:13:12,789 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:12,790 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:12,795 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 133 transitions. [2022-03-15 22:13:12,795 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:13,470 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [5734#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ i2 1) A)), 5738#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 2 i2) A)), 5745#(or (<= (+ 3 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 5749#(or (<= 3 A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 5743#(or (<= (+ 3 i2) A) (< (+ i1 1) A) (<= A i1)), 5735#(or (<= (+ i2 1) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 5742#(or (<= (+ 3 i2) A) (< i1 A)), 5750#(or (< 3 A) (<= A 2) (<= (+ 3 i2) A)), 5748#(or (<= 3 A) (<= A (+ i1 1)) (< (+ 2 i1) A)), 5740#(or (< 3 A) (<= A 2) (<= (+ i2 1) A)), 5747#(or (<= 3 A) (< (+ i1 1) A) (<= A i1)), 5744#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 3 i2) A)), 5737#(or (<= (+ 2 i2) A) (< (+ i1 1) A) (<= A i1)), 5741#(or (< 3 A) (<= A 2) (<= (+ 2 i2) A)), 5746#(or (<= 3 A) (< i1 A)), 5736#(or (<= (+ 2 i2) A) (< i1 A)), 5732#(or (<= (+ i2 1) A) (< i1 A)), 5733#(or (<= (+ i2 1) A) (< (+ i1 1) A) (<= A i1)), 5739#(or (<= (+ 2 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A))] [2022-03-15 22:13:13,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:13:13,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:13,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:13:13,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:13:13,471 INFO L87 Difference]: Start difference. First operand 147 states and 414 transitions. Second operand has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:14,939 INFO L93 Difference]: Finished difference Result 436 states and 1173 transitions. [2022-03-15 22:13:14,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 22:13:14,939 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:13:14,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:14,941 INFO L225 Difference]: With dead ends: 436 [2022-03-15 22:13:14,941 INFO L226 Difference]: Without dead ends: 436 [2022-03-15 22:13:14,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2139 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1460, Invalid=5512, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 22:13:14,943 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 253 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:14,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 16 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:13:14,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-03-15 22:13:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 186. [2022-03-15 22:13:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.9675675675675675) internal successors, (549), 185 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 549 transitions. [2022-03-15 22:13:14,949 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 549 transitions. Word has length 18 [2022-03-15 22:13:14,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:14,949 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 549 transitions. [2022-03-15 22:13:14,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:14,949 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 549 transitions. [2022-03-15 22:13:14,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 22:13:14,949 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:14,949 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:14,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 22:13:15,163 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,SelfDestructingSolverStorable14 [2022-03-15 22:13:15,163 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:15,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:15,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1030259311, now seen corresponding path program 10 times [2022-03-15 22:13:15,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:15,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008228421] [2022-03-15 22:13:15,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:15,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:15,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:15,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008228421] [2022-03-15 22:13:15,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008228421] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:15,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525603247] [2022-03-15 22:13:15,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:13:15,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:15,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:15,205 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:15,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 22:13:15,227 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:13:15,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:13:15,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:13:15,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:15,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:15,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525603247] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:15,305 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:15,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-15 22:13:15,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [859682634] [2022-03-15 22:13:15,305 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:15,306 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:15,311 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 128 transitions. [2022-03-15 22:13:15,311 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:15,842 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [6850#(or (<= 3 A) (<= A 1)), 6841#(<= A (+ 2 i1)), 6840#(or (<= 1 i1) (<= A i1)), 6849#(or (<= 0 i1) (<= A (+ i1 1))), 6834#(<= A (+ i1 1)), 6842#(or (<= A (+ i1 1)) (<= i2 (+ 2 i1))), 6836#(or (<= (+ 3 i2) A) (<= A (+ i2 1))), 6838#(or (<= A i1) (<= i2 i1)), 6848#(or (<= i2 0) (<= A 1)), 6845#(or (<= i2 (+ i1 1)) (<= A (+ i1 1))), 6837#(or (<= i2 (+ i1 1)) (<= A i1)), 6839#(or (<= A i1) (<= (+ i2 1) i1)), 6846#(or (<= A 1) (<= i2 1)), 6847#(or (<= A (+ i1 1)) (<= i2 i1)), 6844#(or (<= i2 2) (<= A 1)), 6835#(or (<= A i2) (<= (+ 2 i2) A)), 6833#(<= A i1), 6843#(<= A 2)] [2022-03-15 22:13:15,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:13:15,843 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:15,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:13:15,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:13:15,843 INFO L87 Difference]: Start difference. First operand 186 states and 549 transitions. Second operand has 27 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:17,361 INFO L93 Difference]: Finished difference Result 342 states and 900 transitions. [2022-03-15 22:13:17,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-03-15 22:13:17,362 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 22:13:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:17,363 INFO L225 Difference]: With dead ends: 342 [2022-03-15 22:13:17,363 INFO L226 Difference]: Without dead ends: 324 [2022-03-15 22:13:17,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2832 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2189, Invalid=7513, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 22:13:17,365 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 214 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:17,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 13 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:13:17,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-03-15 22:13:17,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 126. [2022-03-15 22:13:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.616) internal successors, (327), 125 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 327 transitions. [2022-03-15 22:13:17,369 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 327 transitions. Word has length 18 [2022-03-15 22:13:17,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:17,369 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 327 transitions. [2022-03-15 22:13:17,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 327 transitions. [2022-03-15 22:13:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:13:17,370 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:17,370 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:17,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 22:13:17,583 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,SelfDestructingSolverStorable15 [2022-03-15 22:13:17,583 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:17,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:17,584 INFO L85 PathProgramCache]: Analyzing trace with hash 551058058, now seen corresponding path program 11 times [2022-03-15 22:13:17,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:17,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037595078] [2022-03-15 22:13:17,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:17,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:17,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:17,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037595078] [2022-03-15 22:13:17,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037595078] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:17,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477975413] [2022-03-15 22:13:17,735 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:13:17,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:17,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:17,736 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:17,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 22:13:17,757 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:13:17,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:13:17,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:13:17,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:17,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:13:17,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:13:17,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:13:17,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2022-03-15 22:13:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:17,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:18,099 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:13:18,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 54 [2022-03-15 22:13:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:18,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477975413] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:18,159 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:18,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2022-03-15 22:13:18,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [153685803] [2022-03-15 22:13:18,159 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:18,160 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:18,167 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 163 transitions. [2022-03-15 22:13:18,167 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:20,518 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [7796#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 7801#(and (or (not (= (select queue end) (* 3 B))) (<= end start)) (or (not (= (select queue end) (* 3 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 3 B))) (= (select queue start) x2))), 7781#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (= (select queue start) x2) (not (= (select queue end) x1)))), 7788#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ x2 B))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 7799#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (* 3 B) (select queue start))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 7804#(and (or (not (= (select queue end) (* 3 B))) (<= end start)) (or (not (= (select queue end) (* 3 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 3 B))) (= (select queue start) (+ (* 3 B) x2)))), 7783#(and (or (= (select queue start) x2) (not (= (select queue end) (+ (* 2 B) x1)))) (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 7797#(and (or (not (= (select queue end) x1)) (= (* 3 B) (select queue start))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 7798#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (= (* 3 B) (select queue start)))), 7789#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 2 B) x2)))), 7785#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ x2 B)))), 7793#(and (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 7800#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 3 B) x1) (select queue end))) (= (* 3 B) (select queue start)))), 7794#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 7786#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 7803#(and (or (not (= (select queue end) (* 3 B))) (<= end start)) (or (not (= (select queue end) (* 3 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 3 B))) (= (select queue start) (+ (* 2 B) x2)))), 7782#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) x2) (not (= (select queue end) (+ x1 B))))), 7787#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 7791#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 7792#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 2 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 7790#(and (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 7784#(and (or (= (select queue start) x2) (not (= (+ (* 3 B) x1) (select queue end)))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 7795#(and (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ (* 3 B) x2))) (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 7802#(and (or (not (= (select queue end) (* 3 B))) (<= end start)) (or (not (= (select queue end) (* 3 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 3 B))) (= (select queue start) (+ x2 B)))), 7805#(and (or (not (= (select queue end) (* 3 B))) (<= end start)) (or (not (= (select queue end) (* 3 B))) (< start (+ end 1))))] [2022-03-15 22:13:20,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 22:13:20,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:20,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 22:13:20,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2210, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 22:13:20,519 INFO L87 Difference]: Start difference. First operand 126 states and 327 transitions. Second operand has 39 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:23,322 INFO L93 Difference]: Finished difference Result 246 states and 698 transitions. [2022-03-15 22:13:23,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 22:13:23,323 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 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 19 [2022-03-15 22:13:23,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:23,324 INFO L225 Difference]: With dead ends: 246 [2022-03-15 22:13:23,324 INFO L226 Difference]: Without dead ends: 238 [2022-03-15 22:13:23,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=426, Invalid=5894, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 22:13:23,325 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 43 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 3834 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 3923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:23,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 2 Invalid, 3923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3834 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 22:13:23,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-03-15 22:13:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 160. [2022-03-15 22:13:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 2.742138364779874) internal successors, (436), 159 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 436 transitions. [2022-03-15 22:13:23,329 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 436 transitions. Word has length 19 [2022-03-15 22:13:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:23,329 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 436 transitions. [2022-03-15 22:13:23,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 436 transitions. [2022-03-15 22:13:23,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 22:13:23,330 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:23,330 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:23,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 22:13:23,543 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,SelfDestructingSolverStorable16 [2022-03-15 22:13:23,543 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:23,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:23,544 INFO L85 PathProgramCache]: Analyzing trace with hash 583275080, now seen corresponding path program 12 times [2022-03-15 22:13:23,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:23,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53742920] [2022-03-15 22:13:23,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:23,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:23,669 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:23,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53742920] [2022-03-15 22:13:23,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53742920] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:23,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445757712] [2022-03-15 22:13:23,669 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:13:23,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:23,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:23,670 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:23,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 22:13:23,693 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:13:23,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:13:23,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 22:13:23,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:23,874 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:13:23,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 69 treesize of output 33 [2022-03-15 22:13:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:23,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:23,936 INFO L353 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-03-15 22:13:23,936 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 24 treesize of output 30 [2022-03-15 22:13:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:24,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445757712] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:24,155 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:24,155 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-03-15 22:13:24,155 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [229272942] [2022-03-15 22:13:24,155 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:24,156 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:24,163 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 151 transitions. [2022-03-15 22:13:24,163 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:25,021 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [8578#(and (= x2 (+ (* 2 B) x1)) (= end start)), 8577#(and (= x2 (+ x1 B)) (= end start)), 8583#(and (= (* 2 B) x2) (= end start)), 8582#(and (= end start) (= (* 3 B) x2)), 8585#(and (= end start) (= x2 0)), 8584#(and (= x2 B) (= end start)), 8581#(and (<= end (+ start 1)) (= (* 3 B) (select queue start)) (< start end)), 8579#(and (<= end (+ start 1)) (= (+ (* 3 B) x1) (select queue start)) (< start end)), 8580#(and (= (+ (* 3 B) x1) x2) (= end start)), 8575#(and (<= end (+ start 1)) (= (select queue start) (+ x1 B)) (< start end)), 8576#(and (= (select queue start) (+ (* 2 B) x1)) (<= end (+ start 1)) (< start end))] [2022-03-15 22:13:25,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:13:25,021 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:25,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:13:25,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1478, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 22:13:25,022 INFO L87 Difference]: Start difference. First operand 160 states and 436 transitions. Second operand has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 24 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:26,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:26,501 INFO L93 Difference]: Finished difference Result 340 states and 1018 transitions. [2022-03-15 22:13:26,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 22:13:26,502 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 24 states have internal predecessors, (74), 0 states have call successors, (0), 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 22:13:26,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:26,503 INFO L225 Difference]: With dead ends: 340 [2022-03-15 22:13:26,503 INFO L226 Difference]: Without dead ends: 332 [2022-03-15 22:13:26,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=391, Invalid=4579, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 22:13:26,504 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 36 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 2972 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 3022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:26,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 2 Invalid, 3022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2972 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:13:26,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-03-15 22:13:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 214. [2022-03-15 22:13:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.896713615023474) internal successors, (617), 213 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 617 transitions. [2022-03-15 22:13:26,510 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 617 transitions. Word has length 19 [2022-03-15 22:13:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:26,510 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 617 transitions. [2022-03-15 22:13:26,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 24 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 617 transitions. [2022-03-15 22:13:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 22:13:26,510 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:26,510 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:26,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 22:13:26,719 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,SelfDestructingSolverStorable17 [2022-03-15 22:13:26,719 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:26,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:26,720 INFO L85 PathProgramCache]: Analyzing trace with hash -28267723, now seen corresponding path program 13 times [2022-03-15 22:13:26,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:26,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414299826] [2022-03-15 22:13:26,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:26,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:26,770 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 22:13:26,770 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:26,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414299826] [2022-03-15 22:13:26,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414299826] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:26,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813134847] [2022-03-15 22:13:26,770 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:13:26,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:26,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:26,771 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:26,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 22:13:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:26,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:13:26,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:26,867 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 22:13:26,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:26,904 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 22:13:26,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813134847] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:26,905 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:26,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2022-03-15 22:13:26,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1305197086] [2022-03-15 22:13:26,905 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:26,906 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:26,915 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 193 transitions. [2022-03-15 22:13:26,915 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:27,888 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [9550#(or (<= A i2) (< (+ i1 1) A) (<= A i1)), 9567#(or (<= A (+ 3 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 9564#(or (<= A 3) (< (+ i1 1) A) (<= A i1)), 9572#(or (< 3 A) (<= A 2) (<= A (+ 3 i2))), 9555#(or (<= A (+ 2 i2)) (< i1 A)), 9566#(or (<= A (+ 2 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 9557#(or (<= A 3) (< i1 A)), 9574#(or (<= A 3) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 9548#(or (<= A (+ i1 1)) (< (+ 2 i1) A)), 9560#(or (<= A (+ 3 i2)) (< (+ i1 1) A) (<= A i1)), 9573#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A 3)), 9559#(or (<= A (+ 2 i2)) (< (+ i1 1) A) (<= A i1)), 9571#(or (< 3 A) (<= A 2) (<= A (+ 2 i2))), 9546#(< i1 A), 9561#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ i2 1))), 9551#(or (<= A i2) (<= A (+ i1 1)) (< (+ 2 i1) A)), 9549#(or (<= A i2) (< i1 A)), 9568#(or (< 3 A) (<= A 2)), 9547#(or (< (+ i1 1) A) (<= A i1)), 9553#(or (<= A i2) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 9563#(or (<= A (+ 3 i2)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 9552#(or (<= A (+ 2 i1)) (< (+ 3 i1) A)), 9558#(or (<= A (+ i2 1)) (< (+ i1 1) A) (<= A i1)), 9565#(or (<= A (+ i2 1)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 9554#(or (<= A (+ i2 1)) (< i1 A)), 9569#(or (< 3 A) (<= A 2) (<= A i2)), 9556#(or (<= A (+ 3 i2)) (< i1 A)), 9570#(or (< 3 A) (<= A 2) (<= A (+ i2 1))), 9562#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ 2 i2)))] [2022-03-15 22:13:27,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 22:13:27,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:27,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 22:13:27,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1591, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:13:27,889 INFO L87 Difference]: Start difference. First operand 214 states and 617 transitions. Second operand has 40 states, 40 states have (on average 3.0) internal successors, (120), 40 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 22:13:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:29,623 INFO L93 Difference]: Finished difference Result 440 states and 1205 transitions. [2022-03-15 22:13:29,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-03-15 22:13:29,623 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.0) internal successors, (120), 40 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 20 [2022-03-15 22:13:29,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:29,625 INFO L225 Difference]: With dead ends: 440 [2022-03-15 22:13:29,625 INFO L226 Difference]: Without dead ends: 418 [2022-03-15 22:13:29,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2871 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2372, Invalid=8970, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 22:13:29,627 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 225 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:29,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 15 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:13:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-03-15 22:13:29,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 221. [2022-03-15 22:13:29,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 2.8727272727272726) internal successors, (632), 220 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:29,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 632 transitions. [2022-03-15 22:13:29,633 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 632 transitions. Word has length 20 [2022-03-15 22:13:29,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:29,633 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 632 transitions. [2022-03-15 22:13:29,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.0) internal successors, (120), 40 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 22:13:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 632 transitions. [2022-03-15 22:13:29,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 22:13:29,634 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:29,634 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:29,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 22:13:29,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:29,844 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:29,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1965867183, now seen corresponding path program 14 times [2022-03-15 22:13:29,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:29,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219202691] [2022-03-15 22:13:29,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:29,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:29,935 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:29,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219202691] [2022-03-15 22:13:29,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219202691] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:29,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070525575] [2022-03-15 22:13:29,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:13:29,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:29,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:29,936 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:29,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 22:13:29,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:13:29,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:13:29,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:13:29,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:30,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:30,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070525575] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:30,055 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:30,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2022-03-15 22:13:30,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [307725868] [2022-03-15 22:13:30,055 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:30,067 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:30,075 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 188 transitions. [2022-03-15 22:13:30,075 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:31,180 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [10781#(or (<= (+ 2 i2) A) (< (+ i1 1) A) (<= A i1)), 10792#(or (<= (+ 3 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 10775#(or (<= (+ i2 1) A) (< i1 A)), 10801#(or (<= (+ i2 4) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 10800#(or (<= 4 A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 10790#(or (<= A 3) (<= (+ 2 i2) A) (< 4 A)), 10789#(or (<= A 3) (<= (+ i2 1) A) (< 4 A)), 10783#(or (<= (+ 3 i2) A) (< (+ i1 1) A) (<= A i1)), 10780#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ i2 1) A)), 10791#(or (<= (+ 3 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 10787#(or (<= (+ i2 1) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 10799#(or (<= (+ i2 4) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 10788#(or (<= (+ 2 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 10803#(or (<= A 3) (<= (+ i2 4) A) (< 4 A)), 10782#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 2 i2) A)), 10797#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ i2 4) A)), 10779#(or (<= (+ i2 1) A) (< (+ i1 1) A) (<= A i1)), 10778#(or (<= (+ i2 4) A) (< i1 A)), 10798#(or (<= 4 A) (<= A (+ i1 1)) (< (+ 2 i1) A)), 10776#(or (<= (+ 2 i2) A) (< i1 A)), 10785#(or (<= (+ i2 1) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 10795#(or (<= 4 A) (< i1 A)), 10794#(or (<= (+ i2 4) A) (< (+ i1 1) A) (<= A i1)), 10786#(or (<= (+ 2 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 10802#(or (<= 4 A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 10784#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 3 i2) A)), 10796#(or (<= 4 A) (< (+ i1 1) A) (<= A i1)), 10777#(or (<= (+ 3 i2) A) (< i1 A)), 10793#(or (<= A 3) (<= (+ 3 i2) A) (< 4 A))] [2022-03-15 22:13:31,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 22:13:31,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:31,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 22:13:31,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1584, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:13:31,181 INFO L87 Difference]: Start difference. First operand 221 states and 632 transitions. Second operand has 40 states, 40 states have (on average 3.0) internal successors, (120), 40 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 22:13:34,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:34,137 INFO L93 Difference]: Finished difference Result 787 states and 2176 transitions. [2022-03-15 22:13:34,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-03-15 22:13:34,137 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.0) internal successors, (120), 40 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 20 [2022-03-15 22:13:34,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:34,140 INFO L225 Difference]: With dead ends: 787 [2022-03-15 22:13:34,140 INFO L226 Difference]: Without dead ends: 787 [2022-03-15 22:13:34,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7143 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3783, Invalid=16523, Unknown=0, NotChecked=0, Total=20306 [2022-03-15 22:13:34,142 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 370 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:34,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 17 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:13:34,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2022-03-15 22:13:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 278. [2022-03-15 22:13:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 2.9747292418772564) internal successors, (824), 277 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 824 transitions. [2022-03-15 22:13:34,148 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 824 transitions. Word has length 20 [2022-03-15 22:13:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:34,148 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 824 transitions. [2022-03-15 22:13:34,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.0) internal successors, (120), 40 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 22:13:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 824 transitions. [2022-03-15 22:13:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 22:13:34,149 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:34,149 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:34,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 22:13:34,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:34,366 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:34,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:34,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1251552573, now seen corresponding path program 15 times [2022-03-15 22:13:34,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:34,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107152831] [2022-03-15 22:13:34,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:34,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:34,423 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:34,423 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:34,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107152831] [2022-03-15 22:13:34,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107152831] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:34,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771895762] [2022-03-15 22:13:34,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:13:34,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:34,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:34,424 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:34,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 22:13:34,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 22:13:34,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:13:34,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:13:34,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:34,513 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 22:13:34,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:34,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771895762] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:34,543 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:34,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2022-03-15 22:13:34,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2062224158] [2022-03-15 22:13:34,544 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:34,545 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:34,553 INFO L252 McrAutomatonBuilder]: Finished intersection with 89 states and 181 transitions. [2022-03-15 22:13:34,553 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:35,341 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [12596#(or (<= A (+ 2 i1)) (<= i2 i1)), 12577#(or (<= A i1) (<= i2 i1)), 12595#(or (<= A (+ i1 1)) (<= (+ i2 1) i1)), 12588#(or (<= A 2) (<= i2 3)), 12585#(or (<= A (+ 2 i1)) (<= i2 (+ 3 i1))), 12598#(or (<= 2 i1) (<= A i1)), 12599#(or (<= A (+ i1 1)) (<= 1 i1)), 12597#(or (<= i2 0) (<= A 2)), 12586#(or (<= A (+ 2 i1)) (<= i2 (+ 2 i1))), 12580#(or (<= i2 (+ i1 1)) (<= A (+ i1 1))), 12576#(or (<= i2 (+ i1 1)) (<= A i1)), 12581#(or (<= A i2) (<= (+ 2 i2) A)), 12578#(<= A (+ 2 i1)), 12593#(or (<= A 2) (<= i2 1)), 12583#(or (<= A (+ 2 i2)) (<= (+ i2 4) A)), 12589#(or (<= i2 2) (<= A 2)), 12579#(or (<= A (+ i1 1)) (<= i2 (+ 2 i1))), 12587#(<= A 3), 12600#(or (<= 4 A) (<= A 2)), 12594#(or (<= (+ 2 i2) i1) (<= A i1)), 12601#(or (<= 0 i1) (<= A (+ 2 i1))), 12582#(or (<= (+ 3 i2) A) (<= A (+ i2 1))), 12591#(or (<= A (+ i1 1)) (<= i2 i1)), 12574#(<= A i1), 12575#(<= A (+ i1 1)), 12592#(or (<= i2 (+ i1 1)) (<= A (+ 2 i1))), 12584#(<= A (+ 3 i1)), 12590#(or (<= A i1) (<= (+ i2 1) i1))] [2022-03-15 22:13:35,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 22:13:35,342 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:35,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 22:13:35,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:13:35,342 INFO L87 Difference]: Start difference. First operand 278 states and 824 transitions. Second operand has 39 states, 39 states have (on average 2.923076923076923) internal successors, (114), 39 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:38,191 INFO L93 Difference]: Finished difference Result 537 states and 1439 transitions. [2022-03-15 22:13:38,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-03-15 22:13:38,191 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.923076923076923) internal successors, (114), 39 states have internal predecessors, (114), 0 states have call successors, (0), 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 22:13:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:38,193 INFO L225 Difference]: With dead ends: 537 [2022-03-15 22:13:38,193 INFO L226 Difference]: Without dead ends: 513 [2022-03-15 22:13:38,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7925 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=5340, Invalid=18840, Unknown=0, NotChecked=0, Total=24180 [2022-03-15 22:13:38,200 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 314 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:38,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 14 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:13:38,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-03-15 22:13:38,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 174. [2022-03-15 22:13:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 2.647398843930636) internal successors, (458), 173 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 458 transitions. [2022-03-15 22:13:38,206 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 458 transitions. Word has length 20 [2022-03-15 22:13:38,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:38,206 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 458 transitions. [2022-03-15 22:13:38,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.923076923076923) internal successors, (114), 39 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:38,206 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 458 transitions. [2022-03-15 22:13:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 22:13:38,206 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:38,206 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:38,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 22:13:38,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:38,407 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:38,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:38,407 INFO L85 PathProgramCache]: Analyzing trace with hash 881142192, now seen corresponding path program 16 times [2022-03-15 22:13:38,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:38,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552261194] [2022-03-15 22:13:38,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:38,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:38,580 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 22:13:38,581 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:38,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552261194] [2022-03-15 22:13:38,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552261194] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:38,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872713228] [2022-03-15 22:13:38,581 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:13:38,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:38,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:38,582 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:38,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 22:13:38,609 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:13:38,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:13:38,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 22:13:38,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:38,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:13:38,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:13:38,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:13:38,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2022-03-15 22:13:38,824 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 22:13:38,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:38,967 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:13:38,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 52 [2022-03-15 22:13:39,039 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 22:13:39,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872713228] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:39,039 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:39,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2022-03-15 22:13:39,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [932194346] [2022-03-15 22:13:39,040 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:39,041 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:39,072 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 223 transitions. [2022-03-15 22:13:39,072 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:42,747 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [13992#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) (+ (* B 4) x2)) (not (= (select queue end) (+ x1 B))))), 13998#(and (or (< start (+ end 1)) (not (= (select queue end) (* B 4)))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (* B 4)))) (or (not (= (select queue end) (* B 4))) (<= end start))), 13971#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (= (select queue start) x2) (not (= (select queue end) x1)))), 13978#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ x2 B))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 13988#(and (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ (* 3 B) x2))) (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 13981#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 13976#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 13994#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* B 4) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 14004#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (* B 4) (select queue start))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 13987#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 13972#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) x2) (not (= (select queue end) (+ x1 B))))), 13974#(and (or (= (select queue start) x2) (not (= (+ (* 3 B) x1) (select queue end)))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 13995#(and (or (= (select queue start) (+ (* B 4) x2)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 13977#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 13982#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 2 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 13973#(and (or (= (select queue start) x2) (not (= (select queue end) (+ (* 2 B) x1)))) (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 14000#(and (or (< start (+ end 1)) (not (= (select queue end) (* B 4)))) (or (not (= (select queue end) (* B 4))) (= (select queue start) (+ (* B 4) x2))) (or (not (= (select queue end) (* B 4))) (<= end start))), 14005#(and (or (= (* B 4) (select queue start)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 14002#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (* B 4) (select queue start)) (not (= (select queue end) (+ x1 B))))), 14001#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (= (* B 4) (select queue start))) (or (not (= (select queue end) x1)) (<= end start))), 13999#(and (or (not (= (select queue end) (* B 4))) (= (select queue start) (+ (* 3 B) x2))) (or (< start (+ end 1)) (not (= (select queue end) (* B 4)))) (or (not (= (select queue end) (* B 4))) (<= end start))), 13975#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ x2 B)))), 13980#(and (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 13996#(and (or (< start (+ end 1)) (not (= (select queue end) (* B 4)))) (or (not (= (select queue end) (* B 4))) (<= end start)) (or (= (select queue start) x2) (not (= (select queue end) (* B 4))))), 13986#(and (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 14003#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (= (* B 4) (select queue start)) (not (= (select queue end) (+ (* 2 B) x1))))), 13979#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 2 B) x2)))), 13983#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) x2) (not (= (+ (* B 4) x1) (select queue end))))), 13993#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ (* B 4) x2)))), 13991#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* B 4) x2)))), 13997#(and (or (< start (+ end 1)) (not (= (select queue end) (* B 4)))) (or (not (= (select queue end) (* B 4))) (<= end start)) (or (not (= (select queue end) (* B 4))) (= (select queue start) (+ x2 B)))), 13990#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end)))) (or (not (= (+ (* B 4) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2)))), 14006#(and (or (< start (+ end 1)) (not (= (select queue end) (* B 4)))) (or (not (= (select queue end) (* B 4))) (<= end start))), 13989#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 13984#(and (or (= (select queue start) (+ x2 B)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 13985#(and (or (= (select queue start) (+ (* 2 B) x2)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end)))))] [2022-03-15 22:13:42,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 22:13:42,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:42,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 22:13:42,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3849, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 22:13:42,748 INFO L87 Difference]: Start difference. First operand 174 states and 458 transitions. Second operand has 52 states, 51 states have (on average 2.803921568627451) internal successors, (143), 51 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:47,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:47,969 INFO L93 Difference]: Finished difference Result 345 states and 992 transitions. [2022-03-15 22:13:47,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 22:13:47,969 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.803921568627451) internal successors, (143), 51 states have internal predecessors, (143), 0 states have call successors, (0), 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 22:13:47,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:47,971 INFO L225 Difference]: With dead ends: 345 [2022-03-15 22:13:47,971 INFO L226 Difference]: Without dead ends: 337 [2022-03-15 22:13:47,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 75 SyntacticMatches, 7 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2396 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=640, Invalid=11792, Unknown=0, NotChecked=0, Total=12432 [2022-03-15 22:13:47,972 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 45 mSDsluCounter, 3003 mSDsCounter, 0 mSdLazyCounter, 7240 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 7359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 7240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:47,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 2 Invalid, 7359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 7240 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 22:13:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-03-15 22:13:47,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 214. [2022-03-15 22:13:47,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.76056338028169) internal successors, (588), 213 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 588 transitions. [2022-03-15 22:13:47,976 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 588 transitions. Word has length 21 [2022-03-15 22:13:47,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:47,976 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 588 transitions. [2022-03-15 22:13:47,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.803921568627451) internal successors, (143), 51 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:47,976 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 588 transitions. [2022-03-15 22:13:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 22:13:47,977 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:47,977 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:47,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 22:13:48,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:48,183 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:48,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash 542269236, now seen corresponding path program 17 times [2022-03-15 22:13:48,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:48,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359764768] [2022-03-15 22:13:48,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:48,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:48,344 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 22:13:48,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:48,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359764768] [2022-03-15 22:13:48,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359764768] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:48,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049315165] [2022-03-15 22:13:48,345 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:13:48,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:48,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:48,346 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:48,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 22:13:48,370 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:13:48,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:13:48,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 22:13:48,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:48,589 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:13:48,590 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 59 treesize of output 33 [2022-03-15 22:13:48,597 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 22:13:48,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:48,648 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:13:48,648 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 48 [2022-03-15 22:13:48,758 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 22:13:48,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049315165] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:48,758 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:48,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2022-03-15 22:13:48,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1581716304] [2022-03-15 22:13:48,759 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:48,760 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:48,777 INFO L252 McrAutomatonBuilder]: Finished intersection with 101 states and 209 transitions. [2022-03-15 22:13:48,778 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:50,032 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [15031#(and (= (+ (* B 4) x1) x2) (= end start)), 15028#(and (<= end (+ start 1)) (= (+ (* 3 B) x1) (select queue start)) (< start end)), 15037#(and (= end start) (= x2 0)), 15030#(and (<= end (+ start 1)) (= (+ (* B 4) x1) (select queue start)) (< start end)), 15026#(and (= x2 (+ x1 B)) (= end start)), 15025#(and (= (select queue start) (+ (* 2 B) x1)) (<= end (+ start 1)) (< start end)), 15029#(and (= (+ (* 3 B) x1) x2) (= end start)), 15035#(and (= (* 2 B) x2) (= end start)), 15036#(and (= x2 B) (= end start)), 15034#(and (= end start) (= (* 3 B) x2)), 15024#(and (<= end (+ start 1)) (= (select queue start) (+ x1 B)) (< start end)), 15027#(and (= x2 (+ (* 2 B) x1)) (= end start)), 15033#(and (= (* B 4) x2) (= end start)), 15032#(and (<= end (+ start 1)) (= (* B 4) (select queue start)) (< start end))] [2022-03-15 22:13:50,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 22:13:50,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:50,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 22:13:50,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1290, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:13:50,035 INFO L87 Difference]: Start difference. First operand 214 states and 588 transitions. Second operand has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 29 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:52,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:52,761 INFO L93 Difference]: Finished difference Result 475 states and 1440 transitions. [2022-03-15 22:13:52,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-03-15 22:13:52,761 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 29 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 22:13:52,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:52,763 INFO L225 Difference]: With dead ends: 475 [2022-03-15 22:13:52,763 INFO L226 Difference]: Without dead ends: 467 [2022-03-15 22:13:52,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 90 SyntacticMatches, 11 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1894 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=371, Invalid=6769, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 22:13:52,764 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 40 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 6430 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 6502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 6430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:52,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 2 Invalid, 6502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 6430 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 22:13:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-03-15 22:13:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 294. [2022-03-15 22:13:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 2.901023890784983) internal successors, (850), 293 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:52,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 850 transitions. [2022-03-15 22:13:52,770 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 850 transitions. Word has length 21 [2022-03-15 22:13:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:52,770 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 850 transitions. [2022-03-15 22:13:52,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 29 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 850 transitions. [2022-03-15 22:13:52,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 22:13:52,771 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:52,771 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:52,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 22:13:52,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:52,987 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:52,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:52,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1614405839, now seen corresponding path program 18 times [2022-03-15 22:13:52,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:52,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193302534] [2022-03-15 22:13:52,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:52,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:53,054 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 22:13:53,054 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:53,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193302534] [2022-03-15 22:13:53,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193302534] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:53,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560292944] [2022-03-15 22:13:53,054 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:13:53,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:53,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:53,055 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:53,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 22:13:53,080 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:13:53,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:13:53,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 22:13:53,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:53,157 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 22:13:53,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:53,189 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 22:13:53,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560292944] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:53,189 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:53,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2022-03-15 22:13:53,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [422459743] [2022-03-15 22:13:53,190 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:53,191 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:53,204 INFO L252 McrAutomatonBuilder]: Finished intersection with 123 states and 258 transitions. [2022-03-15 22:13:53,204 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:54,669 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [16362#(or (<= A (+ i2 4)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 16360#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ 2 i2))), 16347#(or (<= A (+ 3 i2)) (< i1 A)), 16377#(or (<= A 3) (< 4 A)), 16359#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ i2 1))), 16368#(or (<= A (+ 3 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 16369#(or (<= A (+ i2 4)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 16361#(or (<= A (+ 3 i2)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 16343#(< i1 A), 16351#(or (<= A (+ i2 1)) (< (+ i1 1) A) (<= A i1)), 16380#(or (<= A 3) (<= A (+ 2 i2)) (< 4 A)), 16355#(or (<= A 4) (< i1 A)), 16353#(or (<= A (+ 3 i2)) (< (+ i1 1) A) (<= A i1)), 16350#(or (<= A i2) (< (+ i1 1) A) (<= A i1)), 16357#(or (<= A (+ i1 1)) (< (+ 2 i1) A)), 16358#(or (<= A i2) (<= A (+ i1 1)) (< (+ 2 i1) A)), 16373#(or (<= A (+ i2 1)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 16352#(or (<= A (+ 2 i2)) (< (+ i1 1) A) (<= A i1)), 16381#(or (<= A (+ 3 i2)) (<= A 3) (< 4 A)), 16348#(or (<= A (+ i2 4)) (< i1 A)), 16372#(or (<= A i2) (<= A (+ 3 i1)) (< (+ i1 4) A)), 16371#(or (<= A (+ 3 i1)) (< (+ i1 4) A)), 16375#(or (<= A (+ 3 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 16378#(or (<= A i2) (<= A 3) (< 4 A)), 16345#(or (<= A (+ i2 1)) (< i1 A)), 16349#(or (< (+ i1 1) A) (<= A i1)), 16376#(or (<= A (+ i2 4)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 16364#(or (<= A (+ 2 i1)) (< (+ 3 i1) A)), 16354#(or (<= A (+ i2 4)) (< (+ i1 1) A) (<= A i1)), 16383#(or (<= A (+ 3 i1)) (<= A 4) (< (+ i1 4) A)), 16346#(or (<= A (+ 2 i2)) (< i1 A)), 16365#(or (<= A i2) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 16370#(or (<= A (+ 2 i1)) (<= A 4) (< (+ 3 i1) A)), 16382#(or (<= A (+ i2 4)) (<= A 3) (< 4 A)), 16344#(or (<= A i2) (< i1 A)), 16366#(or (<= A (+ i2 1)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 16379#(or (<= A 3) (<= A (+ i2 1)) (< 4 A)), 16363#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A 4)), 16367#(or (<= A (+ 2 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 16356#(or (<= A 4) (< (+ i1 1) A) (<= A i1)), 16374#(or (<= A (+ 2 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A))] [2022-03-15 22:13:54,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 22:13:54,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:54,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 22:13:54,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=2937, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:13:54,670 INFO L87 Difference]: Start difference. First operand 294 states and 850 transitions. Second operand has 54 states, 54 states have (on average 2.962962962962963) internal successors, (160), 54 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:57,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:57,544 INFO L93 Difference]: Finished difference Result 638 states and 1760 transitions. [2022-03-15 22:13:57,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-15 22:13:57,544 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.962962962962963) internal successors, (160), 54 states have internal predecessors, (160), 0 states have call successors, (0), 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 22:13:57,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:57,546 INFO L225 Difference]: With dead ends: 638 [2022-03-15 22:13:57,546 INFO L226 Difference]: Without dead ends: 609 [2022-03-15 22:13:57,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4274, Invalid=17188, Unknown=0, NotChecked=0, Total=21462 [2022-03-15 22:13:57,548 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 266 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:57,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 23 Invalid, 2148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:13:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-03-15 22:13:57,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 307. [2022-03-15 22:13:57,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 2.8758169934640523) internal successors, (880), 306 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 880 transitions. [2022-03-15 22:13:57,554 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 880 transitions. Word has length 22 [2022-03-15 22:13:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:57,555 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 880 transitions. [2022-03-15 22:13:57,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.962962962962963) internal successors, (160), 54 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 880 transitions. [2022-03-15 22:13:57,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 22:13:57,555 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:57,555 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:57,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-03-15 22:13:57,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:57,760 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:57,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:57,760 INFO L85 PathProgramCache]: Analyzing trace with hash -991921515, now seen corresponding path program 19 times [2022-03-15 22:13:57,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:57,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280576370] [2022-03-15 22:13:57,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:57,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:57,819 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:57,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280576370] [2022-03-15 22:13:57,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280576370] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:57,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181446251] [2022-03-15 22:13:57,820 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:13:57,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:57,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:57,821 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:57,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 22:13:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:57,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 22:13:57,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:57,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:57,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181446251] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:57,946 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:57,946 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2022-03-15 22:13:57,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [693995561] [2022-03-15 22:13:57,946 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:57,948 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:57,977 INFO L252 McrAutomatonBuilder]: Finished intersection with 121 states and 253 transitions. [2022-03-15 22:13:57,977 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:59,558 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [18048#(or (< i1 A) (<= (+ 5 i2) A)), 18075#(or (<= A (+ 2 i1)) (< (+ 3 i1) A) (<= (+ 5 i2) A)), 18044#(or (<= (+ i2 1) A) (< i1 A)), 18053#(or (<= (+ i2 1) A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 18054#(or (<= (+ 2 i2) A) (< (+ i1 1) A) (<= A i1)), 18055#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 2 i2) A)), 18067#(or (<= (+ 3 i2) A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 18060#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 3 i2) A)), 18052#(or (<= (+ i2 1) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 18083#(or (< 5 A) (<= A 4) (<= (+ 5 i2) A)), 18065#(or (<= (+ i2 4) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 18080#(or (<= A (+ 3 i1)) (< (+ i1 4) A) (<= (+ 5 i2) A)), 18077#(or (<= 5 A) (< (+ i1 1) A) (<= A i1)), 18076#(or (<= 5 A) (< i1 A)), 18061#(or (<= (+ 3 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 18084#(or (<= 5 A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 18082#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= (+ 5 i2) A)), 18064#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ i2 4) A)), 18059#(or (<= (+ 3 i2) A) (< (+ i1 1) A) (<= A i1)), 18068#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= (+ i2 4) A)), 18066#(or (<= (+ i2 4) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 18069#(or (< 5 A) (<= (+ i2 1) A) (<= A 4)), 18074#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 5 i2) A)), 18046#(or (<= (+ 3 i2) A) (< i1 A)), 18045#(or (<= (+ 2 i2) A) (< i1 A)), 18071#(or (< 5 A) (<= (+ 3 i2) A) (<= A 4)), 18070#(or (< 5 A) (<= (+ 2 i2) A) (<= A 4)), 18058#(or (<= A (+ i1 4)) (<= (+ 2 i2) A) (< (+ 5 i1) A)), 18057#(or (<= (+ 2 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 18056#(or (<= (+ 2 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 18072#(or (< 5 A) (<= (+ i2 4) A) (<= A 4)), 18047#(or (<= (+ i2 4) A) (< i1 A)), 18063#(or (<= (+ i2 4) A) (< (+ i1 1) A) (<= A i1)), 18062#(or (<= (+ 3 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 18081#(or (<= 5 A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 18049#(or (<= (+ i2 1) A) (< (+ i1 1) A) (<= A i1)), 18050#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ i2 1) A)), 18073#(or (< (+ i1 1) A) (<= (+ 5 i2) A) (<= A i1)), 18051#(or (<= (+ i2 1) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 18079#(or (<= 5 A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 18078#(or (<= 5 A) (<= A (+ i1 1)) (< (+ 2 i1) A))] [2022-03-15 22:13:59,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 22:13:59,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:59,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 22:13:59,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=2926, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:13:59,559 INFO L87 Difference]: Start difference. First operand 307 states and 880 transitions. Second operand has 54 states, 54 states have (on average 2.962962962962963) internal successors, (160), 54 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:05,199 INFO L93 Difference]: Finished difference Result 1301 states and 3647 transitions. [2022-03-15 22:14:05,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2022-03-15 22:14:05,200 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.962962962962963) internal successors, (160), 54 states have internal predecessors, (160), 0 states have call successors, (0), 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 22:14:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:05,204 INFO L225 Difference]: With dead ends: 1301 [2022-03-15 22:14:05,204 INFO L226 Difference]: Without dead ends: 1301 [2022-03-15 22:14:05,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19029 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8459, Invalid=41047, Unknown=0, NotChecked=0, Total=49506 [2022-03-15 22:14:05,207 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 605 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:05,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [605 Valid, 24 Invalid, 2362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 1939 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:14:05,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2022-03-15 22:14:05,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 384. [2022-03-15 22:14:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 2.960835509138381) internal successors, (1134), 383 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1134 transitions. [2022-03-15 22:14:05,217 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1134 transitions. Word has length 22 [2022-03-15 22:14:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:05,217 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 1134 transitions. [2022-03-15 22:14:05,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.962962962962963) internal successors, (160), 54 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1134 transitions. [2022-03-15 22:14:05,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 22:14:05,218 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:05,218 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:05,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 22:14:05,435 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,SelfDestructingSolverStorable24 [2022-03-15 22:14:05,435 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:05,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:05,435 INFO L85 PathProgramCache]: Analyzing trace with hash -19628591, now seen corresponding path program 20 times [2022-03-15 22:14:05,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:05,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506800925] [2022-03-15 22:14:05,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:05,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:05,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:05,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506800925] [2022-03-15 22:14:05,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506800925] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:05,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133702486] [2022-03-15 22:14:05,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:14:05,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:05,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:05,490 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:14:05,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 22:14:05,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:14:05,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:05,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 22:14:05,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:05,592 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 22:14:05,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:05,631 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:05,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133702486] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:05,631 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:05,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2022-03-15 22:14:05,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1576335630] [2022-03-15 22:14:05,631 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:05,632 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:05,645 INFO L252 McrAutomatonBuilder]: Finished intersection with 116 states and 244 transitions. [2022-03-15 22:14:05,645 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:06,814 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [20819#(or (<= A (+ 3 i2)) (<= (+ 5 i2) A)), 20827#(or (<= A (+ i1 1)) (<= 2 i1)), 20791#(<= A i1), 20824#(or (<= A 3) (<= i2 1)), 20808#(or (<= A (+ 2 i1)) (<= i2 i1)), 20823#(or (<= i2 2) (<= A 3)), 20803#(or (<= A (+ i1 1)) (<= (+ 2 i2) i1)), 20804#(<= A (+ 3 i1)), 20811#(or (<= i2 (+ i1 4)) (<= A (+ 3 i1))), 20794#(or (<= i2 (+ i1 1)) (<= A i1)), 20825#(or (<= i2 0) (<= A 3)), 20797#(or (<= i2 (+ i1 1)) (<= A (+ i1 1))), 20816#(or (<= A i2) (<= (+ 2 i2) A)), 20801#(or (<= A (+ i1 1)) (<= (+ i2 1) i1)), 20817#(or (<= (+ 3 i2) A) (<= A (+ i2 1))), 20828#(or (<= 1 i1) (<= A (+ 2 i1))), 20792#(<= A (+ i1 1)), 20826#(or (<= 3 i1) (<= A i1)), 20796#(or (<= A i1) (<= i2 i1)), 20830#(or (<= 5 A) (<= A 3)), 20812#(or (<= A (+ 3 i1)) (<= i2 (+ 3 i1))), 20814#(or (<= i2 (+ i1 1)) (<= A (+ 3 i1))), 20800#(or (<= (+ 2 i2) i1) (<= A i1)), 20795#(or (<= A (+ i1 1)) (<= i2 (+ 2 i1))), 20820#(<= A 4), 20793#(<= A (+ 2 i1)), 20813#(or (<= A (+ 3 i1)) (<= i2 (+ 2 i1))), 20822#(or (<= A 3) (<= i2 3)), 20815#(or (<= A (+ 3 i1)) (<= i2 i1)), 20818#(or (<= A (+ 2 i2)) (<= (+ i2 4) A)), 20799#(or (<= A (+ i1 1)) (<= i2 i1)), 20798#(or (<= A i1) (<= (+ i2 1) i1)), 20821#(or (<= A 3) (<= i2 4)), 20829#(or (<= 0 i1) (<= A (+ 3 i1))), 20810#(<= A (+ i1 4)), 20802#(or (<= A i1) (<= (+ 3 i2) i1)), 20809#(or (<= A (+ 2 i1)) (<= (+ i2 1) i1)), 20806#(or (<= A (+ 2 i1)) (<= i2 (+ 2 i1))), 20805#(or (<= A (+ 2 i1)) (<= i2 (+ 3 i1))), 20807#(or (<= i2 (+ i1 1)) (<= A (+ 2 i1)))] [2022-03-15 22:14:06,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-15 22:14:06,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:06,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-15 22:14:06,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=2754, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:14:06,815 INFO L87 Difference]: Start difference. First operand 384 states and 1134 transitions. Second operand has 53 states, 53 states have (on average 2.8867924528301887) internal successors, (153), 53 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:11,672 INFO L93 Difference]: Finished difference Result 772 states and 2083 transitions. [2022-03-15 22:14:11,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2022-03-15 22:14:11,672 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.8867924528301887) internal successors, (153), 53 states have internal predecessors, (153), 0 states have call successors, (0), 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 22:14:11,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:11,674 INFO L225 Difference]: With dead ends: 772 [2022-03-15 22:14:11,674 INFO L226 Difference]: Without dead ends: 744 [2022-03-15 22:14:11,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18294 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=11178, Invalid=40124, Unknown=0, NotChecked=0, Total=51302 [2022-03-15 22:14:11,677 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 309 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 2194 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 2445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 2194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:11,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 21 Invalid, 2445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 2194 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:14:11,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-03-15 22:14:11,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 230. [2022-03-15 22:14:11,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 2.6593886462882095) internal successors, (609), 229 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 609 transitions. [2022-03-15 22:14:11,682 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 609 transitions. Word has length 22 [2022-03-15 22:14:11,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:11,682 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 609 transitions. [2022-03-15 22:14:11,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.8867924528301887) internal successors, (153), 53 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 609 transitions. [2022-03-15 22:14:11,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 22:14:11,683 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:11,683 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:11,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 22:14:11,898 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,SelfDestructingSolverStorable25 [2022-03-15 22:14:11,898 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:11,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:11,898 INFO L85 PathProgramCache]: Analyzing trace with hash -615994230, now seen corresponding path program 21 times [2022-03-15 22:14:11,899 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:11,899 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124145404] [2022-03-15 22:14:11,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:11,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:12,125 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 22:14:12,126 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:12,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124145404] [2022-03-15 22:14:12,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124145404] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:12,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039288678] [2022-03-15 22:14:12,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:14:12,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:12,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:12,127 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:14:12,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 22:14:12,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 22:14:12,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:12,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 22:14:12,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:12,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:14:12,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:14:12,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:14:12,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2022-03-15 22:14:12,413 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 22:14:12,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:12,609 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:14:12,610 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 54 [2022-03-15 22:14:12,682 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 22:14:12,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039288678] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:12,682 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:12,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2022-03-15 22:14:12,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1730394161] [2022-03-15 22:14:12,682 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:12,684 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:12,700 INFO L252 McrAutomatonBuilder]: Finished intersection with 138 states and 293 transitions. [2022-03-15 22:14:12,700 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:18,150 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 49 new interpolants: [22732#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) x2) (not (= (select queue end) (+ x1 B))))), 22779#(and (or (not (= (select queue end) (* 5 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (* 5 B))))), 22778#(and (or (not (= (select queue end) (* 5 B))) (<= end start)) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (* 5 B)))) (or (< start (+ end 1)) (not (= (select queue end) (* 5 B))))), 22748#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) (+ (* B 4) x2)) (not (= (select queue end) (+ x1 B))))), 22737#(and (or (= (select queue start) x2) (not (= (select queue end) (+ (* 2 B) x1)))) (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 22752#(and (or (= (select queue start) (+ x2 B)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 22747#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* B 4) x2)))), 22753#(and (or (= (select queue start) (+ (* 2 B) x2)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 22735#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 2 B) x2)))), 22754#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end)))) (or (not (= (+ (* B 4) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2)))), 22767#(and (or (= (select queue start) (* 5 B)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 22761#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (* 5 B)))), 22757#(and (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 22738#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 22750#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* B 4) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 22760#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 22743#(and (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 22773#(and (or (= (select queue start) x2) (not (= (select queue end) (* 5 B)))) (or (not (= (select queue end) (* 5 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (* 5 B))))), 22746#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 22770#(and (or (= (select queue start) (+ (* B 4) x2)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 22768#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (+ x1 (* 5 B)) (select queue end))))), 22772#(and (or (= (select queue start) (* 5 B)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 22775#(and (or (not (= (select queue end) (* 5 B))) (<= end start)) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (* 5 B)))) (or (< start (+ end 1)) (not (= (select queue end) (* 5 B))))), 22745#(and (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ (* 3 B) x2))) (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 22749#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ (* B 4) x2)))), 22766#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (* 5 B)))), 22769#(and (or (not (= (+ x1 (* 5 B)) (select queue end))) (= (select queue start) (+ (* 3 B) x2))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 22736#(and (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 22733#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ x2 B)))), 22739#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 22774#(and (or (not (= (select queue end) (* 5 B))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (* 5 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (* 5 B))))), 22765#(and (or (not (= (+ x1 (* 5 B)) (select queue end))) (= (select queue start) (+ x2 B))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 22777#(and (or (not (= (select queue end) (* 5 B))) (<= end start)) (or (= (select queue start) (+ (* B 4) x2)) (not (= (select queue end) (* 5 B)))) (or (< start (+ end 1)) (not (= (select queue end) (* 5 B))))), 22759#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ x2 (* 5 B)))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 22741#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ x2 B))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 22740#(and (or (= (select queue start) x2) (not (= (+ (* 3 B) x1) (select queue end)))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 22758#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (+ (* 2 B) x1))))), 22763#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (= (select queue start) (* 5 B)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 22734#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 22776#(and (or (not (= (select queue end) (* 5 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (* 5 B)))) (or (not (= (select queue end) (* 5 B))) (= (select queue start) (+ (* 3 B) x2)))), 22744#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 22764#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) x2) (not (= (+ x1 (* 5 B)) (select queue end))))), 22762#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) (* 5 B)) (not (= (select queue end) (+ x1 B))))), 22742#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 2 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 22731#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (= (select queue start) x2) (not (= (select queue end) x1)))), 22756#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) x1))) (or (not (= (select queue end) x1)) (<= end start))), 22755#(and (or (= (select queue start) (+ (* B 4) x2)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 22771#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (+ x1 (* 5 B)) (select queue end))))), 22751#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) x2) (not (= (+ (* B 4) x1) (select queue end)))))] [2022-03-15 22:14:18,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-03-15 22:14:18,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:18,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-03-15 22:14:18,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=6252, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 22:14:18,152 INFO L87 Difference]: Start difference. First operand 230 states and 609 transitions. Second operand has 67 states, 66 states have (on average 2.8181818181818183) internal successors, (186), 66 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:27,021 INFO L93 Difference]: Finished difference Result 462 states and 1337 transitions. [2022-03-15 22:14:27,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-15 22:14:27,021 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.8181818181818183) internal successors, (186), 66 states have internal predecessors, (186), 0 states have call successors, (0), 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 22:14:27,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:27,023 INFO L225 Difference]: With dead ends: 462 [2022-03-15 22:14:27,023 INFO L226 Difference]: Without dead ends: 454 [2022-03-15 22:14:27,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 92 SyntacticMatches, 8 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4444 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=905, Invalid=21445, Unknown=0, NotChecked=0, Total=22350 [2022-03-15 22:14:27,024 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 59 mSDsluCounter, 4627 mSDsCounter, 0 mSdLazyCounter, 11609 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 11807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 11609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:27,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 2 Invalid, 11807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 11609 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-03-15 22:14:27,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-03-15 22:14:27,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 276. [2022-03-15 22:14:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 2.7636363636363637) internal successors, (760), 275 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 760 transitions. [2022-03-15 22:14:27,029 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 760 transitions. Word has length 23 [2022-03-15 22:14:27,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:27,029 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 760 transitions. [2022-03-15 22:14:27,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.8181818181818183) internal successors, (186), 66 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 760 transitions. [2022-03-15 22:14:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 22:14:27,029 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:27,029 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:27,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 22:14:27,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 22:14:27,246 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:27,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:27,246 INFO L85 PathProgramCache]: Analyzing trace with hash 426245384, now seen corresponding path program 22 times [2022-03-15 22:14:27,247 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:27,247 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934796691] [2022-03-15 22:14:27,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:27,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:27,434 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 22:14:27,434 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:27,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934796691] [2022-03-15 22:14:27,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934796691] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:27,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665883314] [2022-03-15 22:14:27,434 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:14:27,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:27,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:27,448 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:14:27,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 22:14:27,473 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:14:27,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:27,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 22:14:27,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:27,724 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:14:27,724 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 65 treesize of output 39 [2022-03-15 22:14:27,741 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 22:14:27,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:27,796 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:14:27,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 48 [2022-03-15 22:14:27,911 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 22:14:27,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665883314] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:27,912 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:27,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2022-03-15 22:14:27,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [29654568] [2022-03-15 22:14:27,912 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:27,913 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:27,929 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 277 transitions. [2022-03-15 22:14:27,929 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:29,584 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [24110#(and (= (* 2 B) x2) (= end start)), 24105#(and (= (+ x1 (* 5 B)) x2) (= end start)), 24112#(and (= end start) (= x2 0)), 24111#(and (= x2 B) (= end start)), 24097#(and (= x2 (+ x1 B)) (= end start)), 24107#(and (= x2 (* 5 B)) (= end start)), 24101#(and (= (+ (* 3 B) x1) x2) (= end start)), 24102#(and (<= end (+ start 1)) (= (+ (* B 4) x1) (select queue start)) (< start end)), 24108#(and (= (* B 4) x2) (= end start)), 24104#(and (<= end (+ start 1)) (= (+ x1 (* 5 B)) (select queue start)) (< start end)), 24109#(and (= end start) (= (* 3 B) x2)), 24106#(and (= (select queue start) (* 5 B)) (<= end (+ start 1)) (< start end)), 24096#(and (<= end (+ start 1)) (= (select queue start) (+ x1 B)) (< start end)), 24100#(and (<= end (+ start 1)) (= (+ (* 3 B) x1) (select queue start)) (< start end)), 24098#(and (= (select queue start) (+ (* 2 B) x1)) (<= end (+ start 1)) (< start end)), 24099#(and (= x2 (+ (* 2 B) x1)) (= end start)), 24103#(and (= (+ (* B 4) x1) x2) (= end start))] [2022-03-15 22:14:29,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 22:14:29,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:29,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 22:14:29,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1756, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:14:29,584 INFO L87 Difference]: Start difference. First operand 276 states and 760 transitions. Second operand has 35 states, 34 states have (on average 3.1176470588235294) internal successors, (106), 34 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:33,789 INFO L93 Difference]: Finished difference Result 632 states and 1927 transitions. [2022-03-15 22:14:33,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-03-15 22:14:33,790 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.1176470588235294) internal successors, (106), 34 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 23 [2022-03-15 22:14:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:33,792 INFO L225 Difference]: With dead ends: 632 [2022-03-15 22:14:33,792 INFO L226 Difference]: Without dead ends: 624 [2022-03-15 22:14:33,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 116 SyntacticMatches, 13 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3526 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=505, Invalid=11927, Unknown=0, NotChecked=0, Total=12432 [2022-03-15 22:14:33,793 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 44 mSDsluCounter, 3199 mSDsCounter, 0 mSdLazyCounter, 10088 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 10186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 10088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:33,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 2 Invalid, 10186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 10088 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-03-15 22:14:33,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-03-15 22:14:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 386. [2022-03-15 22:14:33,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 2.890909090909091) internal successors, (1113), 385 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1113 transitions. [2022-03-15 22:14:33,800 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1113 transitions. Word has length 23 [2022-03-15 22:14:33,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:33,800 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 1113 transitions. [2022-03-15 22:14:33,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.1176470588235294) internal successors, (106), 34 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:33,801 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1113 transitions. [2022-03-15 22:14:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 22:14:33,801 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:33,801 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:33,821 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 22:14:34,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:34,017 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:34,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:34,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1847150283, now seen corresponding path program 23 times [2022-03-15 22:14:34,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:34,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268024662] [2022-03-15 22:14:34,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:34,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:34,091 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 22:14:34,091 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:34,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268024662] [2022-03-15 22:14:34,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268024662] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:34,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982711169] [2022-03-15 22:14:34,092 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:14:34,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:34,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:34,093 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:14:34,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 22:14:34,118 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 22:14:34,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:34,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 22:14:34,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:34,211 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 22:14:34,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:34,248 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 22:14:34,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982711169] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:34,249 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:34,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 21 [2022-03-15 22:14:34,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [793842673] [2022-03-15 22:14:34,250 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:34,251 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:34,273 INFO L252 McrAutomatonBuilder]: Finished intersection with 155 states and 333 transitions. [2022-03-15 22:14:34,273 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:36,488 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 55 new interpolants: [25850#(or (<= A (+ 3 i2)) (<= A (+ i1 4)) (< (+ 5 i1) A)), 25828#(or (<= A i2) (<= A (+ i1 4)) (< (+ 5 i1) A)), 25862#(or (<= A (+ 5 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 25843#(or (<= A (+ i1 4)) (<= A (+ 2 i2)) (< (+ 5 i1) A)), 25842#(or (<= A (+ 2 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 25860#(or (<= A (+ 5 i2)) (< (+ i1 1) A) (<= A i1)), 25820#(or (<= A i2) (< (+ i1 1) A) (<= A i1)), 25856#(or (<= A (+ i2 4)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 25834#(or (<= A (+ i1 4)) (<= A (+ i2 1)) (< (+ 5 i1) A)), 25817#(< i1 A), 25864#(or (<= A (+ 5 i2)) (<= A (+ i1 4)) (< (+ 5 i1) A)), 25830#(or (<= A (+ i2 1)) (< (+ i1 1) A) (<= A i1)), 25861#(or (<= A (+ 5 i2)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 25870#(or (<= A 5) (<= A (+ 3 i1)) (< (+ i1 4) A)), 25846#(or (<= A (+ 3 i2)) (< (+ i1 1) A) (<= A i1)), 25833#(or (<= A (+ i2 1)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 25868#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A 5)), 25859#(or (<= A (+ 5 i2)) (< i1 A)), 25829#(or (<= A (+ i2 1)) (< i1 A)), 25857#(or (<= A (+ i2 4)) (<= A (+ i1 4)) (< (+ 5 i1) A)), 25869#(or (<= A 5) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 25841#(or (<= A (+ 2 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 25832#(or (<= A (+ i2 1)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 25855#(or (<= A (+ i2 4)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 25854#(or (<= A (+ i2 4)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 25853#(or (<= A (+ i2 4)) (< (+ i1 1) A) (<= A i1)), 25823#(or (<= A (+ 2 i1)) (< (+ 3 i1) A)), 25836#(or (<= A i2) (< 5 A) (<= A 4)), 25839#(or (<= A (+ 2 i2)) (< (+ i1 1) A) (<= A i1)), 25838#(or (<= A (+ 2 i2)) (< i1 A)), 25863#(or (<= A (+ 5 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 25848#(or (<= A (+ 3 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 25847#(or (<= A (+ 3 i2)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 25866#(or (<= A 5) (< i1 A)), 25851#(or (<= A (+ 3 i2)) (< 5 A) (<= A 4)), 25852#(or (<= A (+ i2 4)) (< i1 A)), 25840#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ 2 i2))), 25822#(or (<= A i2) (<= A (+ i1 1)) (< (+ 2 i1) A)), 25826#(or (<= A i2) (<= A (+ 3 i1)) (< (+ i1 4) A)), 25837#(or (< 5 A) (<= A (+ i2 1)) (<= A 4)), 25821#(or (<= A (+ i1 1)) (< (+ 2 i1) A)), 25845#(or (<= A (+ 3 i2)) (< i1 A)), 25831#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ i2 1))), 25858#(or (< 5 A) (<= A (+ i2 4)) (<= A 4)), 25849#(or (<= A (+ 3 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 25867#(or (<= A 5) (< (+ i1 1) A) (<= A i1)), 25818#(or (<= A i2) (< i1 A)), 25825#(or (<= A (+ 3 i1)) (< (+ i1 4) A)), 25827#(or (<= A (+ i1 4)) (< (+ 5 i1) A)), 25819#(or (< (+ i1 1) A) (<= A i1)), 25844#(or (< 5 A) (<= A (+ 2 i2)) (<= A 4)), 25824#(or (<= A i2) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 25835#(or (< 5 A) (<= A 4)), 25871#(or (<= A (+ i1 4)) (<= A 5) (< (+ 5 i1) A)), 25865#(or (<= A (+ 5 i2)) (< 5 A) (<= A 4))] [2022-03-15 22:14:36,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-03-15 22:14:36,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:36,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-03-15 22:14:36,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=731, Invalid=4969, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 22:14:36,489 INFO L87 Difference]: Start difference. First operand 386 states and 1113 transitions. Second operand has 70 states, 70 states have (on average 2.942857142857143) internal successors, (206), 70 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:40,977 INFO L93 Difference]: Finished difference Result 873 states and 2415 transitions. [2022-03-15 22:14:40,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-03-15 22:14:40,977 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.942857142857143) internal successors, (206), 70 states have internal predecessors, (206), 0 states have call successors, (0), 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 22:14:40,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:40,980 INFO L225 Difference]: With dead ends: 873 [2022-03-15 22:14:40,980 INFO L226 Difference]: Without dead ends: 837 [2022-03-15 22:14:40,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10048 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7071, Invalid=29985, Unknown=0, NotChecked=0, Total=37056 [2022-03-15 22:14:40,982 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 404 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:40,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 24 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:14:40,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2022-03-15 22:14:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 407. [2022-03-15 22:14:40,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 2.8596059113300494) internal successors, (1161), 406 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:40,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1161 transitions. [2022-03-15 22:14:40,990 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1161 transitions. Word has length 24 [2022-03-15 22:14:40,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:40,990 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 1161 transitions. [2022-03-15 22:14:40,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 2.942857142857143) internal successors, (206), 70 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:40,991 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1161 transitions. [2022-03-15 22:14:40,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 22:14:40,991 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:40,991 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:41,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 22:14:41,207 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,SelfDestructingSolverStorable28 [2022-03-15 22:14:41,207 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:41,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:41,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1038919633, now seen corresponding path program 24 times [2022-03-15 22:14:41,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:41,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475851160] [2022-03-15 22:14:41,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:41,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:41,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:41,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475851160] [2022-03-15 22:14:41,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475851160] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:41,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737785346] [2022-03-15 22:14:41,304 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:14:41,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:41,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:41,305 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 22:14:41,305 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 22:14:41,330 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:14:41,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:41,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 22:14:41,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:41,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:41,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737785346] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:41,452 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:41,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 21 [2022-03-15 22:14:41,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1179219950] [2022-03-15 22:14:41,453 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:41,454 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:41,481 INFO L252 McrAutomatonBuilder]: Finished intersection with 153 states and 328 transitions. [2022-03-15 22:14:41,481 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:43,775 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 55 new interpolants: [28110#(or (<= A (+ 5 i1)) (<= (+ i2 1) A) (< (+ 6 i1) A)), 28101#(or (<= A (+ 3 i1)) (< (+ i1 4) A) (<= (+ 5 i2) A)), 28085#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 3 i2) A)), 28119#(or (<= A 5) (<= (+ i2 4) A) (< 6 A)), 28121#(or (<= A 5) (< 6 A) (<= (+ 5 i2) A)), 28086#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ i2 4) A)), 28094#(or (<= A (+ 2 i1)) (< (+ 3 i1) A) (<= (+ 5 i2) A)), 28074#(or (<= (+ 6 i2) A) (< i1 A)), 28088#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 6 i2) A)), 28083#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ i2 1) A)), 28091#(or (<= (+ 2 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 28076#(or (<= (+ i2 1) A) (< (+ i1 1) A) (<= A i1)), 28073#(or (< i1 A) (<= (+ 5 i2) A)), 28107#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= (+ i2 4) A)), 28092#(or (<= (+ 3 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 28084#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 2 i2) A)), 28090#(or (<= (+ i2 1) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 28072#(or (<= (+ i2 4) A) (< i1 A)), 28087#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 5 i2) A)), 28114#(or (<= A (+ 5 i1)) (< (+ 6 i1) A) (<= (+ 5 i2) A)), 28093#(or (<= (+ i2 4) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 28089#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= 6 A)), 28113#(or (<= A (+ 5 i1)) (<= (+ i2 4) A) (< (+ 6 i1) A)), 28079#(or (<= (+ i2 4) A) (< (+ i1 1) A) (<= A i1)), 28120#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= 6 A)), 28081#(or (<= (+ 6 i2) A) (< (+ i1 1) A) (<= A i1)), 28097#(or (<= (+ i2 1) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 28105#(or (<= A (+ i1 4)) (<= (+ 2 i2) A) (< (+ 5 i1) A)), 28071#(or (<= (+ 3 i2) A) (< i1 A)), 28102#(or (<= (+ 6 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 28116#(or (<= (+ i2 1) A) (<= A 5) (< 6 A)), 28096#(or (<= A (+ 2 i1)) (< (+ 3 i1) A) (<= 6 A)), 28100#(or (<= (+ i2 4) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 28118#(or (<= (+ 3 i2) A) (<= A 5) (< 6 A)), 28099#(or (<= (+ 3 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 28112#(or (<= A (+ 5 i1)) (<= (+ 3 i2) A) (< (+ 6 i1) A)), 28115#(or (<= A (+ 5 i1)) (<= (+ 6 i2) A) (< (+ 6 i1) A)), 28108#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= (+ 5 i2) A)), 28070#(or (<= (+ 2 i2) A) (< i1 A)), 28077#(or (<= (+ 2 i2) A) (< (+ i1 1) A) (<= A i1)), 28111#(or (<= A (+ 5 i1)) (<= (+ 2 i2) A) (< (+ 6 i1) A)), 28069#(or (<= (+ i2 1) A) (< i1 A)), 28075#(or (< i1 A) (<= 6 A)), 28109#(or (<= A (+ i1 4)) (<= (+ 6 i2) A) (< (+ 5 i1) A)), 28123#(or (<= A (+ 5 i1)) (< (+ 6 i1) A) (<= 6 A)), 28106#(or (<= (+ 3 i2) A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 28078#(or (<= (+ 3 i2) A) (< (+ i1 1) A) (<= A i1)), 28104#(or (<= (+ i2 1) A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 28095#(or (<= (+ 6 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 28098#(or (<= (+ 2 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 28080#(or (< (+ i1 1) A) (<= (+ 5 i2) A) (<= A i1)), 28117#(or (<= A 5) (<= (+ 2 i2) A) (< 6 A)), 28122#(or (<= A 5) (<= (+ 6 i2) A) (< 6 A)), 28103#(or (<= A (+ 3 i1)) (< (+ i1 4) A) (<= 6 A)), 28082#(or (< (+ i1 1) A) (<= 6 A) (<= A i1))] [2022-03-15 22:14:43,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-03-15 22:14:43,775 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:43,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-03-15 22:14:43,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=747, Invalid=4953, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 22:14:43,776 INFO L87 Difference]: Start difference. First operand 407 states and 1161 transitions. Second operand has 70 states, 70 states have (on average 2.942857142857143) internal successors, (206), 70 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:53,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:53,931 INFO L93 Difference]: Finished difference Result 2010 states and 5681 transitions. [2022-03-15 22:14:53,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 265 states. [2022-03-15 22:14:53,931 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.942857142857143) internal successors, (206), 70 states have internal predecessors, (206), 0 states have call successors, (0), 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 22:14:53,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:53,938 INFO L225 Difference]: With dead ends: 2010 [2022-03-15 22:14:53,938 INFO L226 Difference]: Without dead ends: 2010 [2022-03-15 22:14:53,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 364 SyntacticMatches, 2 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43257 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=17033, Invalid=89569, Unknown=0, NotChecked=0, Total=106602 [2022-03-15 22:14:53,943 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 753 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 3138 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 3695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 3138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:53,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [753 Valid, 31 Invalid, 3695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 3138 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 22:14:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2022-03-15 22:14:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 506. [2022-03-15 22:14:53,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 2.9346534653465346) internal successors, (1482), 505 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1482 transitions. [2022-03-15 22:14:53,958 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1482 transitions. Word has length 24 [2022-03-15 22:14:53,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:53,958 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 1482 transitions. [2022-03-15 22:14:53,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 2.942857142857143) internal successors, (206), 70 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:53,958 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1482 transitions. [2022-03-15 22:14:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 22:14:53,959 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:53,959 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:53,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 22:14:54,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:54,160 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:54,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:54,160 INFO L85 PathProgramCache]: Analyzing trace with hash 678599293, now seen corresponding path program 25 times [2022-03-15 22:14:54,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:54,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933385354] [2022-03-15 22:14:54,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:54,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:54,248 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:54,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933385354] [2022-03-15 22:14:54,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933385354] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:54,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892579552] [2022-03-15 22:14:54,248 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:14:54,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:54,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:54,249 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 22:14:54,250 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 22:14:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:54,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 22:14:54,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:54,384 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 22:14:54,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:54,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892579552] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:14:54,422 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:14:54,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2022-03-15 22:14:54,423 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1529820181] [2022-03-15 22:14:54,423 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:14:54,424 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:14:54,446 INFO L252 McrAutomatonBuilder]: Finished intersection with 147 states and 317 transitions. [2022-03-15 22:14:54,446 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:56,196 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 54 new interpolants: [32061#(or (<= i2 (+ i1 1)) (<= A i1)), 32104#(or (<= A (+ i2 4)) (<= (+ 6 i2) A)), 32064#(or (<= (+ 2 i2) i1) (<= A i1)), 32079#(or (<= i2 (+ i1 4)) (<= A (+ 3 i1))), 32087#(or (<= A (+ 2 i2)) (<= (+ i2 4) A)), 32107#(or (<= i2 4) (<= A 4)), 32085#(or (<= A i2) (<= (+ 2 i2) A)), 32102#(or (<= 1 i1) (<= A (+ 3 i1))), 32103#(or (<= 0 i1) (<= A (+ i1 4))), 32109#(or (<= i2 2) (<= A 4)), 32059#(<= A i1), 32090#(or (<= A (+ 3 i1)) (<= i2 (+ 2 i1))), 32075#(or (<= A (+ i1 1)) (<= 3 i1)), 32072#(or (<= (+ i2 4) i1) (<= A i1)), 32110#(or (<= i2 1) (<= A 4)), 32097#(or (<= A (+ 2 i1)) (<= (+ 2 i2) i1)), 32099#(or (<= i2 (+ i1 1)) (<= A (+ i1 4))), 32082#(<= A (+ 5 i1)), 32080#(or (<= A (+ 2 i1)) (<= i2 (+ 2 i1))), 32086#(or (<= (+ 3 i2) A) (<= A (+ i2 1))), 32105#(<= A 5), 32060#(<= A (+ i1 1)), 32106#(or (<= i2 5) (<= A 4)), 32101#(or (<= 2 i1) (<= A (+ 2 i1))), 32070#(or (<= A i1) (<= (+ 3 i2) i1)), 32068#(or (<= A (+ i1 1)) (<= i2 i1)), 32088#(or (<= A (+ 3 i2)) (<= (+ 5 i2) A)), 32096#(or (<= A (+ 3 i1)) (<= i2 i1)), 32074#(or (<= 4 i1) (<= A i1)), 32083#(or (<= A (+ i1 4)) (<= i2 (+ 5 i1))), 32073#(or (<= A (+ i1 1)) (<= (+ 3 i2) i1)), 32066#(or (<= A (+ i1 1)) (<= i2 (+ 2 i1))), 32093#(or (<= i2 (+ i1 1)) (<= A (+ 3 i1))), 32094#(or (<= A (+ i1 4)) (<= i2 (+ 2 i1))), 32111#(or (<= A 4) (<= 6 A)), 32065#(<= A (+ 2 i1)), 32062#(or (<= A i1) (<= i2 i1)), 32067#(or (<= i2 (+ i1 1)) (<= A (+ i1 1))), 32091#(or (<= A (+ i1 4)) (<= i2 (+ 3 i1))), 32092#(or (<= A (+ 2 i1)) (<= i2 i1)), 32089#(or (<= i2 (+ i1 1)) (<= A (+ 2 i1))), 32071#(or (<= A (+ i1 1)) (<= (+ 2 i2) i1)), 32108#(or (<= i2 3) (<= A 4)), 32077#(or (<= A (+ 2 i1)) (<= i2 (+ 3 i1))), 32069#(or (<= A (+ i1 1)) (<= (+ i2 1) i1)), 32076#(<= A (+ 3 i1)), 32112#(or (<= i2 0) (<= A 4)), 32081#(or (<= A (+ 3 i1)) (<= i2 (+ 3 i1))), 32063#(or (<= A i1) (<= (+ i2 1) i1)), 32078#(<= A (+ i1 4)), 32084#(or (<= A (+ i1 4)) (<= i2 (+ i1 4))), 32100#(or (<= A (+ i1 4)) (<= i2 i1)), 32095#(or (<= A (+ 2 i1)) (<= (+ i2 1) i1)), 32098#(or (<= A (+ 3 i1)) (<= (+ i2 1) i1))] [2022-03-15 22:14:56,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-03-15 22:14:56,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:56,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-03-15 22:14:56,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1160, Invalid=4540, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 22:14:56,197 INFO L87 Difference]: Start difference. First operand 506 states and 1482 transitions. Second operand has 69 states, 69 states have (on average 2.869565217391304) internal successors, (198), 69 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:04,074 INFO L93 Difference]: Finished difference Result 1047 states and 2832 transitions. [2022-03-15 22:15:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 250 states. [2022-03-15 22:15:04,074 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.869565217391304) internal successors, (198), 69 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 22:15:04,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:04,077 INFO L225 Difference]: With dead ends: 1047 [2022-03-15 22:15:04,077 INFO L226 Difference]: Without dead ends: 1015 [2022-03-15 22:15:04,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 344 SyntacticMatches, 1 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36353 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=20950, Invalid=76082, Unknown=0, NotChecked=0, Total=97032 [2022-03-15 22:15:04,081 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 429 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 2785 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 3153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 2785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:04,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 19 Invalid, 3153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 2785 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 22:15:04,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2022-03-15 22:15:04,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 294. [2022-03-15 22:15:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 2.6621160409556315) internal successors, (780), 293 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 780 transitions. [2022-03-15 22:15:04,088 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 780 transitions. Word has length 24 [2022-03-15 22:15:04,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:04,088 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 780 transitions. [2022-03-15 22:15:04,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.869565217391304) internal successors, (198), 69 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 780 transitions. [2022-03-15 22:15:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:15:04,088 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:04,088 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:04,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:04,305 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,SelfDestructingSolverStorable30 [2022-03-15 22:15:04,305 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:04,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2072935888, now seen corresponding path program 26 times [2022-03-15 22:15:04,306 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:04,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235870908] [2022-03-15 22:15:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:04,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:04,596 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 22:15:04,597 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:04,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235870908] [2022-03-15 22:15:04,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235870908] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:04,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163705901] [2022-03-15 22:15:04,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:15:04,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:04,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:04,598 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 22:15:04,601 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 22:15:04,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:15:04,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:04,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-15 22:15:04,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:04,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:15:04,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:15:04,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:15:04,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2022-03-15 22:15:04,925 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 22:15:04,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:05,140 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:15:05,140 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 52 [2022-03-15 22:15:05,213 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 22:15:05,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163705901] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:05,213 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:05,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2022-03-15 22:15:05,214 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [795861243] [2022-03-15 22:15:05,214 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:05,215 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:05,241 INFO L252 McrAutomatonBuilder]: Finished intersection with 172 states and 373 transitions. [2022-03-15 22:15:05,242 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:13,074 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 64 new interpolants: [34652#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ (* B 4) x2)))), 34680#(and (or (= (* 6 B) (select queue start)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 34646#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) x1))) (or (not (= (select queue end) x1)) (<= end start))), 34663#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end)))) (or (not (= (+ (* B 4) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2)))), 34685#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ x2 B)))), 34642#(and (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 34671#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (+ x1 (* 5 B)) (select queue end))))), 34678#(and (or (not (= (select queue end) x1)) (= (* 6 B) (select queue start))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 34693#(and (or (not (= (* 6 B) (select queue end))) (<= end start)) (or (not (= (* 6 B) (select queue end))) (= (select queue start) (+ x2 B))) (or (< start (+ end 1)) (not (= (* 6 B) (select queue end))))), 34688#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ (* B 4) x2))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 34684#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) x2)) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 34666#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) x2) (not (= (+ x1 (* 5 B)) (select queue end))))), 34683#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (* 6 B) (select queue start)) (not (= (+ x1 (* 5 B)) (select queue end))))), 34695#(and (or (not (= (* 6 B) (select queue end))) (<= end start)) (or (not (= (* 6 B) (select queue end))) (= (select queue start) (+ (* 3 B) x2))) (or (< start (+ end 1)) (not (= (* 6 B) (select queue end))))), 34659#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ x2 (* 5 B)))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 34660#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) x2) (not (= (+ (* B 4) x1) (select queue end))))), 34645#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) (+ (* B 4) x2)) (not (= (select queue end) (+ x1 B))))), 34679#(and (or (= (* 6 B) (select queue start)) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 34667#(and (or (not (= (+ x1 (* 5 B)) (select queue end))) (= (select queue start) (+ x2 B))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 34637#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ x2 B)))), 34674#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (select queue end) (+ (* 2 B) x1))))), 34656#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 2 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 34672#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 6 B) x2)))), 34647#(and (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 34686#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ (* 2 B) x2)))), 34658#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* B 4) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 34692#(and (or (not (= (* 6 B) (select queue end))) (<= end start)) (or (< start (+ end 1)) (not (= (* 6 B) (select queue end)))) (or (= (select queue start) x2) (not (= (* 6 B) (select queue end))))), 34699#(and (or (not (= (* 6 B) (select queue end))) (<= end start)) (or (< start (+ end 1)) (not (= (* 6 B) (select queue end))))), 34673#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (select queue end) (+ x1 B))))), 34639#(and (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 34694#(and (or (not (= (* 6 B) (select queue end))) (<= end start)) (or (< start (+ end 1)) (not (= (* 6 B) (select queue end)))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (* 6 B) (select queue end))))), 34664#(and (or (= (select queue start) (+ (* B 4) x2)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 34682#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (* 6 B) (select queue start)) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 34662#(and (or (= (select queue start) (+ (* 2 B) x2)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 34690#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ (* 6 B) x2))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 34696#(and (or (not (= (* 6 B) (select queue end))) (<= end start)) (or (not (= (* 6 B) (select queue end))) (= (select queue start) (+ (* B 4) x2))) (or (< start (+ end 1)) (not (= (* 6 B) (select queue end))))), 34636#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (= (select queue start) x2) (not (= (select queue end) x1)))), 34638#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 2 B) x2)))), 34657#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 34651#(and (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ (* 3 B) x2))) (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 34649#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 34689#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ x2 (* 5 B)))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 34640#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) x2) (not (= (select queue end) (+ x1 B))))), 34641#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 34655#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ x2 B))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 34676#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 34698#(and (or (not (= (* 6 B) (select queue end))) (<= end start)) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (* 6 B) (select queue end)))) (or (< start (+ end 1)) (not (= (* 6 B) (select queue end))))), 34644#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 34675#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 6 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 34654#(and (or (= (select queue start) x2) (not (= (+ (* 3 B) x1) (select queue end)))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 34643#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* B 4) x2)))), 34668#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (+ x1 (* 5 B)) (select queue end))))), 34681#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (= (* 6 B) (select queue start))) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 34677#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (+ x1 (* 5 B)) (select queue end))))), 34665#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 34648#(and (or (= (select queue start) x2) (not (= (select queue end) (+ (* 2 B) x1)))) (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 34661#(and (or (= (select queue start) (+ x2 B)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 34653#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (+ (* 2 B) x1))))), 34650#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 34670#(and (or (= (select queue start) (+ (* B 4) x2)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 34697#(and (or (not (= (* 6 B) (select queue end))) (<= end start)) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (* 6 B) (select queue end)))) (or (< start (+ end 1)) (not (= (* 6 B) (select queue end))))), 34669#(and (or (not (= (+ x1 (* 5 B)) (select queue end))) (= (select queue start) (+ (* 3 B) x2))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 34687#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2)))), 34691#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (* 6 B) (select queue start))))] [2022-03-15 22:15:13,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-03-15 22:15:13,074 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:13,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-03-15 22:15:13,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=9623, Unknown=0, NotChecked=0, Total=9900 [2022-03-15 22:15:13,075 INFO L87 Difference]: Start difference. First operand 294 states and 780 transitions. Second operand has 84 states, 83 states have (on average 2.8313253012048194) internal successors, (235), 83 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 22:15:27,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:27,906 INFO L93 Difference]: Finished difference Result 597 states and 1733 transitions. [2022-03-15 22:15:27,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-03-15 22:15:27,906 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 83 states have (on average 2.8313253012048194) internal successors, (235), 83 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) Word has length 25 [2022-03-15 22:15:27,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:27,908 INFO L225 Difference]: With dead ends: 597 [2022-03-15 22:15:27,908 INFO L226 Difference]: Without dead ends: 589 [2022-03-15 22:15:27,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 111 SyntacticMatches, 9 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7531 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1223, Invalid=36219, Unknown=0, NotChecked=0, Total=37442 [2022-03-15 22:15:27,910 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 67 mSDsluCounter, 7366 mSDsCounter, 0 mSdLazyCounter, 18846 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 19121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 18846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:27,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 2 Invalid, 19121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 18846 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-03-15 22:15:27,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-03-15 22:15:27,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 346. [2022-03-15 22:15:27,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 2.7594202898550724) internal successors, (952), 345 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 952 transitions. [2022-03-15 22:15:27,916 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 952 transitions. Word has length 25 [2022-03-15 22:15:27,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:27,916 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 952 transitions. [2022-03-15 22:15:27,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 83 states have (on average 2.8313253012048194) internal successors, (235), 83 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 22:15:27,916 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 952 transitions. [2022-03-15 22:15:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 22:15:27,917 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:27,917 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:27,933 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 22:15:28,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:28,127 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:28,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:28,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1165879564, now seen corresponding path program 27 times [2022-03-15 22:15:28,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:28,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185752907] [2022-03-15 22:15:28,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:28,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:28,362 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 22:15:28,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:28,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185752907] [2022-03-15 22:15:28,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185752907] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:28,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042581645] [2022-03-15 22:15:28,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:15:28,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:28,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:28,364 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 22:15:28,364 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 22:15:28,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 22:15:28,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:28,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 22:15:28,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:28,709 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:15:28,709 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 75 treesize of output 39 [2022-03-15 22:15:28,727 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 22:15:28,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:28,780 INFO L353 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-03-15 22:15:28,780 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 24 treesize of output 30 [2022-03-15 22:15:29,229 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 22:15:29,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042581645] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:29,229 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:29,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 43 [2022-03-15 22:15:29,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [257205114] [2022-03-15 22:15:29,230 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:29,232 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:29,255 INFO L252 McrAutomatonBuilder]: Finished intersection with 163 states and 355 transitions. [2022-03-15 22:15:29,255 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:31,589 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [36376#(and (<= end (+ start 1)) (= (+ (* 3 B) x1) (select queue start)) (< start end)), 36391#(and (= end start) (= x2 0)), 36375#(and (= x2 (+ (* 2 B) x1)) (= end start)), 36378#(and (<= end (+ start 1)) (= (+ (* B 4) x1) (select queue start)) (< start end)), 36377#(and (= (+ (* 3 B) x1) x2) (= end start)), 36388#(and (= end start) (= (* 3 B) x2)), 36382#(and (<= end (+ start 1)) (= (+ (* 6 B) x1) (select queue start)) (< start end)), 36383#(and (= (+ (* 6 B) x1) x2) (= end start)), 36390#(and (= x2 B) (= end start)), 36385#(and (= (* 6 B) x2) (= end start)), 36372#(and (<= end (+ start 1)) (= (select queue start) (+ x1 B)) (< start end)), 36379#(and (= (+ (* B 4) x1) x2) (= end start)), 36386#(and (= x2 (* 5 B)) (= end start)), 36380#(and (<= end (+ start 1)) (= (+ x1 (* 5 B)) (select queue start)) (< start end)), 36374#(and (= (select queue start) (+ (* 2 B) x1)) (<= end (+ start 1)) (< start end)), 36387#(and (= (* B 4) x2) (= end start)), 36389#(and (= (* 2 B) x2) (= end start)), 36384#(and (= (* 6 B) (select queue start)) (<= end (+ start 1)) (< start end)), 36381#(and (= (+ x1 (* 5 B)) x2) (= end start)), 36373#(and (= x2 (+ x1 B)) (= end start))] [2022-03-15 22:15:31,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 22:15:31,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:31,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 22:15:31,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=3890, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:15:31,590 INFO L87 Difference]: Start difference. First operand 346 states and 952 transitions. Second operand has 40 states, 39 states have (on average 3.128205128205128) internal successors, (122), 39 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:38,693 INFO L93 Difference]: Finished difference Result 811 states and 2479 transitions. [2022-03-15 22:15:38,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-03-15 22:15:38,694 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.128205128205128) internal successors, (122), 39 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 25 [2022-03-15 22:15:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:38,697 INFO L225 Difference]: With dead ends: 811 [2022-03-15 22:15:38,697 INFO L226 Difference]: Without dead ends: 803 [2022-03-15 22:15:38,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 132 SyntacticMatches, 14 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6802 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=982, Invalid=23824, Unknown=0, NotChecked=0, Total=24806 [2022-03-15 22:15:38,698 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 48 mSDsluCounter, 4743 mSDsCounter, 0 mSdLazyCounter, 15212 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 15340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 15212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:38,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 2 Invalid, 15340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 15212 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-03-15 22:15:38,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2022-03-15 22:15:38,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 490. [2022-03-15 22:15:38,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 2.8752556237218814) internal successors, (1406), 489 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1406 transitions. [2022-03-15 22:15:38,706 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1406 transitions. Word has length 25 [2022-03-15 22:15:38,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:38,706 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 1406 transitions. [2022-03-15 22:15:38,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.128205128205128) internal successors, (122), 39 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:38,707 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1406 transitions. [2022-03-15 22:15:38,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 22:15:38,708 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:38,708 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:38,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:38,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:38,920 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:38,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:38,920 INFO L85 PathProgramCache]: Analyzing trace with hash 232298575, now seen corresponding path program 28 times [2022-03-15 22:15:38,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:38,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343090769] [2022-03-15 22:15:38,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:38,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:39,006 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 22:15:39,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:39,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343090769] [2022-03-15 22:15:39,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343090769] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:39,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466550527] [2022-03-15 22:15:39,006 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:15:39,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:39,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:39,007 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 22:15:39,008 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 22:15:39,033 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:15:39,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:39,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:15:39,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:39,149 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 22:15:39,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:39,190 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 22:15:39,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466550527] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:39,190 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:39,190 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 24 [2022-03-15 22:15:39,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1613807483] [2022-03-15 22:15:39,190 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:39,192 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:39,221 INFO L252 McrAutomatonBuilder]: Finished intersection with 191 states and 418 transitions. [2022-03-15 22:15:39,221 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:42,308 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 71 new interpolants: [38609#(or (<= A i2) (<= A 5) (< 6 A)), 38561#(or (<= A (+ 3 i2)) (< (+ i1 1) A) (<= A i1)), 38555#(or (<= A (+ 5 i2)) (< i1 A)), 38556#(or (<= A (+ 6 i2)) (< i1 A)), 38604#(or (<= A (+ 6 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 38602#(or (<= A (+ 5 i2)) (<= A (+ i1 4)) (< (+ 5 i1) A)), 38588#(or (<= A (+ 3 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 38587#(or (<= A (+ i1 4)) (<= A (+ 2 i2)) (< (+ 5 i1) A)), 38570#(or (<= A (+ i2 4)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 38608#(or (<= A 5) (< 6 A)), 38567#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ i2 1))), 38619#(or (<= A 6) (<= A (+ 5 i1)) (< (+ 6 i1) A)), 38605#(or (<= A (+ 3 i1)) (<= A (+ 6 i2)) (< (+ i1 4) A)), 38612#(or (<= A (+ 3 i2)) (<= A 5) (< 6 A)), 38552#(or (<= A (+ 2 i2)) (< i1 A)), 38571#(or (<= A (+ 5 i2)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 38592#(or (<= A (+ 5 i1)) (<= A i2) (< (+ 6 i1) A)), 38615#(or (<= A 5) (<= A (+ 6 i2)) (< 6 A)), 38596#(or (<= A (+ i2 4)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 38576#(or (<= A (+ 2 i1)) (< (+ 3 i1) A)), 38581#(or (<= A i2) (<= A (+ i1 4)) (< (+ 5 i1) A)), 38554#(or (<= A (+ i2 4)) (< i1 A)), 38557#(or (< (+ i1 1) A) (<= A i1)), 38585#(or (<= A (+ 2 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 38614#(or (<= A (+ 5 i2)) (<= A 5) (< 6 A)), 38616#(or (<= A 6) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 38579#(or (<= A i2) (<= A (+ 3 i1)) (< (+ i1 4) A)), 38601#(or (<= A (+ 5 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 38590#(or (<= A (+ 3 i2)) (<= A (+ i1 4)) (< (+ 5 i1) A)), 38598#(or (<= A (+ i2 4)) (<= A (+ i1 4)) (< (+ 5 i1) A)), 38582#(or (<= A (+ i2 1)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 38594#(or (<= A (+ 5 i1)) (<= A (+ 2 i2)) (< (+ 6 i1) A)), 38610#(or (<= A 5) (<= A (+ i2 1)) (< 6 A)), 38563#(or (<= A (+ 5 i2)) (< (+ i1 1) A) (<= A i1)), 38569#(or (<= A (+ 3 i2)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 38564#(or (<= A (+ 6 i2)) (< (+ i1 1) A) (<= A i1)), 38575#(or (<= A 6) (<= A (+ i1 1)) (< (+ 2 i1) A)), 38551#(or (<= A (+ i2 1)) (< i1 A)), 38568#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ 2 i2))), 38591#(or (<= A (+ 5 i1)) (< (+ 6 i1) A)), 38553#(or (<= A (+ 3 i2)) (< i1 A)), 38600#(or (<= A (+ 5 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 38549#(< i1 A), 38550#(or (<= A i2) (< i1 A)), 38562#(or (<= A (+ i2 4)) (< (+ i1 1) A) (<= A i1)), 38611#(or (<= A 5) (<= A (+ 2 i2)) (< 6 A)), 38617#(or (<= A 6) (<= A (+ 3 i1)) (< (+ i1 4) A)), 38603#(or (<= A (+ 5 i1)) (<= A (+ 5 i2)) (< (+ 6 i1) A)), 38613#(or (<= A (+ i2 4)) (<= A 5) (< 6 A)), 38578#(or (<= A i2) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 38595#(or (<= A (+ 5 i1)) (<= A (+ 3 i2)) (< (+ 6 i1) A)), 38607#(or (<= A (+ 5 i1)) (<= A (+ 6 i2)) (< (+ 6 i1) A)), 38586#(or (<= A (+ 2 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 38597#(or (<= A (+ i2 4)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 38565#(or (<= A (+ i1 1)) (< (+ 2 i1) A)), 38618#(or (<= A 6) (<= A (+ i1 4)) (< (+ 5 i1) A)), 38599#(or (<= A (+ 5 i1)) (<= A (+ i2 4)) (< (+ 6 i1) A)), 38583#(or (<= A (+ i2 1)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 38560#(or (<= A (+ 2 i2)) (< (+ i1 1) A) (<= A i1)), 38559#(or (<= A (+ i2 1)) (< (+ i1 1) A) (<= A i1)), 38584#(or (<= A (+ i1 4)) (<= A (+ i2 1)) (< (+ 5 i1) A)), 38606#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= A (+ 6 i2))), 38566#(or (<= A i2) (<= A (+ i1 1)) (< (+ 2 i1) A)), 38580#(or (<= A (+ i1 4)) (< (+ 5 i1) A)), 38574#(or (<= A 6) (< (+ i1 1) A) (<= A i1)), 38589#(or (<= A (+ 3 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 38572#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ 6 i2))), 38593#(or (<= A (+ 5 i1)) (<= A (+ i2 1)) (< (+ 6 i1) A)), 38558#(or (<= A i2) (< (+ i1 1) A) (<= A i1)), 38573#(or (<= A 6) (< i1 A)), 38577#(or (<= A (+ 3 i1)) (< (+ i1 4) A))] [2022-03-15 22:15:42,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-03-15 22:15:42,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:42,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-03-15 22:15:42,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1048, Invalid=7882, Unknown=0, NotChecked=0, Total=8930 [2022-03-15 22:15:42,309 INFO L87 Difference]: Start difference. First operand 490 states and 1406 transitions. Second operand has 88 states, 88 states have (on average 2.9318181818181817) internal successors, (258), 88 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:49,442 INFO L93 Difference]: Finished difference Result 1145 states and 3170 transitions. [2022-03-15 22:15:49,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2022-03-15 22:15:49,442 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 2.9318181818181817) internal successors, (258), 88 states have internal predecessors, (258), 0 states have call successors, (0), 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 22:15:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:49,446 INFO L225 Difference]: With dead ends: 1145 [2022-03-15 22:15:49,446 INFO L226 Difference]: Without dead ends: 1102 [2022-03-15 22:15:49,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16686 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10985, Invalid=48795, Unknown=0, NotChecked=0, Total=59780 [2022-03-15 22:15:49,450 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 464 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 3698 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 4040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 3698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:49,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [464 Valid, 29 Invalid, 4040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 3698 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 22:15:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2022-03-15 22:15:49,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 519. [2022-03-15 22:15:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 2.841698841698842) internal successors, (1472), 518 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1472 transitions. [2022-03-15 22:15:49,474 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 1472 transitions. Word has length 26 [2022-03-15 22:15:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:49,474 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 1472 transitions. [2022-03-15 22:15:49,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 2.9318181818181817) internal successors, (258), 88 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1472 transitions. [2022-03-15 22:15:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 22:15:49,475 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:49,475 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:49,492 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 22:15:49,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:49,692 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:49,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:49,692 INFO L85 PathProgramCache]: Analyzing trace with hash -482355051, now seen corresponding path program 29 times [2022-03-15 22:15:49,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:49,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620561378] [2022-03-15 22:15:49,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:49,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:49,786 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:49,787 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:49,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620561378] [2022-03-15 22:15:49,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620561378] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:49,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368017478] [2022-03-15 22:15:49,787 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:15:49,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:49,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:49,788 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 22:15:49,789 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 22:15:49,814 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 22:15:49,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:49,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:15:49,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:49,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:49,961 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:49,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368017478] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:49,961 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:49,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 24 [2022-03-15 22:15:49,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2005707841] [2022-03-15 22:15:49,961 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:49,963 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:49,994 INFO L252 McrAutomatonBuilder]: Finished intersection with 189 states and 413 transitions. [2022-03-15 22:15:49,994 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:53,114 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 71 new interpolants: [41491#(or (<= A 6) (< 7 A) (<= (+ 6 i2) A)), 41465#(or (<= (+ 6 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 41488#(or (<= A (+ 6 i1)) (<= (+ 5 i2) A) (< (+ 7 i1) A)), 41456#(or (< (+ i1 1) A) (<= (+ 5 i2) A) (<= A i1)), 41446#(or (<= A (+ 5 i1)) (<= (+ 2 i2) A) (< (+ 6 i1) A)), 41482#(or (<= A (+ 6 i1)) (<= (+ 2 i2) A) (< (+ 7 i1) A)), 41462#(or (<= (+ 6 i2) A) (< i1 A)), 41484#(or (<= A (+ 6 i1)) (<= (+ 3 i2) A) (< (+ 7 i1) A)), 41432#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 2 i2) A)), 41453#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= (+ i2 4) A)), 41472#(or (<= (+ 7 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 41497#(or (<= A (+ 6 i1)) (<= 7 A) (< (+ 7 i1) A)), 41479#(or (<= 7 A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 41441#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 3 i2) A)), 41466#(or (<= (+ 6 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 41480#(or (<= A (+ 6 i1)) (<= (+ i2 1) A) (< (+ 7 i1) A)), 41486#(or (<= A (+ 6 i1)) (<= (+ i2 4) A) (< (+ 7 i1) A)), 41429#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ i2 1) A)), 41450#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ i2 4) A)), 41443#(or (<= (+ 3 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 41476#(or (<= 7 A) (< i1 A)), 41477#(or (<= 7 A) (< (+ i1 1) A) (<= A i1)), 41460#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= (+ 5 i2) A)), 41439#(or (<= (+ 3 i2) A) (< i1 A)), 41494#(or (<= 7 A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 41427#(or (<= (+ i2 1) A) (< i1 A)), 41454#(or (<= A (+ 5 i1)) (<= (+ i2 4) A) (< (+ 6 i1) A)), 41487#(or (<= A 6) (< 7 A) (<= (+ i2 4) A)), 41461#(or (<= A (+ 5 i1)) (< (+ 6 i1) A) (<= (+ 5 i2) A)), 41495#(or (<= 7 A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 41448#(or (<= (+ i2 4) A) (< i1 A)), 41469#(or (<= (+ 7 i2) A) (< i1 A)), 41444#(or (<= (+ 3 i2) A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 41474#(or (<= A (+ i1 4)) (<= (+ 7 i2) A) (< (+ 5 i1) A)), 41478#(or (<= 7 A) (<= A (+ i1 1)) (< (+ 2 i1) A)), 41489#(or (<= A 6) (< 7 A) (<= (+ 5 i2) A)), 41435#(or (<= (+ i2 1) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 41468#(or (<= A (+ 5 i1)) (<= (+ 6 i2) A) (< (+ 6 i1) A)), 41451#(or (<= (+ i2 4) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 41447#(or (<= A (+ 5 i1)) (<= (+ 3 i2) A) (< (+ 6 i1) A)), 41463#(or (<= (+ 6 i2) A) (< (+ i1 1) A) (<= A i1)), 41449#(or (<= (+ i2 4) A) (< (+ i1 1) A) (<= A i1)), 41431#(or (<= (+ 2 i2) A) (< (+ i1 1) A) (<= A i1)), 41436#(or (<= (+ 2 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 41442#(or (<= (+ 3 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 41471#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 7 i2) A)), 41458#(or (<= A (+ 2 i1)) (< (+ 3 i1) A) (<= (+ 5 i2) A)), 41496#(or (<= A (+ 5 i1)) (<= 7 A) (< (+ 6 i1) A)), 41467#(or (<= A (+ i1 4)) (<= (+ 6 i2) A) (< (+ 5 i1) A)), 41455#(or (< i1 A) (<= (+ 5 i2) A)), 41470#(or (<= (+ 7 i2) A) (< (+ i1 1) A) (<= A i1)), 41440#(or (<= (+ 3 i2) A) (< (+ i1 1) A) (<= A i1)), 41464#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 6 i2) A)), 41475#(or (<= A (+ 5 i1)) (<= (+ 7 i2) A) (< (+ 6 i1) A)), 41445#(or (<= A (+ 5 i1)) (<= (+ i2 1) A) (< (+ 6 i1) A)), 41481#(or (<= A 6) (< 7 A) (<= (+ i2 1) A)), 41492#(or (<= A (+ 6 i1)) (<= (+ 7 i2) A) (< (+ 7 i1) A)), 41493#(or (<= A 6) (< 7 A) (<= (+ 7 i2) A)), 41438#(or (<= A (+ i1 4)) (<= (+ 2 i2) A) (< (+ 5 i1) A)), 41485#(or (<= A 6) (< 7 A) (<= (+ 3 i2) A)), 41428#(or (<= (+ i2 1) A) (< (+ i1 1) A) (<= A i1)), 41483#(or (<= A 6) (< 7 A) (<= (+ 2 i2) A)), 41437#(or (<= (+ i2 1) A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 41457#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 5 i2) A)), 41433#(or (<= (+ i2 1) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 41459#(or (<= A (+ 3 i1)) (< (+ i1 4) A) (<= (+ 5 i2) A)), 41430#(or (<= (+ 2 i2) A) (< i1 A)), 41452#(or (<= (+ i2 4) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 41490#(or (<= A (+ 6 i1)) (<= (+ 6 i2) A) (< (+ 7 i1) A)), 41473#(or (<= (+ 7 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 41434#(or (<= (+ 2 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A))] [2022-03-15 22:15:53,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-03-15 22:15:53,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:53,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-03-15 22:15:53,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1070, Invalid=7860, Unknown=0, NotChecked=0, Total=8930 [2022-03-15 22:15:53,116 INFO L87 Difference]: Start difference. First operand 519 states and 1472 transitions. Second operand has 88 states, 88 states have (on average 2.9318181818181817) internal successors, (258), 88 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:10,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:10,510 INFO L93 Difference]: Finished difference Result 2946 states and 8373 transitions. [2022-03-15 22:16:10,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 379 states. [2022-03-15 22:16:10,510 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 2.9318181818181817) internal successors, (258), 88 states have internal predecessors, (258), 0 states have call successors, (0), 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 22:16:10,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:10,521 INFO L225 Difference]: With dead ends: 2946 [2022-03-15 22:16:10,521 INFO L226 Difference]: Without dead ends: 2946 [2022-03-15 22:16:10,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 955 GetRequests, 497 SyntacticMatches, 2 SemanticMatches, 456 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89291 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=31687, Invalid=177619, Unknown=0, NotChecked=0, Total=209306 [2022-03-15 22:16:10,528 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1064 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 4408 mSolverCounterSat, 1011 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 5419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1011 IncrementalHoareTripleChecker+Valid, 4408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:10,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1064 Valid, 38 Invalid, 5419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1011 Valid, 4408 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 22:16:10,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2022-03-15 22:16:10,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 642. [2022-03-15 22:16:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 2.909516380655226) internal successors, (1865), 641 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:10,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1865 transitions. [2022-03-15 22:16:10,547 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1865 transitions. Word has length 26 [2022-03-15 22:16:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:10,547 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 1865 transitions. [2022-03-15 22:16:10,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 2.9318181818181817) internal successors, (258), 88 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1865 transitions. [2022-03-15 22:16:10,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 22:16:10,548 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:10,548 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:10,567 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 22:16:10,754 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,SelfDestructingSolverStorable34 [2022-03-15 22:16:10,754 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:10,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:10,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1432633839, now seen corresponding path program 30 times [2022-03-15 22:16:10,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:10,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761192747] [2022-03-15 22:16:10,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:10,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:10,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:10,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761192747] [2022-03-15 22:16:10,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761192747] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:10,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805828335] [2022-03-15 22:16:10,840 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:16:10,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:10,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:10,841 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 22:16:10,841 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 22:16:10,874 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 22:16:10,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:10,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:16:10,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:10,991 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 22:16:10,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:11,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805828335] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:11,030 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:11,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2022-03-15 22:16:11,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1631571314] [2022-03-15 22:16:11,030 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:11,032 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:11,061 INFO L252 McrAutomatonBuilder]: Finished intersection with 182 states and 400 transitions. [2022-03-15 22:16:11,061 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:13,496 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 70 new interpolants: [47052#(or (<= A (+ i1 4)) (<= i2 i1)), 47042#(or (<= A 5) (<= i2 3)), 47049#(or (<= A (+ 3 i1)) (<= (+ i2 1) i1)), 47055#(or (<= A (+ i1 4)) (<= 1 i1)), 47044#(or (<= A (+ i2 4)) (<= (+ 6 i2) A)), 46998#(or (<= A i1) (<= (+ 3 i2) i1)), 47008#(or (<= (+ i2 4) i1) (<= A (+ i1 1))), 47037#(or (<= A (+ 2 i2)) (<= (+ i2 4) A)), 47016#(or (<= A (+ 2 i1)) (<= (+ i2 1) i1)), 47010#(or (<= A (+ i1 1)) (<= 4 i1)), 47034#(or (<= A (+ 5 i1)) (<= i2 (+ 3 i1))), 47006#(or (<= A (+ i1 1)) (<= (+ 3 i2) i1)), 47036#(or (<= (+ 3 i2) A) (<= A (+ i2 1))), 47053#(or (<= A (+ i1 4)) (<= (+ i2 1) i1)), 47058#(or (<= A (+ 5 i1)) (<= i2 i1)), 47005#(or (<= (+ i2 4) i1) (<= A i1)), 47032#(or (<= A (+ 5 i1)) (<= i2 (+ 5 i1))), 47048#(or (<= i2 2) (<= A 5)), 47043#(or (<= A (+ 3 i2)) (<= (+ 5 i2) A)), 47023#(or (<= A (+ 3 i1)) (<= i2 (+ 2 i1))), 47054#(or (<= 2 i1) (<= A (+ 3 i1))), 47018#(or (<= A (+ 2 i1)) (<= (+ 3 i2) i1)), 47057#(or (<= A (+ 5 i1)) (<= i2 (+ i1 1))), 47026#(or (<= A (+ i1 4)) (<= i2 (+ 5 i1))), 47031#(or (<= A (+ 5 i1)) (<= i2 (+ 6 i1))), 47035#(or (<= A i2) (<= (+ 2 i2) A)), 46999#(<= A (+ 2 i1)), 47003#(or (<= A (+ i1 1)) (<= (+ i2 1) i1)), 47045#(or (<= A (+ 3 i1)) (<= i2 i1)), 47011#(<= A (+ 3 i1)), 47027#(or (<= A (+ i1 4)) (<= i2 (+ i1 4))), 47028#(or (<= A (+ i1 4)) (<= i2 (+ 3 i1))), 47007#(or (<= (+ 5 i2) i1) (<= A i1)), 47000#(or (<= A (+ i1 1)) (<= i2 (+ 2 i1))), 47012#(or (<= A (+ 2 i1)) (<= i2 (+ 3 i1))), 47021#(or (<= i2 (+ i1 4)) (<= A (+ 3 i1))), 46992#(<= A i1), 47039#(or (<= A 5) (<= i2 6)), 47009#(or (<= 5 i1) (<= A i1)), 47014#(or (<= i2 (+ i1 1)) (<= A (+ 2 i1))), 47029#(or (<= A (+ i1 4)) (<= i2 (+ 2 i1))), 47019#(or (<= 3 i1) (<= A (+ 2 i1))), 47015#(or (<= A (+ 2 i1)) (<= i2 i1)), 47033#(or (<= A (+ 5 i1)) (<= i2 (+ i1 4))), 46993#(<= A (+ i1 1)), 47001#(or (<= i2 (+ i1 1)) (<= A (+ i1 1))), 47056#(or (<= 7 A) (<= A 5)), 46996#(or (<= A i1) (<= (+ i2 1) i1)), 47061#(or (<= 0 i1) (<= A (+ 5 i1))), 47002#(or (<= A (+ i1 1)) (<= i2 i1)), 47038#(<= A 6), 47059#(or (<= A 5) (<= i2 1)), 47040#(or (<= i2 5) (<= A 5)), 47050#(or (<= A (+ 5 i2)) (<= (+ 7 i2) A)), 47041#(or (<= i2 4) (<= A 5)), 47030#(<= A (+ 6 i1)), 47024#(or (<= i2 (+ i1 1)) (<= A (+ 3 i1))), 47004#(or (<= A (+ i1 1)) (<= (+ 2 i2) i1)), 47046#(or (<= i2 (+ i1 1)) (<= A (+ i1 4))), 47022#(or (<= A (+ 3 i1)) (<= i2 (+ 3 i1))), 47017#(or (<= A (+ 2 i1)) (<= (+ 2 i2) i1)), 47013#(or (<= A (+ 2 i1)) (<= i2 (+ 2 i1))), 47051#(or (<= A (+ 3 i1)) (<= (+ 2 i2) i1)), 46994#(or (<= i2 (+ i1 1)) (<= A i1)), 46995#(or (<= A i1) (<= i2 i1)), 47020#(<= A (+ i1 4)), 47047#(or (<= A (+ 5 i1)) (<= i2 (+ 2 i1))), 46997#(or (<= (+ 2 i2) i1) (<= A i1)), 47025#(<= A (+ 5 i1)), 47060#(or (<= i2 0) (<= A 5))] [2022-03-15 22:16:13,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-03-15 22:16:13,497 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:13,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-03-15 22:16:13,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=7039, Unknown=0, NotChecked=0, Total=8930 [2022-03-15 22:16:13,498 INFO L87 Difference]: Start difference. First operand 642 states and 1865 transitions. Second operand has 87 states, 87 states have (on average 2.8620689655172415) internal successors, (249), 87 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:25,490 INFO L93 Difference]: Finished difference Result 1362 states and 3686 transitions. [2022-03-15 22:16:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 332 states. [2022-03-15 22:16:25,491 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 2.8620689655172415) internal successors, (249), 87 states have internal predecessors, (249), 0 states have call successors, (0), 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 22:16:25,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:25,494 INFO L225 Difference]: With dead ends: 1362 [2022-03-15 22:16:25,494 INFO L226 Difference]: Without dead ends: 1326 [2022-03-15 22:16:25,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 854 GetRequests, 444 SyntacticMatches, 1 SemanticMatches, 409 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65649 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=36146, Invalid=132364, Unknown=0, NotChecked=0, Total=168510 [2022-03-15 22:16:25,500 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 564 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 3760 mSolverCounterSat, 501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 4261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 3760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:25,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [564 Valid, 22 Invalid, 4261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 3760 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 22:16:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2022-03-15 22:16:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 366. [2022-03-15 22:16:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 2.66027397260274) internal successors, (971), 365 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 971 transitions. [2022-03-15 22:16:25,509 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 971 transitions. Word has length 26 [2022-03-15 22:16:25,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:25,509 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 971 transitions. [2022-03-15 22:16:25,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 2.8620689655172415) internal successors, (249), 87 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 971 transitions. [2022-03-15 22:16:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 22:16:25,510 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:25,510 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:25,526 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 22:16:25,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 22:16:25,715 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:16:25,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:25,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1999303030, now seen corresponding path program 31 times [2022-03-15 22:16:25,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:25,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25127572] [2022-03-15 22:16:25,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:25,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:26,029 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 22:16:26,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:26,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25127572] [2022-03-15 22:16:26,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25127572] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:26,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676559377] [2022-03-15 22:16:26,030 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:16:26,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:26,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:26,031 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 22:16:26,031 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 22:16:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:26,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 22:16:26,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:26,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:26,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:26,398 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:16:26,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2022-03-15 22:16:26,406 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 22:16:26,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:26,660 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:16:26,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 54 [2022-03-15 22:16:26,749 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 22:16:26,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676559377] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:26,750 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:26,750 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2022-03-15 22:16:26,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [796283807] [2022-03-15 22:16:26,750 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:26,752 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:26,807 INFO L252 McrAutomatonBuilder]: Finished intersection with 210 states and 463 transitions. [2022-03-15 22:16:26,807 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:37,642 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 81 new interpolants: [50361#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (+ x1 (* 7 B)))))), 50351#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (+ x1 (* 5 B)) (select queue end))))), 50369#(and (or (not (= (select queue end) (* 7 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 7 B))) (<= end start)) (or (not (= (select queue end) (* 7 B))) (= (select queue start) (+ (* 2 B) x2)))), 50301#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ x2 B)))), 50311#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 50346#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ x2 (* 7 B)))) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 50309#(and (or (= (select queue start) x2) (not (= (select queue end) (+ (* 2 B) x1)))) (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 50304#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* B 4) x2)))), 50368#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (* 7 B)))), 50315#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 50347#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 50306#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 6 B) x2)))), 50344#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ x2 (* 7 B))))), 50321#(and (or (= (select queue start) (+ x2 B)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 50345#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ x2 (* 7 B))))), 50355#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ x2 (* 7 B))))), 50356#(and (or (= (select queue start) x2) (not (= (select queue end) (+ x1 (* 7 B))))) (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 50300#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (= (select queue start) x2) (not (= (select queue end) x1)))), 50374#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (* 7 B))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 50373#(and (or (not (= (select queue end) (* 7 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 7 B))) (= (select queue start) (+ (* 6 B) x2))) (or (not (= (select queue end) (* 7 B))) (<= end start))), 50305#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) x1))) (or (not (= (select queue end) x1)) (<= end start))), 50314#(and (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 50365#(and (or (not (= (select queue end) (* 7 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 7 B))) (<= end start)) (or (not (= (select queue end) (* 7 B))) (= (select queue start) (+ x2 B)))), 50353#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ x2 (* 5 B)))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 50333#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) x2)) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 50366#(and (or (not (= (select queue end) x1)) (= (select queue start) (* 7 B))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 50376#(and (or (not (= (+ x1 (* 5 B)) (select queue end))) (= (select queue start) (* 7 B))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 50362#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 50317#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 50371#(and (or (not (= (select queue end) (* 7 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 7 B))) (= (select queue start) (+ (* B 4) x2))) (or (not (= (select queue end) (* 7 B))) (<= end start))), 50380#(and (or (not (= (select queue end) (* 7 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 7 B))) (<= end start))), 50335#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ (* 2 B) x2)))), 50334#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ x2 B)))), 50329#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ (* B 4) x2)))), 50327#(and (or (not (= (+ x1 (* 5 B)) (select queue end))) (= (select queue start) (+ (* 3 B) x2))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 50302#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 2 B) x2)))), 50312#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 50303#(and (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 50379#(and (or (not (= (select queue end) (* 7 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 7 B))) (= (select queue start) (+ x2 (* 7 B)))) (or (not (= (select queue end) (* 7 B))) (<= end start))), 50358#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 50330#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* B 4) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 50348#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 50322#(and (or (= (select queue start) (+ (* 2 B) x2)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 50339#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (select queue end) (+ x1 B))))), 50340#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (+ (* 2 B) x1))))), 50328#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) (+ (* B 4) x2)) (not (= (select queue end) (+ x1 B))))), 50336#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2)))), 50363#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ x2 (* 7 B))) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 50357#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (not (= (select queue end) (+ x1 (* 7 B)))) (= (select queue start) (+ x2 B)))), 50308#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) x2) (not (= (select queue end) (+ x1 B))))), 50370#(and (or (not (= (select queue end) (* 7 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 7 B))) (<= end start)) (or (not (= (select queue end) (* 7 B))) (= (select queue start) (+ (* 3 B) x2)))), 50338#(and (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 50337#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ (* B 4) x2))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 50310#(and (or (= (select queue start) x2) (not (= (+ (* 3 B) x1) (select queue end)))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 50316#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 2 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 50320#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) x2) (not (= (+ (* B 4) x1) (select queue end))))), 50350#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (+ x1 (* 5 B)) (select queue end))))), 50307#(and (or (not (= (select queue end) x1)) (= (select queue start) (+ x2 (* 7 B)))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 50318#(and (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ (* 3 B) x2))) (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 50342#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ x2 (* 5 B)))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 50359#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (not (= (select queue end) (+ x1 (* 7 B)))) (= (select queue start) (+ (* 3 B) x2))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 50360#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ (* B 4) x2)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 50352#(and (or (= (select queue start) (+ x2 (* 7 B))) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 50324#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) x2) (not (= (+ x1 (* 5 B)) (select queue end))))), 50375#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) (* 7 B)) (not (= (+ (* B 4) x1) (select queue end))))), 50354#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ (* 6 B) x2))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 50313#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ x2 B))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 50326#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (+ x1 (* 5 B)) (select queue end))))), 50331#(and (or (= (select queue start) (+ (* B 4) x2)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 50367#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (* 7 B))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 50325#(and (or (not (= (+ x1 (* 5 B)) (select queue end))) (= (select queue start) (+ x2 B))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 50319#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 50323#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end)))) (or (not (= (+ (* B 4) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2)))), 50332#(and (or (= (select queue start) (+ (* B 4) x2)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 50341#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (select queue end) (+ (* 2 B) x1))))), 50343#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 6 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 50364#(and (or (not (= (select queue end) (* 7 B))) (< start (+ end 1))) (or (= (select queue start) x2) (not (= (select queue end) (* 7 B)))) (or (not (= (select queue end) (* 7 B))) (<= end start))), 50349#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) (+ x2 (* 7 B))) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 50378#(and (or (not (= (select queue end) (+ x1 (* 7 B)))) (= (select queue start) (* 7 B))) (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 50372#(and (or (not (= (select queue end) (* 7 B))) (< start (+ end 1))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (* 7 B)))) (or (not (= (select queue end) (* 7 B))) (<= end start))), 50377#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (* 7 B))))] [2022-03-15 22:16:37,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-03-15 22:16:37,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:37,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-03-15 22:16:37,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=14190, Unknown=0, NotChecked=0, Total=14520 [2022-03-15 22:16:37,644 INFO L87 Difference]: Start difference. First operand 366 states and 971 transitions. Second operand has 103 states, 102 states have (on average 2.843137254901961) internal successors, (290), 102 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:00,849 INFO L93 Difference]: Finished difference Result 750 states and 2180 transitions. [2022-03-15 22:17:00,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-03-15 22:17:00,850 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 102 states have (on average 2.843137254901961) internal successors, (290), 102 states have internal predecessors, (290), 0 states have call successors, (0), 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 22:17:00,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:00,852 INFO L225 Difference]: With dead ends: 750 [2022-03-15 22:17:00,852 INFO L226 Difference]: Without dead ends: 742 [2022-03-15 22:17:00,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 132 SyntacticMatches, 10 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11933 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=1596, Invalid=57696, Unknown=0, NotChecked=0, Total=59292 [2022-03-15 22:17:00,853 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 71 mSDsluCounter, 10979 mSDsCounter, 0 mSdLazyCounter, 28625 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 28974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 28625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:00,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 2 Invalid, 28974 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [349 Valid, 28625 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2022-03-15 22:17:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-03-15 22:17:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 424. [2022-03-15 22:17:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 2.75177304964539) internal successors, (1164), 423 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1164 transitions. [2022-03-15 22:17:00,860 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1164 transitions. Word has length 27 [2022-03-15 22:17:00,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:00,860 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 1164 transitions. [2022-03-15 22:17:00,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 102 states have (on average 2.843137254901961) internal successors, (290), 102 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:00,860 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1164 transitions. [2022-03-15 22:17:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 22:17:00,860 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:00,861 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:00,877 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 22:17:01,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:01,068 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:01,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:01,068 INFO L85 PathProgramCache]: Analyzing trace with hash -987961400, now seen corresponding path program 32 times [2022-03-15 22:17:01,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:01,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501365888] [2022-03-15 22:17:01,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:01,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:01,348 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 22:17:01,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:01,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501365888] [2022-03-15 22:17:01,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501365888] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:01,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420883660] [2022-03-15 22:17:01,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:17:01,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:01,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:01,349 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 22:17:01,350 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 22:17:01,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:17:01,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:01,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 22:17:01,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:01,713 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:17:01,713 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 57 treesize of output 29 [2022-03-15 22:17:01,724 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 22:17:01,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:01,780 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:17:01,780 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 24 treesize of output 12 [2022-03-15 22:17:01,980 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 22:17:01,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420883660] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:01,981 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:01,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 49 [2022-03-15 22:17:01,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [654721549] [2022-03-15 22:17:01,981 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:01,983 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:02,017 INFO L252 McrAutomatonBuilder]: Finished intersection with 200 states and 443 transitions. [2022-03-15 22:17:02,017 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:05,031 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [52441#(and (= x2 (+ x1 B)) (= end start)), 52448#(and (<= end (+ start 1)) (= (+ (* 6 B) x1) (select queue start)) (< start end)), 52449#(and (= (+ (* 6 B) x1) x2) (= end start)), 52459#(and (= x2 B) (= end start)), 52452#(and (<= end (+ start 1)) (= (select queue start) (* 7 B)) (< start end)), 52447#(and (= (+ x1 (* 5 B)) x2) (= end start)), 52453#(and (= end start) (= x2 (* 7 B))), 52454#(and (= (* 6 B) x2) (= end start)), 52458#(and (= (* 2 B) x2) (= end start)), 52440#(and (<= end (+ start 1)) (= (+ (* 3 B) x1) (select queue start)) (< start end)), 52438#(and (<= end (+ start 1)) (= (select queue start) (+ x1 B)) (< start end)), 52450#(and (<= end (+ start 1)) (= (select queue start) (+ x1 (* 7 B))) (< start end)), 52460#(and (= end start) (= x2 0)), 52457#(and (= end start) (= (* 3 B) x2)), 52442#(and (= x2 (+ (* 2 B) x1)) (= end start)), 52455#(and (= x2 (* 5 B)) (= end start)), 52446#(and (<= end (+ start 1)) (= (+ x1 (* 5 B)) (select queue start)) (< start end)), 52445#(and (= (+ (* B 4) x1) x2) (= end start)), 52443#(and (= (+ (* 3 B) x1) x2) (= end start)), 52444#(and (<= end (+ start 1)) (= (+ (* B 4) x1) (select queue start)) (< start end)), 52451#(and (= x2 (+ x1 (* 7 B))) (= end start)), 52439#(and (= (select queue start) (+ (* 2 B) x1)) (<= end (+ start 1)) (< start end)), 52456#(and (= (* B 4) x2) (= end start))] [2022-03-15 22:17:05,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 22:17:05,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:05,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 22:17:05,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=5048, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 22:17:05,032 INFO L87 Difference]: Start difference. First operand 424 states and 1164 transitions. Second operand has 45 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:14,573 INFO L93 Difference]: Finished difference Result 1012 states and 3096 transitions. [2022-03-15 22:17:14,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2022-03-15 22:17:14,573 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 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 22:17:14,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:14,576 INFO L225 Difference]: With dead ends: 1012 [2022-03-15 22:17:14,576 INFO L226 Difference]: Without dead ends: 1004 [2022-03-15 22:17:14,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 163 SyntacticMatches, 10 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11030 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1083, Invalid=39519, Unknown=0, NotChecked=0, Total=40602 [2022-03-15 22:17:14,577 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 52 mSDsluCounter, 6338 mSDsCounter, 0 mSdLazyCounter, 18970 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 19132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 18970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:14,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 2 Invalid, 19132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 18970 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-03-15 22:17:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2022-03-15 22:17:14,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 606. [2022-03-15 22:17:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 605 states have (on average 2.8578512396694213) internal successors, (1729), 605 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1729 transitions. [2022-03-15 22:17:14,588 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1729 transitions. Word has length 27 [2022-03-15 22:17:14,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:14,588 INFO L470 AbstractCegarLoop]: Abstraction has 606 states and 1729 transitions. [2022-03-15 22:17:14,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1729 transitions. [2022-03-15 22:17:14,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 22:17:14,589 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:14,589 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:14,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 22:17:14,794 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,SelfDestructingSolverStorable37 [2022-03-15 22:17:14,794 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:14,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1780050123, now seen corresponding path program 33 times [2022-03-15 22:17:14,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:14,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695258020] [2022-03-15 22:17:14,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:14,901 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 22:17:14,901 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:14,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695258020] [2022-03-15 22:17:14,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695258020] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:14,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79218755] [2022-03-15 22:17:14,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:17:14,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:14,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:14,902 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 22:17:14,903 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 22:17:14,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 22:17:14,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:14,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 22:17:14,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:15,070 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 22:17:15,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:15,119 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 22:17:15,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79218755] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:15,119 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:15,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 27 [2022-03-15 22:17:15,119 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1413937691] [2022-03-15 22:17:15,119 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:15,122 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:15,164 INFO L252 McrAutomatonBuilder]: Finished intersection with 231 states and 513 transitions. [2022-03-15 22:17:15,164 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:19,472 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 89 new interpolants: [55157#(or (<= A (+ 2 i2)) (< (+ i1 1) A) (<= A i1)), 55165#(or (<= A 6) (<= A i2) (< 7 A)), 55172#(or (<= A (+ 3 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 55202#(or (<= A (+ 7 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 55161#(or (<= A (+ i1 4)) (<= A (+ 2 i2)) (< (+ 5 i1) A)), 55139#(or (<= A i2) (< i1 A)), 55219#(or (<= A 6) (< 7 A) (<= A (+ 6 i2))), 55208#(or (<= A (+ 6 i1)) (<= A (+ 6 i2)) (< (+ 7 i1) A)), 55206#(or (<= A (+ 6 i1)) (<= A (+ i2 4)) (< (+ 7 i1) A)), 55183#(or (<= A (+ 5 i2)) (< i1 A)), 55181#(or (<= A (+ i2 4)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 55133#(or (< (+ i1 1) A) (<= A i1)), 55142#(or (<= A i2) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 55167#(or (<= A 6) (< 7 A) (<= A (+ 2 i2))), 55171#(or (<= A (+ 3 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 55192#(or (<= A (+ 6 i2)) (< (+ i1 1) A) (<= A i1)), 55215#(or (<= A (+ 5 i1)) (<= A 7) (< (+ 6 i1) A)), 55201#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ 7 i2))), 55216#(or (<= A (+ 6 i1)) (<= A 7) (< (+ 7 i1) A)), 55145#(or (<= A (+ 5 i1)) (<= A i2) (< (+ 6 i1) A)), 55153#(or (<= A (+ i1 4)) (<= A (+ i2 1)) (< (+ 5 i1) A)), 55173#(or (<= A (+ 3 i2)) (<= A (+ i1 4)) (< (+ 5 i1) A)), 55144#(or (<= A i2) (<= A (+ i1 4)) (< (+ 5 i1) A)), 55151#(or (<= A (+ i2 1)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 55182#(or (<= A (+ i2 4)) (<= A (+ i1 4)) (< (+ 5 i1) A)), 55174#(or (<= A (+ 5 i1)) (<= A (+ 3 i2)) (< (+ 6 i1) A)), 55198#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= A (+ 6 i2))), 55220#(or (<= A 6) (< 7 A) (<= A (+ 7 i2))), 55184#(or (<= A (+ 5 i2)) (< (+ i1 1) A) (<= A i1)), 55197#(or (<= A (+ 3 i1)) (<= A (+ 6 i2)) (< (+ i1 4) A)), 55152#(or (<= A (+ i2 1)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 55209#(or (<= A (+ 6 i1)) (<= A (+ 7 i2)) (< (+ 7 i1) A)), 55195#(or (<= A (+ 7 i2)) (< i1 A)), 55150#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ i2 1))), 55168#(or (<= A (+ 3 i2)) (< i1 A)), 55191#(or (<= A (+ 6 i2)) (< i1 A)), 55190#(or (<= A (+ 5 i1)) (<= A (+ 5 i2)) (< (+ 6 i1) A)), 55149#(or (<= A (+ i2 1)) (< (+ i1 1) A) (<= A i1)), 55132#(< i1 A), 55166#(or (<= A 6) (< 7 A) (<= A (+ i2 1))), 55204#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= A (+ 7 i2))), 55189#(or (<= A (+ 5 i1)) (<= A (+ i2 4)) (< (+ 6 i1) A)), 55218#(or (<= A 6) (< 7 A) (<= A (+ 5 i2))), 55158#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ 2 i2))), 55134#(or (<= A (+ i1 1)) (< (+ 2 i1) A)), 55147#(or (<= A (+ 6 i1)) (<= A i2) (< (+ 7 i1) A)), 55212#(or (<= A 7) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 55156#(or (<= A (+ 2 i2)) (< i1 A)), 55136#(or (<= A (+ 3 i1)) (< (+ i1 4) A)), 55164#(or (<= A 6) (< 7 A)), 55170#(or (<= A (+ 3 i2)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 55200#(or (<= A (+ 7 i2)) (< (+ i1 1) A) (<= A i1)), 55214#(or (<= A (+ i1 4)) (<= A 7) (< (+ 5 i1) A)), 55163#(or (<= A (+ 6 i1)) (<= A (+ 2 i2)) (< (+ 7 i1) A)), 55203#(or (<= A (+ 7 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 55138#(or (<= A (+ 5 i1)) (< (+ 6 i1) A)), 55185#(or (<= A (+ 5 i2)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 55199#(or (<= A (+ 5 i1)) (<= A (+ 6 i2)) (< (+ 6 i1) A)), 55207#(or (<= A (+ 6 i1)) (<= A (+ 5 i2)) (< (+ 7 i1) A)), 55137#(or (<= A (+ i1 4)) (< (+ 5 i1) A)), 55210#(or (<= A 7) (< (+ i1 1) A) (<= A i1)), 55143#(or (<= A i2) (<= A (+ 3 i1)) (< (+ i1 4) A)), 55169#(or (<= A (+ 3 i2)) (< (+ i1 1) A) (<= A i1)), 55159#(or (<= A (+ 2 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 55205#(or (<= A (+ 5 i1)) (<= A (+ 7 i2)) (< (+ 6 i1) A)), 55193#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ 6 i2))), 55178#(or (<= A (+ i2 4)) (< (+ i1 1) A) (<= A i1)), 55155#(or (<= A (+ 6 i1)) (<= A (+ i2 1)) (< (+ 7 i1) A)), 55148#(or (<= A (+ i2 1)) (< i1 A)), 55160#(or (<= A (+ 2 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 55135#(or (<= A (+ 2 i1)) (< (+ 3 i1) A)), 55179#(or (<= A (+ i2 4)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 55162#(or (<= A (+ 5 i1)) (<= A (+ 2 i2)) (< (+ 6 i1) A)), 55194#(or (<= A (+ 6 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 55188#(or (<= A (+ 5 i2)) (<= A (+ i1 4)) (< (+ 5 i1) A)), 55196#(or (<= A 7) (< i1 A)), 55140#(or (<= A i2) (< (+ i1 1) A) (<= A i1)), 55211#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A 7)), 55186#(or (<= A (+ 5 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 55141#(or (<= A i2) (<= A (+ i1 1)) (< (+ 2 i1) A)), 55187#(or (<= A (+ 5 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 55180#(or (<= A (+ i2 4)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 55176#(or (<= A 6) (<= A (+ 3 i2)) (< 7 A)), 55177#(or (<= A (+ i2 4)) (< i1 A)), 55154#(or (<= A (+ 5 i1)) (<= A (+ i2 1)) (< (+ 6 i1) A)), 55175#(or (<= A (+ 6 i1)) (<= A (+ 3 i2)) (< (+ 7 i1) A)), 55217#(or (<= A 6) (< 7 A) (<= A (+ i2 4))), 55146#(or (<= A (+ 6 i1)) (< (+ 7 i1) A)), 55213#(or (<= A 7) (<= A (+ 3 i1)) (< (+ i1 4) A))] [2022-03-15 22:17:19,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-03-15 22:17:19,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:19,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-03-15 22:17:19,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1445, Invalid=11895, Unknown=0, NotChecked=0, Total=13340 [2022-03-15 22:17:19,474 INFO L87 Difference]: Start difference. First operand 606 states and 1729 transitions. Second operand has 108 states, 108 states have (on average 2.925925925925926) internal successors, (316), 108 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:30,049 INFO L93 Difference]: Finished difference Result 1454 states and 4025 transitions. [2022-03-15 22:17:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2022-03-15 22:17:30,049 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 2.925925925925926) internal successors, (316), 108 states have internal predecessors, (316), 0 states have call successors, (0), 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 22:17:30,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:30,052 INFO L225 Difference]: With dead ends: 1454 [2022-03-15 22:17:30,052 INFO L226 Difference]: Without dead ends: 1404 [2022-03-15 22:17:30,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 347 SyntacticMatches, 1 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25682 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=16259, Invalid=75247, Unknown=0, NotChecked=0, Total=91506 [2022-03-15 22:17:30,056 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 456 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 5363 mSolverCounterSat, 386 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 5749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 5363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:30,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 39 Invalid, 5749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 5363 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 22:17:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-03-15 22:17:30,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 643. [2022-03-15 22:17:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 2.82398753894081) internal successors, (1813), 642 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1813 transitions. [2022-03-15 22:17:30,067 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1813 transitions. Word has length 28 [2022-03-15 22:17:30,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:30,067 INFO L470 AbstractCegarLoop]: Abstraction has 643 states and 1813 transitions. [2022-03-15 22:17:30,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 2.925925925925926) internal successors, (316), 108 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:30,068 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1813 transitions. [2022-03-15 22:17:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 22:17:30,068 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:30,068 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:30,084 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 22:17:30,281 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,SelfDestructingSolverStorable38 [2022-03-15 22:17:30,281 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:17:30,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:30,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1835491247, now seen corresponding path program 34 times [2022-03-15 22:17:30,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:30,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134597950] [2022-03-15 22:17:30,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:30,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:30,396 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:30,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:30,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134597950] [2022-03-15 22:17:30,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134597950] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:30,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070881740] [2022-03-15 22:17:30,396 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:17:30,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:30,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:30,397 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 22:17:30,398 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 22:17:30,427 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:17:30,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:30,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 22:17:30,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:30,549 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:30,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:17:30,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070881740] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:30,595 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:30,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 27 [2022-03-15 22:17:30,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1232582608] [2022-03-15 22:17:30,595 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:30,597 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:30,635 INFO L252 McrAutomatonBuilder]: Finished intersection with 229 states and 508 transitions. [2022-03-15 22:17:30,635 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:34,774 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 89 new interpolants: [58717#(or (<= (+ 2 i2) A) (< (+ i1 1) A) (<= A i1)), 58767#(or (<= A (+ 6 i1)) (<= (+ i2 4) A) (< (+ 7 i1) A)), 58753#(or (<= (+ i2 8) A) (< i1 A)), 58757#(or (<= (+ i2 8) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 58787#(or (<= A 7) (<= (+ 6 i2) A) (< 8 A)), 58774#(or (<= (+ 2 i2) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 58773#(or (<= (+ i2 1) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 58779#(or (<= (+ 3 i2) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 58784#(or (<= (+ 3 i2) A) (<= A 7) (< 8 A)), 58755#(or (<= (+ i2 8) A) (<= A (+ i1 1)) (< (+ 2 i1) A)), 58765#(or (<= A (+ 6 i1)) (<= (+ 2 i2) A) (< (+ 7 i1) A)), 58729#(or (<= (+ i2 4) A) (< i1 A)), 58796#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= 8 A)), 58715#(or (<= (+ i2 1) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 58782#(or (<= (+ 6 i2) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 58792#(or (<= (+ i2 8) A) (<= A 7) (< 8 A)), 58786#(or (<= A 7) (< 8 A) (<= (+ 5 i2) A)), 58728#(or (<= (+ 3 i2) A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 58762#(or (<= A (+ 5 i1)) (<= (+ i2 4) A) (< (+ 6 i1) A)), 58769#(or (<= A (+ 5 i1)) (<= (+ 6 i2) A) (< (+ 6 i1) A)), 58775#(or (<= (+ i2 1) A) (<= A 7) (< 8 A)), 58749#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 7 i2) A)), 58738#(or (<= A (+ 3 i1)) (< (+ i1 4) A) (<= (+ 5 i2) A)), 58778#(or (<= A (+ 6 i1)) (<= (+ 7 i2) A) (< (+ 7 i1) A)), 58793#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= 8 A)), 58763#(or (<= A (+ 5 i1)) (< (+ 6 i1) A) (<= (+ 5 i2) A)), 58732#(or (<= (+ i2 4) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 58791#(or (<= (+ i2 8) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 58727#(or (<= (+ 3 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 58772#(or (< (+ i1 1) A) (<= A i1) (<= 8 A)), 58781#(or (<= A (+ 7 i1)) (< (+ i1 8) A) (<= (+ 5 i2) A)), 58741#(or (<= (+ 6 i2) A) (< i1 A)), 58721#(or (<= (+ i2 1) A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 58789#(or (<= A (+ 5 i1)) (<= (+ i2 8) A) (< (+ 6 i1) A)), 58798#(or (<= A (+ 6 i1)) (< (+ 7 i1) A) (<= 8 A)), 58745#(or (<= (+ 6 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 58759#(or (<= A (+ 5 i1)) (<= (+ i2 1) A) (< (+ 6 i1) A)), 58766#(or (<= A (+ 6 i1)) (<= (+ 3 i2) A) (< (+ 7 i1) A)), 58722#(or (<= A (+ i1 4)) (<= (+ 2 i2) A) (< (+ 5 i1) A)), 58734#(or (< i1 A) (<= (+ 5 i2) A)), 58713#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ i2 1) A)), 58716#(or (<= (+ 2 i2) A) (< i1 A)), 58783#(or (<= (+ 7 i2) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 58794#(or (<= A (+ 2 i1)) (< (+ 3 i1) A) (<= 8 A)), 58788#(or (<= (+ 7 i2) A) (<= A 7) (< 8 A)), 58712#(or (<= (+ i2 1) A) (< (+ i1 1) A) (<= A i1)), 58723#(or (<= (+ 3 i2) A) (< i1 A)), 58714#(or (<= (+ i2 1) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 58799#(or (<= A (+ 7 i1)) (< (+ i1 8) A) (<= 8 A)), 58743#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 6 i2) A)), 58750#(or (<= (+ 7 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 58752#(or (<= A (+ i1 4)) (<= (+ 7 i2) A) (< (+ 5 i1) A)), 58733#(or (<= (+ i2 4) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 58756#(or (<= (+ i2 8) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 58768#(or (<= A (+ 6 i1)) (<= (+ 5 i2) A) (< (+ 7 i1) A)), 58731#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ i2 4) A)), 58777#(or (<= A (+ 5 i1)) (<= (+ 7 i2) A) (< (+ 6 i1) A)), 58739#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= (+ i2 4) A)), 58746#(or (<= A (+ i1 4)) (<= (+ 6 i2) A) (< (+ 5 i1) A)), 58776#(or (<= A 7) (< 8 A) (<= (+ 2 i2) A)), 58737#(or (<= A (+ 2 i1)) (< (+ 3 i1) A) (<= (+ 5 i2) A)), 58761#(or (<= A (+ 5 i1)) (<= (+ 3 i2) A) (< (+ 6 i1) A)), 58748#(or (<= (+ 7 i2) A) (< (+ i1 1) A) (<= A i1)), 58718#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 2 i2) A)), 58790#(or (<= A (+ 6 i1)) (<= (+ i2 8) A) (< (+ 7 i1) A)), 58740#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= (+ 5 i2) A)), 58780#(or (<= A (+ 7 i1)) (<= (+ i2 4) A) (< (+ i1 8) A)), 58720#(or (<= (+ 2 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 58725#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 3 i2) A)), 58771#(or (< i1 A) (<= 8 A)), 58742#(or (<= (+ 6 i2) A) (< (+ i1 1) A) (<= A i1)), 58797#(or (<= A (+ 5 i1)) (< (+ 6 i1) A) (<= 8 A)), 58724#(or (<= (+ 3 i2) A) (< (+ i1 1) A) (<= A i1)), 58754#(or (<= (+ i2 8) A) (< (+ i1 1) A) (<= A i1)), 58770#(or (<= A (+ 6 i1)) (<= (+ 6 i2) A) (< (+ 7 i1) A)), 58747#(or (<= (+ 7 i2) A) (< i1 A)), 58730#(or (<= (+ i2 4) A) (< (+ i1 1) A) (<= A i1)), 58758#(or (<= (+ i2 8) A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 58744#(or (<= (+ 6 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 58735#(or (< (+ i1 1) A) (<= (+ 5 i2) A) (<= A i1)), 58719#(or (<= (+ 2 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 58764#(or (<= A (+ 6 i1)) (<= (+ i2 1) A) (< (+ 7 i1) A)), 58751#(or (<= (+ 7 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 58736#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 5 i2) A)), 58795#(or (<= A (+ 3 i1)) (< (+ i1 4) A) (<= 8 A)), 58785#(or (<= A 7) (< 8 A) (<= (+ i2 4) A)), 58711#(or (<= (+ i2 1) A) (< i1 A)), 58726#(or (<= (+ 3 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 58760#(or (<= A (+ 5 i1)) (<= (+ 2 i2) A) (< (+ 6 i1) A))] [2022-03-15 22:17:34,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-03-15 22:17:34,775 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:34,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-03-15 22:17:34,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1474, Invalid=11866, Unknown=0, NotChecked=0, Total=13340 [2022-03-15 22:17:34,776 INFO L87 Difference]: Start difference. First operand 643 states and 1813 transitions. Second operand has 108 states, 108 states have (on average 2.925925925925926) internal successors, (316), 108 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:01,953 INFO L93 Difference]: Finished difference Result 4141 states and 11818 transitions. [2022-03-15 22:18:01,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 521 states. [2022-03-15 22:18:01,953 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 2.925925925925926) internal successors, (316), 108 states have internal predecessors, (316), 0 states have call successors, (0), 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 22:18:01,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:01,961 INFO L225 Difference]: With dead ends: 4141 [2022-03-15 22:18:01,961 INFO L226 Difference]: Without dead ends: 4141 [2022-03-15 22:18:01,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1279 GetRequests, 660 SyntacticMatches, 2 SemanticMatches, 617 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168569 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=55389, Invalid=327153, Unknown=0, NotChecked=0, Total=382542 [2022-03-15 22:18:01,975 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1573 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 5492 mSolverCounterSat, 1384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 6876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1384 IncrementalHoareTripleChecker+Valid, 5492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:01,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1573 Valid, 36 Invalid, 6876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1384 Valid, 5492 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 22:18:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2022-03-15 22:18:01,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 792. [2022-03-15 22:18:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 2.88621997471555) internal successors, (2283), 791 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2283 transitions. [2022-03-15 22:18:01,999 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 2283 transitions. Word has length 28 [2022-03-15 22:18:01,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:01,999 INFO L470 AbstractCegarLoop]: Abstraction has 792 states and 2283 transitions. [2022-03-15 22:18:01,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 2.925925925925926) internal successors, (316), 108 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:01,999 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 2283 transitions. [2022-03-15 22:18:02,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 22:18:02,000 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:02,000 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:02,029 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 22:18:02,215 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,SelfDestructingSolverStorable39 [2022-03-15 22:18:02,215 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:02,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:02,216 INFO L85 PathProgramCache]: Analyzing trace with hash -212138051, now seen corresponding path program 35 times [2022-03-15 22:18:02,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:02,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212469216] [2022-03-15 22:18:02,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:02,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:02,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:02,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212469216] [2022-03-15 22:18:02,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212469216] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:02,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771330123] [2022-03-15 22:18:02,329 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:18:02,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:02,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:02,340 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 22:18:02,342 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 22:18:02,373 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 22:18:02,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:02,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 22:18:02,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:02,530 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 22:18:02,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:02,572 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:02,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771330123] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:02,572 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:02,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2022-03-15 22:18:02,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1907682021] [2022-03-15 22:18:02,573 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:02,575 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:02,616 INFO L252 McrAutomatonBuilder]: Finished intersection with 221 states and 493 transitions. [2022-03-15 22:18:02,617 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:05,938 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 88 new interpolants: [66264#(or (<= A (+ 3 i1)) (<= i2 i1)), 66280#(or (<= A (+ i1 1)) (<= (+ 3 i2) i1)), 66308#(or (<= A 6) (<= i2 2)), 66277#(or (<= (+ i2 4) i1) (<= A i1)), 66301#(or (<= 6 i1) (<= A i1)), 66227#(<= A (+ 3 i1)), 66305#(or (<= A (+ i1 4)) (<= 2 i1)), 66297#(or (<= A (+ 5 i1)) (<= (+ i2 1) i1)), 66228#(<= A (+ i1 4)), 66285#(or (<= A (+ 3 i1)) (<= (+ 2 i2) i1)), 66274#(or (<= A 6) (<= i2 5)), 66309#(or (<= A 6) (<= i2 1)), 66303#(or (<= 4 i1) (<= A (+ 2 i1))), 66246#(or (<= A (+ i1 1)) (<= i2 i1)), 66230#(or (<= A (+ i1 1)) (<= i2 (+ 2 i1))), 66282#(or (<= A (+ 3 i1)) (<= (+ i2 1) i1)), 66283#(or (<= (+ i2 4) i1) (<= A (+ i1 1))), 66306#(or (<= A (+ 5 i1)) (<= 1 i1)), 66268#(or (<= A (+ 6 i1)) (<= i2 (+ i1 4))), 66256#(or (<= i2 (+ i1 1)) (<= A (+ 3 i1))), 66310#(or (<= i2 0) (<= A 6)), 66281#(or (<= A (+ 2 i1)) (<= (+ 2 i2) i1)), 66248#(or (<= A (+ 3 i1)) (<= i2 (+ 2 i1))), 66236#(or (<= A (+ 5 i1)) (<= i2 (+ 6 i1))), 66271#(or (<= (+ 3 i2) A) (<= A (+ i2 1))), 66273#(or (<= A (+ 3 i2)) (<= (+ 5 i2) A)), 66252#(or (<= A (+ 5 i1)) (<= i2 (+ i1 4))), 66244#(or (<= A (+ 3 i1)) (<= i2 (+ 3 i1))), 66233#(<= A (+ 5 i1)), 66226#(<= A (+ 2 i1)), 66251#(or (<= A (+ 5 i1)) (<= i2 (+ 5 i1))), 66288#(or (<= A (+ i1 1)) (<= (+ 5 i2) i1)), 66295#(or (<= A (+ 5 i1)) (<= i2 (+ i1 1))), 66245#(or (<= A i1) (<= (+ i2 1) i1)), 66255#(or (<= A (+ 2 i1)) (<= i2 i1)), 66229#(or (<= i2 (+ i1 1)) (<= A i1)), 66254#(or (<= A (+ i1 1)) (<= (+ i2 1) i1)), 66293#(or (<= A (+ 5 i2)) (<= (+ 7 i2) A)), 66291#(or (<= A (+ i1 4)) (<= (+ 2 i2) i1)), 66311#(or (<= A 6) (<= 8 A)), 66265#(or (<= i2 (+ i1 1)) (<= A (+ i1 4))), 66276#(or (<= A 6) (<= i2 3)), 66299#(or (<= A (+ 6 i1)) (<= i2 (+ i1 1))), 66253#(or (<= (+ 2 i2) i1) (<= A i1)), 66250#(or (<= A (+ i1 4)) (<= i2 (+ 3 i1))), 66270#(or (<= A i2) (<= (+ 2 i2) A)), 66247#(or (<= i2 (+ i1 1)) (<= A (+ 2 i1))), 66263#(or (<= A (+ 2 i1)) (<= (+ i2 1) i1)), 66275#(or (<= A 6) (<= i2 4)), 66259#(or (<= A (+ 6 i1)) (<= i2 (+ 6 i1))), 66224#(<= A i1), 66240#(or (<= A 6) (<= i2 7)), 66261#(or (<= A i1) (<= (+ 3 i2) i1)), 66287#(or (<= A (+ i1 4)) (<= (+ i2 1) i1)), 66258#(or (<= A (+ 5 i1)) (<= i2 (+ 3 i1))), 66243#(or (<= A (+ 2 i1)) (<= i2 (+ 2 i1))), 66237#(<= A (+ 7 i1)), 66238#(or (<= A (+ 6 i1)) (<= i2 (+ 7 i1))), 66296#(or (<= A (+ 5 i1)) (<= i2 i1)), 66298#(or (<= A (+ 6 i1)) (<= i2 (+ 2 i1))), 66272#(or (<= A (+ 2 i2)) (<= (+ i2 4) A)), 66242#(or (<= i2 (+ i1 1)) (<= A (+ i1 1))), 66267#(or (<= A (+ 6 i1)) (<= i2 (+ 5 i1))), 66289#(or (<= (+ i2 4) i1) (<= A (+ 2 i1))), 66284#(or (<= A (+ 2 i1)) (<= (+ 3 i2) i1)), 66292#(or (<= A (+ i2 4)) (<= (+ 6 i2) A)), 66232#(or (<= i2 (+ i1 4)) (<= A (+ 3 i1))), 66294#(or (<= (+ i2 8) A) (<= A (+ 6 i2))), 66300#(or (<= A (+ 6 i1)) (<= i2 i1)), 66234#(or (<= A (+ i1 4)) (<= i2 (+ 5 i1))), 66279#(or (<= (+ 6 i2) i1) (<= A i1)), 66262#(or (<= A (+ i1 1)) (<= (+ 2 i2) i1)), 66307#(or (<= A (+ 6 i1)) (<= 0 i1)), 66241#(or (<= A i1) (<= i2 i1)), 66302#(or (<= A (+ i1 1)) (<= 5 i1)), 66290#(or (<= A (+ 3 i1)) (<= (+ 3 i2) i1)), 66304#(or (<= 3 i1) (<= A (+ 3 i1))), 66231#(or (<= A (+ 2 i1)) (<= i2 (+ 3 i1))), 66249#(or (<= A (+ i1 4)) (<= i2 (+ i1 4))), 66278#(or (<= (+ 5 i2) i1) (<= A i1)), 66239#(<= A 7), 66286#(or (<= A (+ i1 4)) (<= i2 i1)), 66225#(<= A (+ i1 1)), 66269#(or (<= A (+ 6 i1)) (<= i2 (+ 3 i1))), 66260#(or (<= A 6) (<= i2 6)), 66266#(or (<= A (+ 5 i1)) (<= i2 (+ 2 i1))), 66235#(<= A (+ 6 i1)), 66257#(or (<= A (+ i1 4)) (<= i2 (+ 2 i1)))] [2022-03-15 22:18:05,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2022-03-15 22:18:05,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:05,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2022-03-15 22:18:05,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2930, Invalid=10410, Unknown=0, NotChecked=0, Total=13340 [2022-03-15 22:18:05,940 INFO L87 Difference]: Start difference. First operand 792 states and 2283 transitions. Second operand has 107 states, 107 states have (on average 2.8598130841121496) internal successors, (306), 107 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:23,278 INFO L93 Difference]: Finished difference Result 1717 states and 4645 transitions. [2022-03-15 22:18:23,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 426 states. [2022-03-15 22:18:23,278 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 107 states have (on average 2.8598130841121496) internal successors, (306), 107 states have internal predecessors, (306), 0 states have call successors, (0), 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 22:18:23,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:23,282 INFO L225 Difference]: With dead ends: 1717 [2022-03-15 22:18:23,282 INFO L226 Difference]: Without dead ends: 1677 [2022-03-15 22:18:23,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1081 GetRequests, 558 SyntacticMatches, 1 SemanticMatches, 522 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109819 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=58499, Invalid=215553, Unknown=0, NotChecked=0, Total=274052 [2022-03-15 22:18:23,292 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 627 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 5254 mSolverCounterSat, 605 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 5859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 605 IncrementalHoareTripleChecker+Valid, 5254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:23,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [627 Valid, 29 Invalid, 5859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [605 Valid, 5254 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 22:18:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2022-03-15 22:18:23,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 446. [2022-03-15 22:18:23,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 2.656179775280899) internal successors, (1182), 445 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:23,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1182 transitions. [2022-03-15 22:18:23,303 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1182 transitions. Word has length 28 [2022-03-15 22:18:23,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:23,303 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 1182 transitions. [2022-03-15 22:18:23,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 2.8598130841121496) internal successors, (306), 107 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:23,303 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1182 transitions. [2022-03-15 22:18:23,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 22:18:23,304 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:23,304 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:23,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-03-15 22:18:23,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:23,538 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:23,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:23,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1134455472, now seen corresponding path program 36 times [2022-03-15 22:18:23,539 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:23,539 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100036791] [2022-03-15 22:18:23,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:23,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:23,890 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 22:18:23,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:23,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100036791] [2022-03-15 22:18:23,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100036791] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:23,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417081388] [2022-03-15 22:18:23,890 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:18:23,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:23,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:23,891 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 22:18:23,892 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 22:18:23,929 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 22:18:23,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:23,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 22:18:23,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:24,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:24,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:24,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:24,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2022-03-15 22:18:24,322 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 22:18:24,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:24,620 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:18:24,620 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 52 [2022-03-15 22:18:24,705 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 22:18:24,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417081388] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:24,705 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:24,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2022-03-15 22:18:24,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [50144952] [2022-03-15 22:18:24,705 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:24,708 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:24,756 INFO L252 McrAutomatonBuilder]: Finished intersection with 252 states and 563 transitions. [2022-03-15 22:18:24,756 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:39,398 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 100 new interpolants: [70390#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 6 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 70405#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) (+ x2 (* B 8))) (not (= (+ (* B 4) x1) (select queue end))))), 70363#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 70434#(and (or (not (= (select queue end) (* B 8))) (< start (+ end 1))) (or (not (= (select queue end) (* B 8))) (<= end start)) (or (not (= (select queue end) (* B 8))) (= (select queue start) (+ (* B 4) x2)))), 70419#(and (or (not (= (select queue end) (* B 8))) (< start (+ end 1))) (or (not (= (select queue end) (* B 8))) (= (select queue start) x2)) (or (not (= (select queue end) (* B 8))) (<= end start))), 70404#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) (+ x2 (* 7 B))) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 70411#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ x2 B)))), 70362#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) x2) (not (= (select queue end) (+ x1 B))))), 70440#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 70389#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ x2 (* 5 B)))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 70416#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ (* 2 B) x2)))), 70403#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 70433#(and (or (not (= (select queue end) (* B 8))) (< start (+ end 1))) (or (not (= (select queue end) (* B 8))) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (select queue end) (* B 8))) (<= end start))), 70368#(and (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 70453#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (= (select queue start) (+ x2 (* B 8))) (not (= (select queue end) (+ x1 (* B 8))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 70408#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) x2)) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 70455#(and (or (not (= (select queue end) (* B 8))) (< start (+ end 1))) (or (not (= (select queue end) (* B 8))) (= (select queue start) (+ x2 (* B 8)))) (or (not (= (select queue end) (* B 8))) (<= end start))), 70384#(and (or (= (select queue start) x2) (not (= (+ (* 3 B) x1) (select queue end)))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 70409#(and (or (= (select queue start) x2) (not (= (select queue end) (+ x1 (* 7 B))))) (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 70398#(and (or (= (select queue start) (+ x2 B)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 70400#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end)))) (or (not (= (+ (* B 4) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2)))), 70414#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (not (= (select queue end) (+ x1 (* B 8)))) (= (select queue start) (+ x2 B))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 70391#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ x2 (* 7 B)))) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 70397#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) x2) (not (= (+ (* B 4) x1) (select queue end))))), 70435#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ x2 (* 5 B)))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 70444#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ x2 (* 7 B))) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 70383#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (= (select queue start) (+ x2 (* B 8))) (not (= (select queue end) (+ (* 2 B) x1))))), 70365#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 70396#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (* B 8))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 70401#(and (or (= (select queue start) (+ (* B 4) x2)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 70442#(and (or (not (= (select queue end) (* B 8))) (< start (+ end 1))) (or (not (= (select queue end) (* B 8))) (<= end start)) (or (not (= (select queue end) (* B 8))) (= (select queue start) (+ (* 6 B) x2)))), 70407#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) x2) (not (= (+ x1 (* 5 B)) (select queue end))))), 70375#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 6 B) x2)))), 70430#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ (* B 4) x2))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 70379#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ x2 (* 7 B))))), 70428#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (not (= (select queue end) (+ x1 (* 7 B)))) (= (select queue start) (+ (* 3 B) x2))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 70394#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (* B 8))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 70392#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ x2 (* B 8))))), 70420#(and (or (not (= (select queue end) (* B 8))) (< start (+ end 1))) (or (not (= (select queue end) (* B 8))) (<= end start)) (or (not (= (select queue end) (* B 8))) (= (select queue start) (+ x2 B)))), 70422#(and (or (not (= (+ x1 (* 5 B)) (select queue end))) (= (select queue start) (+ (* 3 B) x2))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 70399#(and (or (= (select queue start) (+ (* 2 B) x2)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 70423#(and (or (= (select queue start) (+ (* B 4) x2)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 70357#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (= (select queue start) x2) (not (= (select queue end) x1)))), 70418#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ x1 (* B 8))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 70424#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (+ x1 (* 5 B)) (select queue end))))), 70425#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (+ x1 (* 5 B)) (select queue end))))), 70431#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ (* B 4) x2)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 70360#(and (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 70447#(and (or (= (select queue start) (+ x2 (* B 8))) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 70451#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (* B 8))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 70402#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 70456#(and (or (not (= (select queue end) (* B 8))) (< start (+ end 1))) (or (not (= (select queue end) (* B 8))) (<= end start))), 70358#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ x2 B)))), 70376#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (select queue end) (+ x1 B))))), 70413#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (= (select queue start) x2) (not (= (select queue end) (+ x1 (* B 8))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 70381#(and (or (not (= (select queue end) x1)) (= (select queue start) (+ x2 (* B 8)))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 70441#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (select queue end) (+ x1 (* B 8))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 70445#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (not (= (select queue end) (+ x1 (* B 8)))) (= (select queue start) (+ x2 (* 7 B)))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 70450#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) (* B 8)) (not (= (+ x1 (* 5 B)) (select queue end))))), 70448#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ x2 (* B 8))))), 70386#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 2 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 70377#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (select queue end) (+ (* 2 B) x1))))), 70382#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) (+ x2 (* B 8))) (not (= (select queue end) (+ x1 B))))), 70421#(and (or (not (= (select queue end) (* B 8))) (= (select queue start) (+ (* 2 B) x2))) (or (not (= (select queue end) (* B 8))) (< start (+ end 1))) (or (not (= (select queue end) (* B 8))) (<= end start))), 70427#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2)))), 70385#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ x2 B))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 70454#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (not (= (select queue end) (+ x1 (* B 8)))) (= (select queue start) (* B 8))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 70446#(and (or (not (= (select queue end) (* B 8))) (= (select queue start) (+ x2 (* 7 B)))) (or (not (= (select queue end) (* B 8))) (< start (+ end 1))) (or (not (= (select queue end) (* B 8))) (<= end start))), 70378#(and (or (not (= (select queue end) x1)) (= (select queue start) (+ x2 (* 7 B)))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 70415#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (+ x1 (* 5 B)) (select queue end))))), 70438#(and (or (not (= (select queue end) (* B 8))) (< start (+ end 1))) (or (not (= (select queue end) (* B 8))) (<= end start)) (or (not (= (select queue end) (* B 8))) (= (select queue start) (+ x2 (* 5 B))))), 70359#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 2 B) x2)))), 70437#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8))))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (+ x1 (* B 8)))))), 70410#(and (or (not (= (+ x1 (* 5 B)) (select queue end))) (= (select queue start) (+ x2 B))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 70429#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (not (= (select queue end) (+ x1 (* B 8)))) (= (select queue start) (+ (* 3 B) x2))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 70393#(and (or (not (= (select queue end) x1)) (= (select queue start) (* B 8))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 70443#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ x2 (* 7 B))))), 70395#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (* B 8)))), 70370#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 70373#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ (* B 4) x2)))), 70432#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (= (select queue start) (+ (* B 4) x2)) (not (= (select queue end) (+ x1 (* B 8))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 70369#(and (or (= (select queue start) x2) (not (= (select queue end) (+ (* 2 B) x1)))) (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 70380#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ x2 (* 7 B))))), 70366#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) (+ (* B 4) x2)) (not (= (select queue end) (+ x1 B))))), 70371#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 70412#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (not (= (select queue end) (+ x1 (* 7 B)))) (= (select queue start) (+ x2 B)))), 70367#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) x1))) (or (not (= (select queue end) x1)) (<= end start))), 70426#(and (or (= (select queue start) (+ x2 (* 7 B))) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 70406#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) (* B 8)) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 70361#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* B 4) x2)))), 70417#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 70387#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 70452#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (not (= (select queue end) (+ x1 (* 7 B)))) (= (select queue start) (* B 8)))), 70372#(and (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ (* 3 B) x2))) (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 70388#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* B 4) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 70436#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (+ x1 (* 7 B)))))), 70439#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ (* 6 B) x2))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 70364#(and (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 70374#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (+ (* 2 B) x1))))), 70449#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ x2 (* B 8))) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B))))))] [2022-03-15 22:18:39,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 124 states [2022-03-15 22:18:39,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:39,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2022-03-15 22:18:39,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=20205, Unknown=0, NotChecked=0, Total=20592 [2022-03-15 22:18:39,400 INFO L87 Difference]: Start difference. First operand 446 states and 1182 transitions. Second operand has 124 states, 123 states have (on average 2.8536585365853657) internal successors, (351), 123 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:14,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:14,301 INFO L93 Difference]: Finished difference Result 921 states and 2678 transitions. [2022-03-15 22:19:14,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2022-03-15 22:19:14,301 INFO L78 Accepts]: Start accepts. Automaton has has 124 states, 123 states have (on average 2.8536585365853657) internal successors, (351), 123 states have internal predecessors, (351), 0 states have call successors, (0), 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 22:19:14,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:14,303 INFO L225 Difference]: With dead ends: 921 [2022-03-15 22:19:14,303 INFO L226 Difference]: Without dead ends: 913 [2022-03-15 22:19:14,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 155 SyntacticMatches, 11 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18448 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=2026, Invalid=87674, Unknown=0, NotChecked=0, Total=89700 [2022-03-15 22:19:14,306 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 75 mSDsluCounter, 16394 mSDsCounter, 0 mSdLazyCounter, 43301 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 43709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 43301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:14,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 2 Invalid, 43709 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [408 Valid, 43301 Invalid, 0 Unknown, 0 Unchecked, 16.7s Time] [2022-03-15 22:19:14,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2022-03-15 22:19:14,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 510. [2022-03-15 22:19:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 2.742632612966601) internal successors, (1396), 509 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:14,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1396 transitions. [2022-03-15 22:19:14,313 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1396 transitions. Word has length 29 [2022-03-15 22:19:14,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:14,313 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 1396 transitions. [2022-03-15 22:19:14,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 124 states, 123 states have (on average 2.8536585365853657) internal successors, (351), 123 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1396 transitions. [2022-03-15 22:19:14,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 22:19:14,314 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:14,314 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:14,330 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 22:19:14,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:14,530 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:14,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:14,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1083674292, now seen corresponding path program 37 times [2022-03-15 22:19:14,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:14,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012212752] [2022-03-15 22:19:14,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:14,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:14,852 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 22:19:14,852 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:14,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012212752] [2022-03-15 22:19:14,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012212752] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:14,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754138054] [2022-03-15 22:19:14,852 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:19:14,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:14,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:14,853 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 22:19:14,854 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 22:19:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:14,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 22:19:14,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:15,298 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 22:19:15,299 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 59 treesize of output 33 [2022-03-15 22:19:15,308 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 22:19:15,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:15,357 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:19:15,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 48 [2022-03-15 22:19:15,497 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 22:19:15,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754138054] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:15,497 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:15,497 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 34 [2022-03-15 22:19:15,497 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1965478187] [2022-03-15 22:19:15,497 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:15,500 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:15,546 INFO L252 McrAutomatonBuilder]: Finished intersection with 241 states and 541 transitions. [2022-03-15 22:19:15,547 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:19,096 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [72928#(and (= x2 (+ (* 2 B) x1)) (= end start)), 72932#(and (<= end (+ start 1)) (= (+ (* 6 B) x1) (select queue start)) (< start end)), 72936#(and (<= end (+ start 1)) (= (select queue start) (+ x1 (* B 8))) (< start end)), 72923#(and (= (select queue start) (+ (* 2 B) x1)) (<= end (+ start 1)) (< start end)), 72931#(and (= (+ x1 (* 5 B)) x2) (= end start)), 72922#(and (<= end (+ start 1)) (= (select queue start) (+ x1 B)) (< start end)), 72929#(and (= (+ (* 3 B) x1) x2) (= end start)), 72925#(and (<= end (+ start 1)) (= (+ (* B 4) x1) (select queue start)) (< start end)), 72947#(and (= end start) (= x2 0)), 72938#(and (<= end (+ start 1)) (= (select queue start) (* B 8)) (< start end)), 72935#(and (= x2 (+ x1 (* 7 B))) (= end start)), 72941#(and (= (* 6 B) x2) (= end start)), 72934#(and (= (+ (* 6 B) x1) x2) (= end start)), 72942#(and (= x2 (* 5 B)) (= end start)), 72924#(and (<= end (+ start 1)) (= (+ (* 3 B) x1) (select queue start)) (< start end)), 72926#(and (<= end (+ start 1)) (= (+ x1 (* 5 B)) (select queue start)) (< start end)), 72946#(and (= x2 B) (= end start)), 72933#(and (<= end (+ start 1)) (= (select queue start) (+ x1 (* 7 B))) (< start end)), 72937#(and (= x2 (+ x1 (* B 8))) (= end start)), 72930#(and (= (+ (* B 4) x1) x2) (= end start)), 72940#(and (= end start) (= x2 (* 7 B))), 72939#(and (= x2 (* B 8)) (= end start)), 72927#(and (= x2 (+ x1 B)) (= end start)), 72943#(and (= (* B 4) x2) (= end start)), 72944#(and (= end start) (= (* 3 B) x2)), 72945#(and (= (* 2 B) x2) (= end start))] [2022-03-15 22:19:19,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 22:19:19,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:19,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 22:19:19,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3586, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 22:19:19,097 INFO L87 Difference]: Start difference. First operand 510 states and 1396 transitions. Second operand has 50 states, 49 states have (on average 3.142857142857143) internal successors, (154), 49 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:31,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:31,640 INFO L93 Difference]: Finished difference Result 1235 states and 3778 transitions. [2022-03-15 22:19:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2022-03-15 22:19:31,640 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 3.142857142857143) internal successors, (154), 49 states have internal predecessors, (154), 0 states have call successors, (0), 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 22:19:31,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:31,642 INFO L225 Difference]: With dead ends: 1235 [2022-03-15 22:19:31,642 INFO L226 Difference]: Without dead ends: 1227 [2022-03-15 22:19:31,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 218 SyntacticMatches, 19 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15342 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1039, Invalid=45833, Unknown=0, NotChecked=0, Total=46872 [2022-03-15 22:19:31,644 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 56 mSDsluCounter, 9101 mSDsCounter, 0 mSdLazyCounter, 29068 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 29268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 29068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:31,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 2 Invalid, 29268 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [200 Valid, 29068 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-03-15 22:19:31,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2022-03-15 22:19:31,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 734. [2022-03-15 22:19:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 2.840381991814461) internal successors, (2082), 733 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 2082 transitions. [2022-03-15 22:19:31,656 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 2082 transitions. Word has length 29 [2022-03-15 22:19:31,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:31,656 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 2082 transitions. [2022-03-15 22:19:31,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.142857142857143) internal successors, (154), 49 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:31,656 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 2082 transitions. [2022-03-15 22:19:31,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 22:19:31,657 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:31,657 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:31,674 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 22:19:31,857 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,SelfDestructingSolverStorable42 [2022-03-15 22:19:31,857 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:31,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:31,858 INFO L85 PathProgramCache]: Analyzing trace with hash 877182927, now seen corresponding path program 38 times [2022-03-15 22:19:31,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:31,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882143446] [2022-03-15 22:19:31,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:31,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:31,981 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 22:19:31,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:31,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882143446] [2022-03-15 22:19:31,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882143446] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:31,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890857258] [2022-03-15 22:19:31,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:19:31,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:31,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:31,982 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 22:19:31,983 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 22:19:32,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:19:32,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:32,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 22:19:32,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:32,172 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 22:19:32,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:32,219 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 22:19:32,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890857258] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:32,219 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:32,219 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 30 [2022-03-15 22:19:32,219 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [501968093] [2022-03-15 22:19:32,219 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:32,222 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:32,279 INFO L252 McrAutomatonBuilder]: Finished intersection with 275 states and 618 transitions. [2022-03-15 22:19:32,279 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:37,971 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 109 new interpolants: [76203#(or (<= A (+ 5 i1)) (< (+ 6 i1) A)), 76173#(< i1 A), 76262#(or (<= A (+ i2 8)) (<= A (+ 7 i1)) (< (+ i1 8) A)), 76260#(or (<= A (+ 6 i1)) (<= A (+ i2 8)) (< (+ 7 i1) A)), 76217#(or (<= A (+ 5 i2)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 76269#(or (<= A (+ 5 i2)) (<= A 7) (< 8 A)), 76225#(or (<= A (+ 6 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 76234#(or (<= A (+ 6 i1)) (<= A (+ i2 4)) (< (+ 7 i1) A)), 76267#(or (<= A (+ 3 i2)) (<= A 7) (< 8 A)), 76184#(or (<= A (+ i2 1)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 76187#(or (<= A (+ i2 1)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 76242#(or (<= A (+ i2 4)) (<= A (+ 7 i1)) (< (+ i1 8) A)), 76233#(or (<= A (+ 6 i1)) (<= A (+ 3 i2)) (< (+ 7 i1) A)), 76224#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ 6 i2))), 76226#(or (<= A (+ 3 i1)) (<= A (+ 6 i2)) (< (+ i1 4) A)), 76196#(or (<= A (+ i1 4)) (<= A (+ 2 i2)) (< (+ 5 i1) A)), 76207#(or (<= A (+ 5 i1)) (<= A (+ 3 i2)) (< (+ 6 i1) A)), 76249#(or (<= A (+ 7 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 76176#(or (< (+ i1 1) A) (<= A i1)), 76223#(or (<= A (+ 6 i2)) (< (+ i1 1) A) (<= A i1)), 76246#(or (<= A (+ 7 i2)) (< (+ i1 1) A) (<= A i1)), 76174#(or (<= A i2) (< i1 A)), 76259#(or (<= A (+ 6 i1)) (<= A (+ 7 i2)) (< (+ 7 i1) A)), 76181#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ i2 1))), 76205#(or (<= A (+ 5 i1)) (<= A (+ i2 1)) (< (+ 6 i1) A)), 76273#(or (<= A 8) (< i1 A)), 76279#(or (<= A (+ 5 i1)) (<= A 8) (< (+ 6 i1) A)), 76185#(or (<= A (+ 3 i1)) (< (+ i1 4) A)), 76215#(or (<= A (+ 5 i2)) (< i1 A)), 76228#(or (<= A (+ 5 i1)) (<= A (+ 6 i2)) (< (+ 6 i1) A)), 76220#(or (<= A (+ 5 i2)) (<= A (+ i1 4)) (< (+ 5 i1) A)), 76218#(or (<= A (+ 5 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 76237#(or (<= A (+ 7 i1)) (< (+ i1 8) A)), 76274#(or (<= A 8) (< (+ i1 1) A) (<= A i1)), 76212#(or (<= A (+ i2 4)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 76277#(or (<= A 8) (<= A (+ 3 i1)) (< (+ i1 4) A)), 76258#(or (<= A (+ 5 i1)) (<= A (+ i2 8)) (< (+ 6 i1) A)), 76257#(or (<= A (+ i1 4)) (<= A (+ i2 8)) (< (+ 5 i1) A)), 76251#(or (<= A (+ 5 i1)) (<= A (+ 7 i2)) (< (+ 6 i1) A)), 76243#(or (<= A (+ 5 i2)) (<= A (+ 7 i1)) (< (+ i1 8) A)), 76230#(or (<= A (+ 6 i1)) (<= A i2) (< (+ 7 i1) A)), 76268#(or (<= A (+ i2 4)) (<= A 7) (< 8 A)), 76278#(or (<= A (+ i1 4)) (<= A 8) (< (+ 5 i1) A)), 76210#(or (<= A (+ i2 4)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 76201#(or (<= A (+ 3 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 76206#(or (<= A (+ 5 i1)) (<= A (+ 2 i2)) (< (+ 6 i1) A)), 76261#(or (<= A (+ 7 i1)) (<= A (+ 7 i2)) (< (+ i1 8) A)), 76175#(or (<= A (+ i2 1)) (< i1 A)), 76222#(or (<= A (+ 6 i2)) (< i1 A)), 76255#(or (<= A (+ i2 8)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 76182#(or (<= A (+ 2 i1)) (< (+ 3 i1) A)), 76194#(or (<= A i2) (<= A (+ i1 4)) (< (+ 5 i1) A)), 76241#(or (<= A (+ 3 i2)) (<= A (+ 7 i1)) (< (+ i1 8) A)), 76236#(or (<= A (+ 6 i1)) (<= A (+ 6 i2)) (< (+ 7 i1) A)), 76263#(or (<= A 7) (< 8 A)), 76253#(or (<= A (+ i2 8)) (< (+ i1 1) A) (<= A i1)), 76275#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A 8)), 76252#(or (<= A (+ i2 8)) (< i1 A)), 76240#(or (<= A (+ 7 i1)) (<= A (+ 2 i2)) (< (+ i1 8) A)), 76192#(or (<= A (+ 2 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 76219#(or (<= A (+ 5 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 76264#(or (<= A i2) (<= A 7) (< 8 A)), 76281#(or (<= A 8) (<= A (+ 7 i1)) (< (+ i1 8) A)), 76231#(or (<= A (+ 6 i1)) (<= A (+ i2 1)) (< (+ 7 i1) A)), 76265#(or (<= A (+ i2 1)) (<= A 7) (< 8 A)), 76256#(or (<= A (+ i2 8)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 76177#(or (<= A i2) (< (+ i1 1) A) (<= A i1)), 76270#(or (<= A 7) (< 8 A) (<= A (+ 6 i2))), 76198#(or (<= A (+ 3 i2)) (< (+ i1 1) A) (<= A i1)), 76193#(or (<= A (+ i1 4)) (< (+ 5 i1) A)), 76179#(or (<= A (+ i1 1)) (< (+ 2 i1) A)), 76276#(or (<= A 8) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 76227#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= A (+ 6 i2))), 76191#(or (<= A (+ 2 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 76180#(or (<= A i2) (<= A (+ i1 1)) (< (+ 2 i1) A)), 76183#(or (<= A i2) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 76247#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ 7 i2))), 76235#(or (<= A (+ 6 i1)) (<= A (+ 5 i2)) (< (+ 7 i1) A)), 76188#(or (<= A (+ 2 i2)) (< i1 A)), 76214#(or (<= A (+ 5 i1)) (<= A (+ i2 4)) (< (+ 6 i1) A)), 76202#(or (<= A (+ 3 i2)) (<= A (+ i1 4)) (< (+ 5 i1) A)), 76272#(or (<= A 7) (< 8 A) (<= A (+ i2 8))), 76216#(or (<= A (+ 5 i2)) (< (+ i1 1) A) (<= A i1)), 76208#(or (<= A (+ i2 4)) (< i1 A)), 76245#(or (<= A (+ 7 i2)) (< i1 A)), 76213#(or (<= A (+ i2 4)) (<= A (+ i1 4)) (< (+ 5 i1) A)), 76190#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ 2 i2))), 76199#(or (<= A (+ 3 i2)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 76244#(or (<= A (+ 7 i1)) (<= A (+ 6 i2)) (< (+ i1 8) A)), 76239#(or (<= A (+ i2 1)) (<= A (+ 7 i1)) (< (+ i1 8) A)), 76211#(or (<= A (+ i2 4)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 76250#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= A (+ 7 i2))), 76186#(or (<= A i2) (<= A (+ 3 i1)) (< (+ i1 4) A)), 76200#(or (<= A (+ 3 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 76232#(or (<= A (+ 6 i1)) (<= A (+ 2 i2)) (< (+ 7 i1) A)), 76209#(or (<= A (+ i2 4)) (< (+ i1 1) A) (<= A i1)), 76229#(or (<= A (+ 6 i1)) (< (+ 7 i1) A)), 76254#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ i2 8))), 76178#(or (<= A (+ i2 1)) (< (+ i1 1) A) (<= A i1)), 76189#(or (<= A (+ 2 i2)) (< (+ i1 1) A) (<= A i1)), 76221#(or (<= A (+ 5 i1)) (<= A (+ 5 i2)) (< (+ 6 i1) A)), 76238#(or (<= A i2) (<= A (+ 7 i1)) (< (+ i1 8) A)), 76197#(or (<= A (+ 3 i2)) (< i1 A)), 76248#(or (<= A (+ 7 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 76195#(or (<= A (+ i1 4)) (<= A (+ i2 1)) (< (+ 5 i1) A)), 76280#(or (<= A (+ 6 i1)) (<= A 8) (< (+ 7 i1) A)), 76266#(or (<= A 7) (< 8 A) (<= A (+ 2 i2))), 76204#(or (<= A (+ 5 i1)) (<= A i2) (< (+ 6 i1) A)), 76271#(or (<= A 7) (< 8 A) (<= A (+ 7 i2)))] [2022-03-15 22:19:37,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-03-15 22:19:37,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:37,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-03-15 22:19:37,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1931, Invalid=17251, Unknown=0, NotChecked=0, Total=19182 [2022-03-15 22:19:37,973 INFO L87 Difference]: Start difference. First operand 734 states and 2082 transitions. Second operand has 130 states, 130 states have (on average 2.923076923076923) internal successors, (380), 130 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:53,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:53,356 INFO L93 Difference]: Finished difference Result 1800 states and 4980 transitions. [2022-03-15 22:19:53,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 250 states. [2022-03-15 22:19:53,357 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 130 states have (on average 2.923076923076923) internal successors, (380), 130 states have internal predecessors, (380), 0 states have call successors, (0), 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 22:19:53,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:53,359 INFO L225 Difference]: With dead ends: 1800 [2022-03-15 22:19:53,359 INFO L226 Difference]: Without dead ends: 1743 [2022-03-15 22:19:53,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 413 SyntacticMatches, 1 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38338 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=23157, Invalid=111165, Unknown=0, NotChecked=0, Total=134322 [2022-03-15 22:19:53,364 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 440 mSDsluCounter, 3081 mSDsCounter, 0 mSdLazyCounter, 8032 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 8468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 8032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:53,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [440 Valid, 44 Invalid, 8468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 8032 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-03-15 22:19:53,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2022-03-15 22:19:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 779. [2022-03-15 22:19:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 778 states have (on average 2.8071979434447303) internal successors, (2184), 778 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 2184 transitions. [2022-03-15 22:19:53,377 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 2184 transitions. Word has length 30 [2022-03-15 22:19:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:53,377 INFO L470 AbstractCegarLoop]: Abstraction has 779 states and 2184 transitions. [2022-03-15 22:19:53,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 2.923076923076923) internal successors, (380), 130 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 2184 transitions. [2022-03-15 22:19:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 22:19:53,378 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:53,378 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:53,394 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 22:19:53,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-03-15 22:19:53,579 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:53,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:53,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1289815701, now seen corresponding path program 39 times [2022-03-15 22:19:53,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:53,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436888262] [2022-03-15 22:19:53,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:53,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:53,698 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:53,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436888262] [2022-03-15 22:19:53,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436888262] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:53,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098338617] [2022-03-15 22:19:53,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:19:53,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:53,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:53,699 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 22:19:53,700 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 22:19:53,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 22:19:53,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:53,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 22:19:53,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:53,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:53,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098338617] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:53,917 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:53,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 30 [2022-03-15 22:19:53,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [989303318] [2022-03-15 22:19:53,917 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:53,920 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:53,979 INFO L252 McrAutomatonBuilder]: Finished intersection with 273 states and 613 transitions. [2022-03-15 22:19:53,979 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:59,349 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 109 new interpolants: [80599#(or (<= A (+ 5 i1)) (<= (+ i2 4) A) (< (+ 6 i1) A)), 80610#(or (< (+ 9 i1) A) (<= A (+ i1 8)) (<= (+ 6 i2) A)), 80534#(or (<= A (+ 5 i1)) (<= (+ i2 1) A) (< (+ 6 i1) A)), 80550#(or (< i1 A) (<= (+ 5 i2) A)), 80559#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 6 i2) A)), 80612#(or (<= A (+ 5 i1)) (<= (+ i2 8) A) (< (+ 6 i1) A)), 80626#(or (<= (+ 7 i2) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 80609#(or (< (+ 9 i1) A) (<= A (+ i1 8)) (<= (+ 5 i2) A)), 80632#(or (< (+ 9 i1) A) (<= A (+ i1 8)) (<= (+ 9 i2) A)), 80561#(or (<= (+ 7 i2) A) (< (+ i1 1) A) (<= A i1)), 80607#(or (<= (+ 6 i2) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 80619#(or (<= A (+ 6 i1)) (<= (+ 7 i2) A) (< (+ 7 i1) A)), 80585#(or (<= (+ i2 8) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 80590#(or (<= A (+ i1 4)) (<= (+ 7 i2) A) (< (+ 5 i1) A)), 80614#(or (<= A (+ i1 4)) (<= (+ 9 i2) A) (< (+ 5 i1) A)), 80579#(or (<= (+ 6 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 80606#(or (<= A (+ 6 i1)) (<= (+ 6 i2) A) (< (+ 7 i1) A)), 80533#(or (<= (+ i2 1) A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 80537#(or (< (+ 9 i1) A) (<= (+ i2 1) A) (<= A (+ i1 8))), 80535#(or (<= A (+ 6 i1)) (<= (+ i2 1) A) (< (+ 7 i1) A)), 80565#(or (<= (+ i2 8) A) (<= A (+ i1 1)) (< (+ 2 i1) A)), 80611#(or (<= A (+ 5 i1)) (<= (+ 7 i2) A) (< (+ 6 i1) A)), 80620#(or (<= A (+ 6 i1)) (<= (+ i2 8) A) (< (+ 7 i1) A)), 80528#(or (<= (+ i2 1) A) (< i1 A)), 80568#(or (<= (+ 3 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 80580#(or (<= (+ 7 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 80596#(or (< (+ i1 1) A) (<= A i1) (<= 9 A)), 80629#(or (<= A (+ 7 i1)) (< (+ i1 8) A) (<= 9 A)), 80616#(or (<= A (+ 3 i1)) (< (+ i1 4) A) (<= 9 A)), 80602#(or (<= A (+ 5 i1)) (< (+ 6 i1) A) (<= (+ 5 i2) A)), 80600#(or (<= A (+ 6 i1)) (<= (+ i2 4) A) (< (+ 7 i1) A)), 80617#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= 9 A)), 80636#(or (< 9 A) (<= A 8) (<= (+ 9 i2) A)), 80562#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 7 i2) A)), 80631#(or (< (+ 9 i1) A) (<= (+ i2 8) A) (<= A (+ i1 8))), 80572#(or (<= A (+ 6 i1)) (<= (+ 3 i2) A) (< (+ 7 i1) A)), 80598#(or (<= A (+ 2 i1)) (< (+ 3 i1) A) (<= 9 A)), 80586#(or (<= (+ i2 8) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 80547#(or (< (+ 9 i1) A) (<= A (+ i1 8)) (<= (+ 2 i2) A)), 80583#(or (<= (+ 6 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 80615#(or (<= A (+ 5 i1)) (<= (+ 9 i2) A) (< (+ 6 i1) A)), 80553#(or (< (+ i1 1) A) (<= (+ 5 i2) A) (<= A i1)), 80566#(or (< 9 A) (<= (+ i2 1) A) (<= A 8)), 80545#(or (<= A (+ 6 i1)) (<= (+ 2 i2) A) (< (+ 7 i1) A)), 80539#(or (<= (+ 2 i2) A) (< (+ i1 1) A) (<= A i1)), 80543#(or (<= A (+ i1 4)) (<= (+ 2 i2) A) (< (+ 5 i1) A)), 80541#(or (<= (+ 2 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 80621#(or (<= A (+ 6 i1)) (<= (+ 9 i2) A) (< (+ 7 i1) A)), 80548#(or (<= (+ 3 i2) A) (< i1 A)), 80567#(or (< 9 A) (<= A 8) (<= (+ 2 i2) A)), 80532#(or (<= (+ i2 1) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 80557#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ i2 4) A)), 80584#(or (<= (+ 7 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 80564#(or (<= (+ i2 8) A) (< (+ i1 1) A) (<= A i1)), 80603#(or (<= A (+ 6 i1)) (<= (+ 5 i2) A) (< (+ 7 i1) A)), 80622#(or (<= A (+ 6 i1)) (< (+ 7 i1) A) (<= 9 A)), 80588#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= (+ 5 i2) A)), 80594#(or (<= (+ 9 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 80593#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 9 i2) A)), 80552#(or (<= (+ i2 4) A) (< (+ i1 1) A) (<= A i1)), 80544#(or (<= A (+ 5 i1)) (<= (+ 2 i2) A) (< (+ 6 i1) A)), 80555#(or (<= (+ 6 i2) A) (< (+ i1 1) A) (<= A i1)), 80577#(or (<= (+ i2 4) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 80575#(or (< 9 A) (<= (+ 3 i2) A) (<= A 8)), 80540#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 2 i2) A)), 80608#(or (< (+ 9 i1) A) (<= A (+ i1 8)) (<= (+ i2 4) A)), 80591#(or (<= (+ i2 8) A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 80581#(or (<= (+ i2 4) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 80604#(or (<= A (+ 7 i1)) (< (+ i1 8) A) (<= (+ 5 i2) A)), 80633#(or (< (+ 9 i1) A) (<= A (+ i1 8)) (<= 9 A)), 80538#(or (<= (+ 2 i2) A) (< i1 A)), 80574#(or (< (+ 9 i1) A) (<= (+ 3 i2) A) (<= A (+ i1 8))), 80613#(or (<= (+ 9 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 80570#(or (<= (+ 3 i2) A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 80623#(or (< 9 A) (<= A 8) (<= (+ i2 4) A)), 80569#(or (<= (+ 3 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 80582#(or (<= A (+ 3 i1)) (< (+ i1 4) A) (<= (+ 5 i2) A)), 80630#(or (< (+ 9 i1) A) (<= (+ 7 i2) A) (<= A (+ i1 8))), 80595#(or (< i1 A) (<= 9 A)), 80601#(or (<= A (+ 7 i1)) (<= (+ i2 4) A) (< (+ i1 8) A)), 80627#(or (<= (+ i2 8) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 80556#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 3 i2) A)), 80635#(or (<= (+ i2 8) A) (< 9 A) (<= A 8)), 80549#(or (<= (+ i2 4) A) (< i1 A)), 80529#(or (<= (+ i2 1) A) (< (+ i1 1) A) (<= A i1)), 80592#(or (<= (+ 9 i2) A) (< (+ i1 1) A) (<= A i1)), 80563#(or (<= (+ i2 8) A) (< i1 A)), 80618#(or (<= A (+ 5 i1)) (< (+ 6 i1) A) (<= 9 A)), 80605#(or (<= A (+ 5 i1)) (<= (+ 6 i2) A) (< (+ 6 i1) A)), 80571#(or (<= A (+ 5 i1)) (<= (+ 3 i2) A) (< (+ 6 i1) A)), 80576#(or (<= (+ 9 i2) A) (< i1 A)), 80531#(or (<= (+ i2 1) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 80628#(or (<= (+ 9 i2) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 80536#(or (<= (+ i2 1) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 80560#(or (<= (+ 7 i2) A) (< i1 A)), 80589#(or (<= A (+ i1 4)) (<= (+ 6 i2) A) (< (+ 5 i1) A)), 80551#(or (<= (+ 3 i2) A) (< (+ i1 1) A) (<= A i1)), 80546#(or (<= (+ 2 i2) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 80578#(or (<= A (+ 2 i1)) (< (+ 3 i1) A) (<= (+ 5 i2) A)), 80587#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= (+ i2 4) A)), 80530#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ i2 1) A)), 80542#(or (<= (+ 2 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 80558#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 5 i2) A)), 80634#(or (< 9 A) (<= (+ 7 i2) A) (<= A 8)), 80573#(or (<= (+ 3 i2) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 80625#(or (< 9 A) (<= A 8) (<= (+ 6 i2) A)), 80554#(or (<= (+ 6 i2) A) (< i1 A)), 80624#(or (< 9 A) (<= A 8) (<= (+ 5 i2) A)), 80597#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= 9 A))] [2022-03-15 22:19:59,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-03-15 22:19:59,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:59,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-03-15 22:19:59,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1968, Invalid=17214, Unknown=0, NotChecked=0, Total=19182 [2022-03-15 22:19:59,352 INFO L87 Difference]: Start difference. First operand 779 states and 2184 transitions. Second operand has 130 states, 130 states have (on average 2.923076923076923) internal successors, (380), 130 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:42,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:42,441 INFO L93 Difference]: Finished difference Result 5627 states and 16111 transitions. [2022-03-15 22:20:42,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 694 states. [2022-03-15 22:20:42,442 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 130 states have (on average 2.923076923076923) internal successors, (380), 130 states have internal predecessors, (380), 0 states have call successors, (0), 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 22:20:42,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:42,450 INFO L225 Difference]: With dead ends: 5627 [2022-03-15 22:20:42,450 INFO L226 Difference]: Without dead ends: 5627 [2022-03-15 22:20:42,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1669 GetRequests, 856 SyntacticMatches, 2 SemanticMatches, 811 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298669 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=92057, Invalid=568099, Unknown=0, NotChecked=0, Total=660156 [2022-03-15 22:20:42,480 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 2135 mSDsluCounter, 3111 mSDsCounter, 0 mSdLazyCounter, 7551 mSolverCounterSat, 1997 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2135 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 9548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1997 IncrementalHoareTripleChecker+Valid, 7551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:42,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2135 Valid, 47 Invalid, 9548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1997 Valid, 7551 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-03-15 22:20:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5627 states. [2022-03-15 22:20:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5627 to 956. [2022-03-15 22:20:42,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 955 states have (on average 2.864921465968586) internal successors, (2736), 955 states have internal predecessors, (2736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2736 transitions. [2022-03-15 22:20:42,555 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2736 transitions. Word has length 30 [2022-03-15 22:20:42,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:42,555 INFO L470 AbstractCegarLoop]: Abstraction has 956 states and 2736 transitions. [2022-03-15 22:20:42,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 2.923076923076923) internal successors, (380), 130 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:20:42,556 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2736 transitions. [2022-03-15 22:20:42,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 22:20:42,557 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:42,557 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:42,573 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 22:20:42,757 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,SelfDestructingSolverStorable44 [2022-03-15 22:20:42,757 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:20:42,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:42,758 INFO L85 PathProgramCache]: Analyzing trace with hash -415941039, now seen corresponding path program 40 times [2022-03-15 22:20:42,759 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:42,759 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123583506] [2022-03-15 22:20:42,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:42,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:42,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:42,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123583506] [2022-03-15 22:20:42,903 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123583506] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:42,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094743852] [2022-03-15 22:20:42,903 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:20:42,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:42,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:42,904 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 22:20:42,904 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 22:20:42,952 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:20:42,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:20:42,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 22:20:42,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:43,112 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 22:20:43,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:43,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094743852] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:43,158 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:43,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2022-03-15 22:20:43,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [987957861] [2022-03-15 22:20:43,158 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:43,160 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:43,219 INFO L252 McrAutomatonBuilder]: Finished intersection with 264 states and 596 transitions. [2022-03-15 22:20:43,219 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:47,548 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 108 new interpolants: [90490#(<= A 8), 90427#(or (<= A i1) (<= (+ 3 i2) i1)), 90465#(or (<= A (+ 6 i1)) (<= i2 (+ 5 i1))), 90418#(or (<= A (+ 2 i1)) (<= i2 i1)), 90444#(<= A (+ 5 i1)), 90416#(or (<= (+ 2 i2) i1) (<= A i1)), 90499#(or (<= A (+ 7 i1)) (<= i2 (+ 2 i1))), 90408#(<= A (+ 2 i1)), 90439#(or (<= A (+ 3 i1)) (<= (+ 2 i2) i1)), 90474#(or (<= (+ i2 4) i1) (<= A (+ 3 i1))), 90420#(or (<= (+ 3 i2) A) (<= A (+ i2 1))), 90500#(or (<= i2 (+ i1 1)) (<= A (+ 7 i1))), 90432#(or (<= (+ i2 4) i1) (<= A i1)), 90437#(or (<= A (+ 2 i1)) (<= (+ 3 i2) i1)), 90508#(or (<= A (+ 5 i1)) (<= 2 i1)), 90505#(or (<= i2 2) (<= A 7)), 90415#(or (<= i2 (+ i1 1)) (<= A (+ 2 i1))), 90484#(or (<= A (+ 5 i2)) (<= (+ 7 i2) A)), 90452#(or (<= A (+ i1 4)) (<= (+ 2 i2) i1)), 90435#(or (<= (+ i2 4) i1) (<= A (+ i1 1))), 90448#(or (<= A (+ i1 4)) (<= i2 (+ 2 i1))), 90410#(or (<= i2 (+ i1 1)) (<= A (+ i1 1))), 90409#(or (<= A (+ i1 1)) (<= i2 (+ 2 i1))), 90456#(or (<= A (+ 5 i1)) (<= i2 (+ i1 4))), 90417#(or (<= A (+ i1 1)) (<= (+ i2 1) i1)), 90425#(or (<= A (+ 3 i1)) (<= i2 (+ 2 i1))), 90467#(or (<= A (+ 6 i1)) (<= i2 (+ 3 i1))), 90451#(or (<= A (+ i1 4)) (<= (+ i2 1) i1)), 90494#(or (<= i2 5) (<= A 7)), 90475#(or (<= A (+ i1 4)) (<= (+ 3 i2) i1)), 90504#(or (<= A 7) (<= i2 3)), 90429#(or (<= A (+ 2 i1)) (<= (+ i2 1) i1)), 90509#(or (<= A (+ 6 i1)) (<= 1 i1)), 90423#(or (<= i2 (+ i1 4)) (<= A (+ 3 i1))), 90445#(or (<= A (+ i1 4)) (<= i2 (+ 5 i1))), 90471#(or (<= (+ 7 i2) i1) (<= A i1)), 90470#(or (<= A (+ 6 i1)) (<= i2 i1)), 90412#(<= A (+ 3 i1)), 90440#(or (<= (+ 6 i2) i1) (<= A i1)), 90449#(or (<= i2 (+ i1 1)) (<= A (+ i1 4))), 90403#(<= A i1), 90472#(or (<= A (+ i1 1)) (<= (+ 6 i2) i1)), 90501#(or (<= A (+ 7 i1)) (<= i2 i1)), 90489#(or (<= i2 (+ 5 i1)) (<= A (+ 7 i1))), 90428#(or (<= A (+ i1 1)) (<= (+ 2 i2) i1)), 90461#(or (<= A (+ 5 i1)) (<= (+ i2 1) i1)), 90443#(or (<= A (+ 3 i1)) (<= (+ 3 i2) i1)), 90421#(or (<= A (+ 2 i2)) (<= (+ i2 4) A)), 90507#(or (<= i2 0) (<= A 7)), 90462#(<= A (+ 7 i1)), 90459#(or (<= A (+ 5 i1)) (<= i2 (+ i1 1))), 90480#(or (<= 5 i1) (<= A (+ 2 i1))), 90431#(or (<= A (+ 3 i1)) (<= i2 i1)), 90419#(or (<= A i2) (<= (+ 2 i2) A)), 90495#(or (<= (+ i2 8) A) (<= A (+ 6 i2))), 90498#(or (<= A (+ 7 i1)) (<= i2 (+ 3 i1))), 90453#(<= A (+ 6 i1)), 90446#(or (<= A (+ i1 4)) (<= i2 (+ i1 4))), 90458#(or (<= A (+ 5 i1)) (<= i2 (+ 2 i1))), 90442#(or (<= (+ i2 4) i1) (<= A (+ 2 i1))), 90492#(or (<= A 7) (<= i2 7)), 90414#(or (<= A (+ 2 i1)) (<= i2 (+ 2 i1))), 90482#(or (<= A (+ i1 4)) (<= 3 i1)), 90476#(or (<= A (+ 5 i1)) (<= (+ 2 i2) i1)), 90506#(or (<= i2 1) (<= A 7)), 90469#(or (<= A (+ 6 i1)) (<= i2 (+ i1 1))), 90413#(or (<= A (+ 2 i1)) (<= i2 (+ 3 i1))), 90468#(or (<= A (+ 6 i1)) (<= i2 (+ 2 i1))), 90450#(or (<= A (+ i1 4)) (<= i2 i1)), 90479#(or (<= 6 i1) (<= A (+ i1 1))), 90497#(or (<= i2 (+ i1 4)) (<= A (+ 7 i1))), 90496#(or (<= (+ 9 i2) A) (<= A (+ 7 i2))), 90473#(or (<= (+ 5 i2) i1) (<= A (+ 2 i1))), 90493#(or (<= A 7) (<= i2 6)), 90464#(or (<= A (+ 6 i1)) (<= i2 (+ 6 i1))), 90438#(or (<= A (+ 3 i1)) (<= (+ i2 1) i1)), 90430#(or (<= A (+ 3 i2)) (<= (+ 5 i2) A)), 90481#(or (<= 4 i1) (<= A (+ 3 i1))), 90411#(or (<= A (+ i1 1)) (<= i2 i1)), 90424#(or (<= A (+ 3 i1)) (<= i2 (+ 3 i1))), 90407#(or (<= A i1) (<= (+ i2 1) i1)), 90460#(or (<= A (+ 5 i1)) (<= i2 i1)), 90491#(or (<= A 7) (<= i2 8)), 90478#(or (<= 7 i1) (<= A i1)), 90422#(<= A (+ i1 4)), 90485#(<= A (+ i1 8)), 90510#(or (<= 0 i1) (<= A (+ 7 i1))), 90463#(or (<= A (+ 6 i1)) (<= i2 (+ 7 i1))), 90457#(or (<= A (+ 5 i1)) (<= i2 (+ 3 i1))), 90477#(or (<= A (+ 6 i1)) (<= (+ i2 1) i1)), 90487#(or (<= A (+ 7 i1)) (<= i2 (+ 7 i1))), 90486#(or (<= i2 (+ i1 8)) (<= A (+ 7 i1))), 90434#(or (<= A (+ i1 1)) (<= (+ 3 i2) i1)), 90436#(or (<= A (+ 2 i1)) (<= (+ 2 i2) i1)), 90466#(or (<= A (+ 6 i1)) (<= i2 (+ i1 4))), 90483#(or (<= A (+ i2 4)) (<= (+ 6 i2) A)), 90433#(or (<= (+ 5 i2) i1) (<= A i1)), 90503#(or (<= i2 4) (<= A 7)), 90455#(or (<= A (+ 5 i1)) (<= i2 (+ 5 i1))), 90426#(or (<= i2 (+ i1 1)) (<= A (+ 3 i1))), 90502#(or (<= A 7) (<= 9 A)), 90405#(or (<= i2 (+ i1 1)) (<= A i1)), 90454#(or (<= A (+ 5 i1)) (<= i2 (+ 6 i1))), 90406#(or (<= A i1) (<= i2 i1)), 90441#(or (<= A (+ i1 1)) (<= (+ 5 i2) i1)), 90404#(<= A (+ i1 1)), 90488#(or (<= A (+ 7 i1)) (<= i2 (+ 6 i1))), 90447#(or (<= A (+ i1 4)) (<= i2 (+ 3 i1)))] [2022-03-15 22:20:47,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 129 states [2022-03-15 22:20:47,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:47,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2022-03-15 22:20:47,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=14827, Unknown=0, NotChecked=0, Total=19182 [2022-03-15 22:20:47,550 INFO L87 Difference]: Start difference. First operand 956 states and 2736 transitions. Second operand has 129 states, 129 states have (on average 2.86046511627907) internal successors, (369), 129 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:12,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:21:12,206 INFO L93 Difference]: Finished difference Result 2112 states and 5709 transitions. [2022-03-15 22:21:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 532 states. [2022-03-15 22:21:12,207 INFO L78 Accepts]: Start accepts. Automaton has has 129 states, 129 states have (on average 2.86046511627907) internal successors, (369), 129 states have internal predecessors, (369), 0 states have call successors, (0), 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 22:21:12,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:21:12,210 INFO L225 Difference]: With dead ends: 2112 [2022-03-15 22:21:12,210 INFO L226 Difference]: Without dead ends: 2068 [2022-03-15 22:21:12,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1336 GetRequests, 686 SyntacticMatches, 1 SemanticMatches, 649 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173831 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=89985, Invalid=333165, Unknown=0, NotChecked=0, Total=423150 [2022-03-15 22:21:12,226 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 744 mSDsluCounter, 2541 mSDsCounter, 0 mSdLazyCounter, 6228 mSolverCounterSat, 760 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 6988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 760 IncrementalHoareTripleChecker+Valid, 6228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:12,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [744 Valid, 30 Invalid, 6988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [760 Valid, 6228 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 22:21:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2022-03-15 22:21:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 534. [2022-03-15 22:21:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 2.651031894934334) internal successors, (1413), 533 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1413 transitions. [2022-03-15 22:21:12,238 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 1413 transitions. Word has length 30 [2022-03-15 22:21:12,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:21:12,238 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 1413 transitions. [2022-03-15 22:21:12,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 129 states, 129 states have (on average 2.86046511627907) internal successors, (369), 129 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:21:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1413 transitions. [2022-03-15 22:21:12,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 22:21:12,239 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:21:12,239 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:21:12,255 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 22:21:12,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 22:21:12,440 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:21:12,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:21:12,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1398382730, now seen corresponding path program 41 times [2022-03-15 22:21:12,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:21:12,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674320445] [2022-03-15 22:21:12,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:21:12,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:21:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:21:12,845 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 22:21:12,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:21:12,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674320445] [2022-03-15 22:21:12,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674320445] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:21:12,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899152099] [2022-03-15 22:21:12,846 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:21:12,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:21:12,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:21:12,847 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 22:21:12,850 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 22:21:12,879 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 22:21:12,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:21:12,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 22:21:12,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:21:13,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:13,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:21:13,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:21:13,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 32 [2022-03-15 22:21:13,381 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 22:21:13,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:21:13,729 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:21:13,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 54 [2022-03-15 22:21:13,821 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 22:21:13,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899152099] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:21:13,821 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:21:13,821 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2022-03-15 22:21:13,821 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1563208827] [2022-03-15 22:21:13,821 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:21:13,824 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:21:13,892 INFO L252 McrAutomatonBuilder]: Finished intersection with 298 states and 673 transitions. [2022-03-15 22:21:13,893 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:21:34,057 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 121 new interpolants: [95521#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ (* 6 B) x2))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 95537#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ x1 (* B 8))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 95466#(and (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ (* 3 B) x2))) (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 95523#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ x2 (* B 8))))), 95500#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 9 B) x2)))), 95479#(and (or (= (select queue start) (+ (* B 4) x2)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 95496#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) (+ x2 (* B 8))) (not (= (select queue end) (+ x1 B))))), 95485#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 6 B) x2)))), 95530#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (+ x1 (* 7 B)))))), 95541#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (select queue end) (+ x1 (* B 8))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 95533#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ x2 (* B 8))) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 95526#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (not (= (select queue end) (+ x1 (* 7 B)))) (= (select queue start) (+ x2 B)))), 95494#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) (+ x2 (* 7 B))) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 95475#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) x2) (not (= (+ (* B 4) x1) (select queue end))))), 95538#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (not (= (select queue end) (+ x1 (* B 8)))) (= (select queue start) (+ (* 3 B) x2))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 95469#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ (* B 4) x2)))), 95548#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (* 9 B) (select queue start))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 95498#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ x2 (* B 8))))), 95510#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (+ x1 (* 5 B)) (select queue end))))), 95470#(and (or (= (select queue start) x2) (not (= (+ (* 3 B) x1) (select queue end)))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 95477#(and (or (= (select queue start) (+ (* 2 B) x2)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 95486#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (select queue end) (+ x1 B))))), 95551#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (* 9 B) (select queue start))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 95489#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 95567#(and (or (not (= (select queue end) (* 9 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 9 B))) (= (select queue start) (+ (* 6 B) x2))) (or (not (= (select queue end) (* 9 B))) (<= end start))), 95520#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ x2 (* 5 B)))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 95461#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 2 B) x2)))), 95492#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ x2 (* 7 B))))), 95572#(and (or (not (= (+ (* 9 B) x1) (select queue end))) (<= end start)) (or (< start (+ end 1)) (not (= (+ (* 9 B) x1) (select queue end)))) (or (not (= (+ (* 9 B) x1) (select queue end))) (= (select queue start) (+ (* 9 B) x2)))), 95525#(and (or (= (select queue start) x2) (not (= (select queue end) (+ x1 (* 7 B))))) (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 95501#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ (* 9 B) x2))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 95502#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ (* 9 B) x2))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 95522#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ x2 (* 7 B))))), 95574#(and (or (not (= (+ (* 9 B) x1) (select queue end))) (<= end start)) (or (= (* 9 B) (select queue start)) (not (= (+ (* 9 B) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* 9 B) x1) (select queue end))))), 95558#(and (or (not (= (select queue end) (* 9 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 9 B))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (* 9 B))) (<= end start))), 95531#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 95559#(and (or (not (= (select queue end) (* 9 B))) (= (select queue start) (+ (* 2 B) x2))) (or (not (= (select queue end) (* 9 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 9 B))) (<= end start))), 95524#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ (* 9 B) x2)))), 95536#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (not (= (select queue end) (+ x1 (* B 8)))) (= (select queue start) (+ x2 B))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 95495#(and (or (not (= (select queue end) x1)) (= (select queue start) (+ x2 (* B 8)))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 95561#(and (or (not (= (+ (* 9 B) x1) (select queue end))) (= (select queue start) (+ (* B 4) x2))) (or (not (= (+ (* 9 B) x1) (select queue end))) (<= end start)) (or (< start (+ end 1)) (not (= (+ (* 9 B) x1) (select queue end))))), 95544#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (not (= (select queue end) (+ x1 (* B 8)))) (= (select queue start) (+ (* 9 B) x2))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 95575#(and (or (not (= (select queue end) (* 9 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 9 B))) (<= end start))), 95506#(and (or (not (= (+ x1 (* 5 B)) (select queue end))) (= (select queue start) (+ x2 B))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 95556#(and (or (not (= (+ (* 9 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 9 B) x1) (select queue end))) (= (select queue start) (+ x2 B))) (or (< start (+ end 1)) (not (= (+ (* 9 B) x1) (select queue end))))), 95457#(and (or (= (select queue start) x2) (not (= (select queue end) (+ (* 2 B) x1)))) (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 95534#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ (* 9 B) x2)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 95467#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ (* B 4) x2)))), 95508#(and (or (not (= (+ x1 (* 5 B)) (select queue end))) (= (select queue start) (+ (* 3 B) x2))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 95529#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ (* B 4) x2)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 95518#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2)))), 95549#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (* 9 B) (select queue start)) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 95458#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (not (= (select queue end) x1)) (= (select queue start) (+ x2 B)))), 95460#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 95472#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 2 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 95507#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (+ x1 (* 5 B)) (select queue end))))), 95535#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (= (select queue start) x2) (not (= (select queue end) (+ x1 (* B 8))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 95514#(and (or (= (select queue start) (+ (* 9 B) x2)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 95569#(and (or (not (= (select queue end) (* 9 B))) (= (select queue start) (+ x2 (* 7 B)))) (or (not (= (select queue end) (* 9 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 9 B))) (<= end start))), 95568#(and (or (not (= (+ (* 9 B) x1) (select queue end))) (= (select queue start) (+ x2 (* 7 B)))) (or (not (= (+ (* 9 B) x1) (select queue end))) (<= end start)) (or (< start (+ end 1)) (not (= (+ (* 9 B) x1) (select queue end))))), 95465#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 95542#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (not (= (select queue end) (+ x1 (* B 8)))) (= (select queue start) (+ x2 (* 7 B)))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 95474#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* B 4) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 95499#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) (+ x2 (* B 8))) (not (= (+ (* B 4) x1) (select queue end))))), 95516#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ x2 B)))), 95546#(and (or (= (* 9 B) (select queue start)) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 95553#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (= (* 9 B) (select queue start)) (not (= (select queue end) (+ x1 (* B 8))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 95509#(and (or (= (select queue start) (+ (* B 4) x2)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 95555#(and (or (not (= (select queue end) (* 9 B))) (< start (+ end 1))) (or (= (select queue start) x2) (not (= (select queue end) (* 9 B)))) (or (not (= (select queue end) (* 9 B))) (<= end start))), 95539#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (= (select queue start) (+ (* B 4) x2)) (not (= (select queue end) (+ x1 (* B 8))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 95511#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (+ x1 (* 5 B)) (select queue end))))), 95512#(and (or (= (select queue start) (+ x2 (* 7 B))) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 95540#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8))))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (+ x1 (* B 8)))))), 95570#(and (or (not (= (+ (* 9 B) x1) (select queue end))) (<= end start)) (or (= (select queue start) (+ x2 (* B 8))) (not (= (+ (* 9 B) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* 9 B) x1) (select queue end))))), 95473#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 95487#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (select queue end) (+ (* 2 B) x1))))), 95513#(and (or (= (select queue start) (+ x2 (* B 8))) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end))))), 95563#(and (or (not (= (+ (* 9 B) x1) (select queue end))) (<= end start)) (or (= (select queue start) (+ (* 6 B) x2)) (not (= (+ (* 9 B) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* 9 B) x1) (select queue end))))), 95527#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 95562#(and (or (not (= (+ (* 9 B) x1) (select queue end))) (<= end start)) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (+ (* 9 B) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* 9 B) x1) (select queue end))))), 95471#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ x2 B))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 95491#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ x2 (* 7 B))))), 95517#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ (* 2 B) x2)))), 95456#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) x2) (not (= (select queue end) (+ x1 B))))), 95481#(and (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 95503#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 9 B) x2)))), 95504#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) (+ (* 9 B) x2)) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 95560#(and (or (not (= (+ (* 9 B) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (+ (* 9 B) x1) (select queue end))) (<= end start)) (or (< start (+ end 1)) (not (= (+ (* 9 B) x1) (select queue end))))), 95459#(and (or (not (= (select queue end) (+ x1 B))) (= (select queue start) (+ x2 B))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 95519#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) (+ (* B 4) x2))) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 95557#(and (or (not (= (+ (* 9 B) x1) (select queue end))) (<= end start)) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (+ (* 9 B) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* 9 B) x1) (select queue end))))), 95483#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ x2 (* 5 B)))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 95493#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ x2 (* 7 B)))) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 95464#(and (or (not (= (select queue end) x1)) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 95455#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start)) (or (= (select queue start) x2) (not (= (select queue end) x1)))), 95554#(and (or (= (select queue start) x2) (not (= (+ (* 9 B) x1) (select queue end)))) (or (not (= (+ (* 9 B) x1) (select queue end))) (<= end start)) (or (< start (+ end 1)) (not (= (+ (* 9 B) x1) (select queue end))))), 95545#(and (or (not (= (select queue end) x1)) (= (* 9 B) (select queue start))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 95573#(and (or (not (= (select queue end) (* 9 B))) (= (select queue start) (+ (* 9 B) x2))) (or (not (= (select queue end) (* 9 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 9 B))) (<= end start))), 95476#(and (or (= (select queue start) (+ x2 B)) (not (= (+ (* B 4) x1) (select queue end)))) (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 95550#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (* 9 B) (select queue start)) (not (= (+ x1 (* 5 B)) (select queue end))))), 95571#(and (or (not (= (select queue end) (* 9 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 9 B))) (= (select queue start) (+ x2 (* B 8)))) (or (not (= (select queue end) (* 9 B))) (<= end start))), 95462#(and (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ x1 B)))) (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B))))), 95532#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (select queue start) (+ x2 (* 7 B))) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 95484#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end))))), 95543#(and (or (<= end start) (not (= (select queue end) (+ x1 (* B 8))))) (or (= (select queue start) (+ x2 (* B 8))) (not (= (select queue end) (+ x1 (* B 8))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* B 8)))))), 95488#(and (or (not (= (+ (* 3 B) x1) (select queue end))) (= (select queue start) (+ (* 6 B) x2))) (or (not (= (+ (* 3 B) x1) (select queue end))) (<= end start)) (or (not (= (+ (* 3 B) x1) (select queue end))) (< start (+ end 1)))), 95515#(and (or (not (= (+ (* 6 B) x1) (select queue end))) (< start (+ end 1))) (or (not (= (+ (* 6 B) x1) (select queue end))) (= (select queue start) x2)) (or (not (= (+ (* 6 B) x1) (select queue end))) (<= end start))), 95490#(and (or (not (= (select queue end) x1)) (= (select queue start) (+ x2 (* 7 B)))) (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (not (= (select queue end) x1)) (<= end start))), 95528#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (not (= (select queue end) (+ x1 (* 7 B)))) (= (select queue start) (+ (* 3 B) x2))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B)))))), 95468#(and (or (not (= (select queue end) (+ x1 B))) (<= end start)) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 B)))) (or (= (select queue start) (+ (* B 4) x2)) (not (= (select queue end) (+ x1 B))))), 95552#(and (or (<= end start) (not (= (select queue end) (+ x1 (* 7 B))))) (or (< start (+ end 1)) (not (= (select queue end) (+ x1 (* 7 B))))) (or (= (* 9 B) (select queue start)) (not (= (select queue end) (+ x1 (* 7 B)))))), 95564#(and (or (not (= (select queue end) (* 9 B))) (= (select queue start) (+ (* 3 B) x2))) (or (not (= (select queue end) (* 9 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 9 B))) (<= end start))), 95566#(and (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (* 9 B)))) (or (not (= (select queue end) (* 9 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 9 B))) (<= end start))), 95463#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (= (select queue start) (+ (* 2 B) x2)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start))), 95565#(and (or (not (= (select queue end) (* 9 B))) (= (select queue start) (+ (* B 4) x2))) (or (not (= (select queue end) (* 9 B))) (< start (+ end 1))) (or (not (= (select queue end) (* 9 B))) (<= end start))), 95505#(and (or (<= end start) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (< start (+ end 1)) (not (= (+ x1 (* 5 B)) (select queue end)))) (or (= (select queue start) x2) (not (= (+ x1 (* 5 B)) (select queue end))))), 95547#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (= (* 9 B) (select queue start)) (not (= (select queue end) (+ (* 2 B) x1))))), 95480#(and (or (not (= (select queue end) x1)) (< start (+ end 1))) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) x1))) (or (not (= (select queue end) x1)) (<= end start))), 95478#(and (or (<= end start) (not (= (+ (* B 4) x1) (select queue end)))) (or (< start (+ end 1)) (not (= (+ (* B 4) x1) (select queue end)))) (or (not (= (+ (* B 4) x1) (select queue end))) (= (select queue start) (+ (* 3 B) x2)))), 95497#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (= (select queue start) (+ x2 (* B 8))) (not (= (select queue end) (+ (* 2 B) x1))))), 95482#(and (or (< start (+ end 1)) (not (= (select queue end) (+ (* 2 B) x1)))) (or (not (= (select queue end) (+ (* 2 B) x1))) (<= end start)) (or (= (select queue start) (+ x2 (* 5 B))) (not (= (select queue end) (+ (* 2 B) x1)))))] [2022-03-15 22:21:34,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 147 states [2022-03-15 22:21:34,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:21:34,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2022-03-15 22:21:34,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=27944, Unknown=0, NotChecked=0, Total=28392 [2022-03-15 22:21:34,060 INFO L87 Difference]: Start difference. First operand 534 states and 1413 transitions. Second operand has 147 states, 146 states have (on average 2.863013698630137) internal successors, (418), 146 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 22:22:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:25,559 INFO L93 Difference]: Finished difference Result 1110 states and 3227 transitions. [2022-03-15 22:22:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2022-03-15 22:22:25,560 INFO L78 Accepts]: Start accepts. Automaton has has 147 states, 146 states have (on average 2.863013698630137) internal successors, (418), 146 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) Word has length 31 [2022-03-15 22:22:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:25,561 INFO L225 Difference]: With dead ends: 1110 [2022-03-15 22:22:25,561 INFO L226 Difference]: Without dead ends: 1102 [2022-03-15 22:22:25,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 180 SyntacticMatches, 12 SemanticMatches, 360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26866 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=2515, Invalid=128167, Unknown=0, NotChecked=0, Total=130682 [2022-03-15 22:22:25,565 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 81 mSDsluCounter, 22798 mSDsCounter, 0 mSdLazyCounter, 61059 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 61557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 61059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:25,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 2 Invalid, 61557 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [498 Valid, 61059 Invalid, 0 Unknown, 0 Unchecked, 24.4s Time] [2022-03-15 22:22:25,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2022-03-15 22:22:25,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 604. [2022-03-15 22:22:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 603 states have (on average 2.7330016583747927) internal successors, (1648), 603 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1648 transitions. [2022-03-15 22:22:25,574 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1648 transitions. Word has length 31 [2022-03-15 22:22:25,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:25,574 INFO L470 AbstractCegarLoop]: Abstraction has 604 states and 1648 transitions. [2022-03-15 22:22:25,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 147 states, 146 states have (on average 2.863013698630137) internal successors, (418), 146 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 22:22:25,574 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1648 transitions. [2022-03-15 22:22:25,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 22:22:25,575 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:25,575 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:25,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-03-15 22:22:25,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:25,779 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:25,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:25,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1513434488, now seen corresponding path program 42 times [2022-03-15 22:22:25,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:25,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374721601] [2022-03-15 22:22:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:25,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:26,158 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 22:22:26,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:26,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374721601] [2022-03-15 22:22:26,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374721601] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:26,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511663135] [2022-03-15 22:22:26,159 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:22:26,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:26,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:26,161 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 22:22:26,161 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 22:22:26,193 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 22:22:26,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:26,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-15 22:22:26,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:26,658 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-15 22:22:26,659 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 69 treesize of output 33 [2022-03-15 22:22:26,671 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 22:22:26,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:26,727 INFO L353 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-03-15 22:22:26,727 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 24 treesize of output 30 [2022-03-15 22:22:27,462 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 22:22:27,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511663135] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:27,463 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:27,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 58 [2022-03-15 22:22:27,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [823960773] [2022-03-15 22:22:27,463 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:27,465 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:27,545 INFO L252 McrAutomatonBuilder]: Finished intersection with 286 states and 649 transitions. [2022-03-15 22:22:27,545 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:32,549 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [98544#(and (= x2 (+ x1 (* B 8))) (= end start)), 98537#(and (<= end (+ start 1)) (= (+ (* 6 B) x1) (select queue start)) (< start end)), 98553#(and (= (* B 4) x2) (= end start)), 98557#(and (= end start) (= x2 0)), 98534#(and (= (+ (* 3 B) x1) x2) (= end start)), 98547#(and (= (* 9 B) (select queue start)) (<= end (+ start 1)) (< start end)), 98539#(and (<= end (+ start 1)) (= (select queue start) (+ x1 (* B 8))) (< start end)), 98555#(and (= (* 2 B) x2) (= end start)), 98542#(and (= (+ (* 6 B) x1) x2) (= end start)), 98552#(and (= x2 (* 5 B)) (= end start)), 98549#(and (= x2 (* B 8)) (= end start)), 98551#(and (= (* 6 B) x2) (= end start)), 98554#(and (= end start) (= (* 3 B) x2)), 98531#(and (= (select queue start) (+ (* 2 B) x1)) (<= end (+ start 1)) (< start end)), 98535#(and (<= end (+ start 1)) (= (+ (* B 4) x1) (select queue start)) (< start end)), 98533#(and (<= end (+ start 1)) (= (+ (* 3 B) x1) (select queue start)) (< start end)), 98538#(and (<= end (+ start 1)) (= (select queue start) (+ x1 (* 7 B))) (< start end)), 98529#(and (<= end (+ start 1)) (= (select queue start) (+ x1 B)) (< start end)), 98532#(and (= x2 (+ (* 2 B) x1)) (= end start)), 98536#(and (<= end (+ start 1)) (= (+ x1 (* 5 B)) (select queue start)) (< start end)), 98556#(and (= x2 B) (= end start)), 98530#(and (= x2 (+ x1 B)) (= end start)), 98545#(and (= (+ (* 9 B) x1) (select queue start)) (<= end (+ start 1)) (< start end)), 98543#(and (= x2 (+ x1 (* 7 B))) (= end start)), 98546#(and (= (+ (* 9 B) x1) x2) (= end start)), 98548#(and (= (* 9 B) x2) (= end start)), 98550#(and (= end start) (= x2 (* 7 B))), 98540#(and (= (+ (* B 4) x1) x2) (= end start)), 98541#(and (= (+ x1 (* 5 B)) x2) (= end start))] [2022-03-15 22:22:32,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-15 22:22:32,550 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:32,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-15 22:22:32,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=7454, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 22:22:32,550 INFO L87 Difference]: Start difference. First operand 604 states and 1648 transitions. Second operand has 55 states, 54 states have (on average 3.1481481481481484) internal successors, (170), 54 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:50,874 INFO L93 Difference]: Finished difference Result 1480 states and 4525 transitions. [2022-03-15 22:22:50,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2022-03-15 22:22:50,874 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 3.1481481481481484) internal successors, (170), 54 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 22:22:50,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:50,876 INFO L225 Difference]: With dead ends: 1480 [2022-03-15 22:22:50,877 INFO L226 Difference]: Without dead ends: 1472 [2022-03-15 22:22:50,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 240 SyntacticMatches, 20 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24248 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1852, Invalid=76828, Unknown=0, NotChecked=0, Total=78680 [2022-03-15 22:22:50,881 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 60 mSDsluCounter, 11941 mSDsCounter, 0 mSdLazyCounter, 37112 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 37354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 37112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:50,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 2 Invalid, 37354 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [242 Valid, 37112 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2022-03-15 22:22:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2022-03-15 22:22:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 874. [2022-03-15 22:22:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 2.823596792668958) internal successors, (2465), 873 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 2465 transitions. [2022-03-15 22:22:50,896 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 2465 transitions. Word has length 31 [2022-03-15 22:22:50,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:50,896 INFO L470 AbstractCegarLoop]: Abstraction has 874 states and 2465 transitions. [2022-03-15 22:22:50,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.1481481481481484) internal successors, (170), 54 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:22:50,896 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 2465 transitions. [2022-03-15 22:22:50,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 22:22:50,897 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:50,897 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:50,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-03-15 22:22:51,108 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,SelfDestructingSolverStorable47 [2022-03-15 22:22:51,109 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:22:51,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:51,109 INFO L85 PathProgramCache]: Analyzing trace with hash 468993333, now seen corresponding path program 43 times [2022-03-15 22:22:51,110 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:51,110 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779332757] [2022-03-15 22:22:51,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:51,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:51,254 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 22:22:51,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:51,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779332757] [2022-03-15 22:22:51,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779332757] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:51,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029390573] [2022-03-15 22:22:51,254 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:22:51,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:51,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:51,255 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 22:22:51,256 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 22:22:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:51,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 22:22:51,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:51,484 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 22:22:51,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:51,538 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 22:22:51,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029390573] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:22:51,538 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:22:51,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 33 [2022-03-15 22:22:51,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [334718109] [2022-03-15 22:22:51,538 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:22:51,541 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:22:51,641 INFO L252 McrAutomatonBuilder]: Finished intersection with 323 states and 733 transitions. [2022-03-15 22:22:51,641 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:59,355 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 131 new interpolants: [102500#(or (< 9 A) (<= A 8) (<= A (+ 2 i2))), 102521#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A 9)), 102465#(or (<= A (+ i2 8)) (< (+ i1 1) A) (<= A i1)), 102440#(or (<= A (+ 5 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 102484#(or (<= A (+ 5 i2)) (<= A (+ 7 i1)) (< (+ i1 8) A)), 102432#(or (<= A (+ 6 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 102435#(or (<= A i2) (<= A (+ 3 i1)) (< (+ i1 4) A)), 102524#(or (<= A 9) (<= A (+ i1 4)) (< (+ 5 i1) A)), 102512#(or (<= A (+ 9 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 102461#(or (<= A (+ 5 i1)) (<= A (+ 5 i2)) (< (+ 6 i1) A)), 102418#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ i2 1))), 102513#(or (<= A (+ 9 i2)) (<= A (+ i1 4)) (< (+ 5 i1) A)), 102464#(or (<= A (+ i2 8)) (< i1 A)), 102419#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ 2 i2))), 102527#(or (<= A 9) (<= A (+ 7 i1)) (< (+ i1 8) A)), 102404#(or (<= A (+ i2 4)) (< i1 A)), 102458#(or (<= A (+ 5 i1)) (<= A (+ 2 i2)) (< (+ 6 i1) A)), 102455#(or (<= A (+ 6 i1)) (<= A i2) (< (+ 7 i1) A)), 102441#(or (<= A (+ 3 i1)) (<= A (+ 6 i2)) (< (+ i1 4) A)), 102448#(or (<= A (+ i2 4)) (<= A (+ i1 4)) (< (+ 5 i1) A)), 102519#(or (<= A 9) (< i1 A)), 102442#(or (<= A (+ 7 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 102494#(or (< (+ 9 i1) A) (<= A (+ 5 i2)) (<= A (+ i1 8))), 102451#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= A (+ 7 i2))), 102417#(or (<= A i2) (<= A (+ i1 1)) (< (+ 2 i1) A)), 102413#(or (<= A (+ 6 i2)) (< (+ i1 1) A) (<= A i1)), 102525#(or (<= A (+ 5 i1)) (<= A 9) (< (+ 6 i1) A)), 102509#(or (<= A (+ 9 i2)) (< (+ i1 1) A) (<= A i1)), 102439#(or (<= A (+ i2 4)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 102408#(or (<= A (+ i2 1)) (< (+ i1 1) A) (<= A i1)), 102476#(or (<= A (+ 6 i1)) (<= A (+ 7 i2)) (< (+ 7 i1) A)), 102479#(or (<= A i2) (<= A (+ 7 i1)) (< (+ i1 8) A)), 102409#(or (<= A (+ 2 i2)) (< (+ i1 1) A) (<= A i1)), 102424#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ 7 i2))), 102447#(or (<= A (+ 3 i2)) (<= A (+ i1 4)) (< (+ 5 i1) A)), 102496#(or (< (+ 9 i1) A) (<= A (+ i1 8)) (<= A (+ 7 i2))), 102511#(or (<= A (+ 9 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 102477#(or (<= A (+ 6 i1)) (<= A (+ i2 8)) (< (+ 7 i1) A)), 102407#(or (<= A i2) (< (+ i1 1) A) (<= A i1)), 102467#(or (<= A (+ i2 8)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 102474#(or (<= A (+ 6 i1)) (<= A (+ 5 i2)) (< (+ 7 i1) A)), 102469#(or (<= A (+ i1 4)) (<= A (+ i2 8)) (< (+ 5 i1) A)), 102526#(or (<= A (+ 6 i1)) (<= A 9) (< (+ 7 i1) A)), 102503#(or (< 9 A) (<= A (+ 5 i2)) (<= A 8)), 102470#(or (<= A (+ 5 i1)) (<= A (+ i2 8)) (< (+ 6 i1) A)), 102415#(or (<= A (+ 7 i2)) (< (+ i1 1) A) (<= A i1)), 102416#(or (<= A (+ i1 1)) (< (+ 2 i1) A)), 102405#(or (<= A (+ 5 i2)) (< i1 A)), 102428#(or (<= A (+ 2 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 102421#(or (<= A (+ i2 4)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 102427#(or (<= A (+ i2 1)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 102429#(or (<= A (+ 3 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 102452#(or (<= A (+ 5 i1)) (< (+ 6 i1) A)), 102430#(or (<= A (+ i2 4)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 102466#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ i2 8))), 102422#(or (<= A (+ 5 i2)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 102437#(or (<= A (+ 2 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 102482#(or (<= A (+ 3 i2)) (<= A (+ 7 i1)) (< (+ i1 8) A)), 102499#(or (< 9 A) (<= A (+ i2 1)) (<= A 8)), 102423#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= A (+ 6 i2))), 102487#(or (<= A (+ i2 8)) (<= A (+ 7 i1)) (< (+ i1 8) A)), 102486#(or (<= A (+ 7 i1)) (<= A (+ 7 i2)) (< (+ i1 8) A)), 102438#(or (<= A (+ 3 i2)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 102480#(or (<= A (+ i2 1)) (<= A (+ 7 i1)) (< (+ i1 8) A)), 102449#(or (<= A (+ 5 i2)) (<= A (+ i1 4)) (< (+ 5 i1) A)), 102522#(or (<= A 9) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 102520#(or (<= A 9) (< (+ i1 1) A) (<= A i1)), 102505#(or (< 9 A) (<= A 8) (<= A (+ 7 i2))), 102420#(or (<= A (+ 3 i2)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 102472#(or (<= A (+ 6 i1)) (<= A (+ 3 i2)) (< (+ 7 i1) A)), 102456#(or (<= A (+ 5 i1)) (<= A (+ i2 1)) (< (+ 6 i1) A)), 102498#(or (<= A i2) (< 9 A) (<= A 8)), 102481#(or (<= A (+ 7 i1)) (<= A (+ 2 i2)) (< (+ i1 8) A)), 102402#(or (<= A (+ 2 i2)) (< i1 A)), 102473#(or (<= A (+ 6 i1)) (<= A (+ i2 4)) (< (+ 7 i1) A)), 102502#(or (< 9 A) (<= A (+ i2 4)) (<= A 8)), 102468#(or (<= A (+ i2 8)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 102425#(or (<= A (+ 2 i1)) (< (+ 3 i1) A)), 102436#(or (<= A (+ i2 1)) (<= A (+ 3 i1)) (< (+ i1 4) A)), 102506#(or (< (+ 9 i1) A) (<= A (+ i1 8)) (<= A (+ i2 8))), 102412#(or (<= A (+ 5 i2)) (< (+ i1 1) A) (<= A i1)), 102516#(or (<= A (+ 9 i2)) (<= A (+ 7 i1)) (< (+ i1 8) A)), 102493#(or (< (+ 9 i1) A) (<= A (+ i2 4)) (<= A (+ i1 8))), 102411#(or (<= A (+ i2 4)) (< (+ i1 1) A) (<= A i1)), 102433#(or (<= A (+ 7 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 102491#(or (< (+ 9 i1) A) (<= A (+ i1 8)) (<= A (+ 2 i2))), 102517#(or (< (+ 9 i1) A) (<= A (+ 9 i2)) (<= A (+ i1 8))), 102401#(or (<= A (+ i2 1)) (< i1 A)), 102453#(or (<= A (+ 6 i1)) (< (+ 7 i1) A)), 102504#(or (< 9 A) (<= A 8) (<= A (+ 6 i2))), 102446#(or (<= A (+ i1 4)) (<= A (+ 2 i2)) (< (+ 5 i1) A)), 102510#(or (<= A (+ 9 i2)) (<= A (+ i1 1)) (< (+ 2 i1) A)), 102485#(or (<= A (+ 7 i1)) (<= A (+ 6 i2)) (< (+ i1 8) A)), 102475#(or (<= A (+ 6 i1)) (<= A (+ 6 i2)) (< (+ 7 i1) A)), 102406#(or (<= A (+ 6 i2)) (< i1 A)), 102489#(or (<= A i2) (< (+ 9 i1) A) (<= A (+ i1 8))), 102497#(or (< 9 A) (<= A 8)), 102445#(or (<= A (+ i1 4)) (<= A (+ i2 1)) (< (+ 5 i1) A)), 102514#(or (<= A (+ 5 i1)) (<= A (+ 9 i2)) (< (+ 6 i1) A)), 102443#(or (<= A (+ i1 4)) (< (+ 5 i1) A)), 102483#(or (<= A (+ i2 4)) (<= A (+ 7 i1)) (< (+ i1 8) A)), 102410#(or (<= A (+ 3 i2)) (< (+ i1 1) A) (<= A i1)), 102471#(or (<= A (+ 6 i1)) (<= A (+ 2 i2)) (< (+ 7 i1) A)), 102444#(or (<= A i2) (<= A (+ i1 4)) (< (+ 5 i1) A)), 102508#(or (<= A (+ 9 i2)) (< i1 A)), 102528#(or (< (+ 9 i1) A) (<= A 9) (<= A (+ i1 8))), 102518#(or (< 9 A) (<= A (+ 9 i2)) (<= A 8)), 102426#(or (<= A i2) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 102431#(or (<= A (+ 5 i2)) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 102460#(or (<= A (+ 5 i1)) (<= A (+ i2 4)) (< (+ 6 i1) A)), 102400#(or (<= A i2) (< i1 A)), 102523#(or (<= A 9) (<= A (+ 3 i1)) (< (+ i1 4) A)), 102454#(or (<= A (+ 5 i1)) (<= A i2) (< (+ 6 i1) A)), 102434#(or (<= A (+ 3 i1)) (< (+ i1 4) A)), 102398#(< i1 A), 102462#(or (<= A (+ 5 i1)) (<= A (+ 6 i2)) (< (+ 6 i1) A)), 102459#(or (<= A (+ 5 i1)) (<= A (+ 3 i2)) (< (+ 6 i1) A)), 102501#(or (<= A (+ 3 i2)) (< 9 A) (<= A 8)), 102403#(or (<= A (+ 3 i2)) (< i1 A)), 102414#(or (<= A (+ 7 i2)) (< i1 A)), 102507#(or (< 9 A) (<= A 8) (<= A (+ i2 8))), 102457#(or (<= A (+ 6 i1)) (<= A (+ i2 1)) (< (+ 7 i1) A)), 102399#(or (< (+ i1 1) A) (<= A i1)), 102450#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= A (+ 6 i2))), 102478#(or (<= A (+ 7 i1)) (< (+ i1 8) A)), 102490#(or (< (+ 9 i1) A) (<= A (+ i1 8)) (<= A (+ i2 1))), 102488#(or (< (+ 9 i1) A) (<= A (+ i1 8))), 102515#(or (<= A (+ 6 i1)) (<= A (+ 9 i2)) (< (+ 7 i1) A)), 102492#(or (<= A (+ 3 i2)) (< (+ 9 i1) A) (<= A (+ i1 8))), 102495#(or (< (+ 9 i1) A) (<= A (+ i1 8)) (<= A (+ 6 i2))), 102463#(or (<= A (+ 5 i1)) (<= A (+ 7 i2)) (< (+ 6 i1) A))] [2022-03-15 22:22:59,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 154 states [2022-03-15 22:22:59,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:59,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2022-03-15 22:22:59,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2515, Invalid=24217, Unknown=0, NotChecked=0, Total=26732 [2022-03-15 22:22:59,357 INFO L87 Difference]: Start difference. First operand 874 states and 2465 transitions. Second operand has 154 states, 154 states have (on average 2.9220779220779223) internal successors, (450), 154 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:20,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:23:20,827 INFO L93 Difference]: Finished difference Result 2183 states and 6035 transitions. [2022-03-15 22:23:20,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 297 states. [2022-03-15 22:23:20,827 INFO L78 Accepts]: Start accepts. Automaton has has 154 states, 154 states have (on average 2.9220779220779223) internal successors, (450), 154 states have internal predecessors, (450), 0 states have call successors, (0), 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 22:23:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:23:20,831 INFO L225 Difference]: With dead ends: 2183 [2022-03-15 22:23:20,831 INFO L226 Difference]: Without dead ends: 2119 [2022-03-15 22:23:20,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 485 SyntacticMatches, 1 SemanticMatches, 435 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54982 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=31964, Invalid=158568, Unknown=0, NotChecked=0, Total=190532 [2022-03-15 22:23:20,840 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 750 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 8532 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 9143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 8532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:23:20,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [750 Valid, 43 Invalid, 9143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 8532 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-03-15 22:23:20,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2022-03-15 22:23:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 927. [2022-03-15 22:23:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 926 states have (on average 2.7915766738660905) internal successors, (2585), 926 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:20,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2585 transitions. [2022-03-15 22:23:20,857 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2585 transitions. Word has length 32 [2022-03-15 22:23:20,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:23:20,857 INFO L470 AbstractCegarLoop]: Abstraction has 927 states and 2585 transitions. [2022-03-15 22:23:20,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 154 states, 154 states have (on average 2.9220779220779223) internal successors, (450), 154 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:23:20,858 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2585 transitions. [2022-03-15 22:23:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 22:23:20,859 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:23:20,859 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:23:20,876 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 22:23:21,059 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,SelfDestructingSolverStorable48 [2022-03-15 22:23:21,059 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:23:21,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:23:21,060 INFO L85 PathProgramCache]: Analyzing trace with hash 375707439, now seen corresponding path program 44 times [2022-03-15 22:23:21,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:23:21,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035126851] [2022-03-15 22:23:21,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:23:21,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:23:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:23:21,222 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:21,222 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:23:21,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035126851] [2022-03-15 22:23:21,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035126851] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:23:21,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320087329] [2022-03-15 22:23:21,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:23:21,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:23:21,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:23:21,223 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 22:23:21,228 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 22:23:21,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:23:21,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:23:21,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 22:23:21,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:23:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:21,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:23:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:23:21,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320087329] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:21,465 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:21,465 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 33 [2022-03-15 22:23:21,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [208710691] [2022-03-15 22:23:21,465 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:21,468 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:21,558 INFO L252 McrAutomatonBuilder]: Finished intersection with 321 states and 728 transitions. [2022-03-15 22:23:21,559 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:28,518 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 131 new interpolants: [107669#(or (<= (+ 3 i2) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 107710#(or (<= A (+ 6 i1)) (<= (+ i2 10) A) (< (+ 7 i1) A)), 107665#(or (<= A (+ 6 i1)) (<= (+ 6 i2) A) (< (+ 7 i1) A)), 107680#(or (< (+ 9 i1) A) (<= (+ 7 i2) A) (<= A (+ i1 8))), 107620#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 5 i2) A)), 107607#(or (<= (+ i2 4) A) (< i1 A)), 107656#(or (<= (+ i2 8) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 107722#(or (<= A 9) (< 10 A) (<= (+ 9 i2) A)), 107691#(or (<= (+ i2 8) A) (< (+ i1 10) A) (<= A (+ 9 i1))), 107687#(or (< (+ i1 10) A) (<= (+ i2 4) A) (<= A (+ 9 i1))), 107625#(or (<= (+ i2 4) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 107629#(or (<= (+ 7 i2) A) (< (+ i1 1) A) (<= A i1)), 107682#(or (<= (+ i2 8) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 107700#(or (<= (+ 9 i2) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 107704#(or (<= (+ i2 10) A) (< (+ i1 1) A) (<= A i1)), 107681#(or (<= A (+ 6 i1)) (<= (+ i2 8) A) (< (+ 7 i1) A)), 107684#(or (<= (+ i2 1) A) (< (+ i1 10) A) (<= A (+ 9 i1))), 107616#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ i2 1) A)), 107694#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 9 i2) A)), 107660#(or (<= A (+ 6 i1)) (<= (+ i2 1) A) (< (+ 7 i1) A)), 107645#(or (<= A (+ i1 4)) (<= (+ 7 i2) A) (< (+ 5 i1) A)), 107605#(or (<= (+ 2 i2) A) (< i1 A)), 107707#(or (<= (+ i2 10) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 107674#(or (< (+ 9 i1) A) (<= (+ i2 1) A) (<= A (+ i1 8))), 107651#(or (<= A (+ 5 i1)) (<= (+ 6 i2) A) (< (+ 6 i1) A)), 107734#(or (<= 10 A) (< (+ i1 10) A) (<= A (+ 9 i1))), 107609#(or (<= (+ 6 i2) A) (< i1 A)), 107730#(or (<= A (+ 5 i1)) (<= 10 A) (< (+ 6 i1) A)), 107690#(or (<= (+ 7 i2) A) (< (+ i1 10) A) (<= A (+ 9 i1))), 107623#(or (<= (+ 2 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 107649#(or (<= A (+ 5 i1)) (<= (+ i2 4) A) (< (+ 6 i1) A)), 107636#(or (<= A (+ 3 i1)) (< (+ i1 4) A) (<= (+ 5 i2) A)), 107634#(or (<= (+ 3 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 107698#(or (<= A (+ 5 i1)) (<= (+ 9 i2) A) (< (+ 6 i1) A)), 107604#(or (<= (+ i2 1) A) (< i1 A)), 107699#(or (<= A (+ 6 i1)) (<= (+ 9 i2) A) (< (+ 7 i1) A)), 107622#(or (<= (+ i2 1) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 107626#(or (<= A (+ 2 i1)) (< (+ 3 i1) A) (<= (+ 5 i2) A)), 107725#(or (<= 10 A) (< (+ i1 1) A) (<= A i1)), 107711#(or (<= (+ i2 10) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 107611#(or (<= (+ 2 i2) A) (< (+ i1 1) A) (<= A i1)), 107678#(or (< (+ 9 i1) A) (<= A (+ i1 8)) (<= (+ 5 i2) A)), 107706#(or (<= (+ i2 10) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 107614#(or (< (+ i1 1) A) (<= (+ 5 i2) A) (<= A i1)), 107664#(or (<= A (+ 6 i1)) (<= (+ 5 i2) A) (< (+ 7 i1) A)), 107712#(or (<= (+ i2 10) A) (< (+ 9 i1) A) (<= A (+ i1 8))), 107627#(or (<= (+ 6 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 107612#(or (<= (+ 3 i2) A) (< (+ i1 1) A) (<= A i1)), 107717#(or (<= A 9) (< 10 A) (<= (+ i2 4) A)), 107672#(or (<= (+ 6 i2) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 107703#(or (<= (+ i2 10) A) (< i1 A)), 107719#(or (<= A 9) (< 10 A) (<= (+ 6 i2) A)), 107663#(or (<= A (+ 6 i1)) (<= (+ i2 4) A) (< (+ 7 i1) A)), 107733#(or (<= 10 A) (< (+ 9 i1) A) (<= A (+ i1 8))), 107637#(or (<= (+ 6 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 107619#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ i2 4) A)), 107695#(or (<= (+ 9 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 107729#(or (<= 10 A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 107714#(or (<= A 9) (<= (+ i2 1) A) (< 10 A)), 107689#(or (<= (+ 6 i2) A) (< (+ i1 10) A) (<= A (+ 9 i1))), 107679#(or (< (+ 9 i1) A) (<= A (+ i1 8)) (<= (+ 6 i2) A)), 107638#(or (<= (+ 7 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 107658#(or (<= (+ i2 8) A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 107647#(or (<= A (+ 5 i1)) (<= (+ 2 i2) A) (< (+ 6 i1) A)), 107648#(or (<= A (+ 5 i1)) (<= (+ 3 i2) A) (< (+ 6 i1) A)), 107641#(or (<= (+ 3 i2) A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 107718#(or (<= A 9) (< 10 A) (<= (+ 5 i2) A)), 107721#(or (<= (+ i2 8) A) (<= A 9) (< 10 A)), 107685#(or (<= (+ 2 i2) A) (< (+ i1 10) A) (<= A (+ 9 i1))), 107692#(or (<= (+ 9 i2) A) (< i1 A)), 107715#(or (<= A 9) (< 10 A) (<= (+ 2 i2) A)), 107659#(or (<= A (+ 5 i1)) (<= (+ i2 8) A) (< (+ 6 i1) A)), 107655#(or (<= (+ i2 8) A) (<= A (+ i1 1)) (< (+ 2 i1) A)), 107713#(or (<= (+ i2 10) A) (< (+ i1 10) A) (<= A (+ 9 i1))), 107613#(or (<= (+ i2 4) A) (< (+ i1 1) A) (<= A i1)), 107652#(or (<= A (+ 5 i1)) (<= (+ 7 i2) A) (< (+ 6 i1) A)), 107644#(or (<= A (+ i1 4)) (<= (+ 6 i2) A) (< (+ 5 i1) A)), 107720#(or (<= A 9) (<= (+ 7 i2) A) (< 10 A)), 107628#(or (<= (+ 7 i2) A) (< i1 A)), 107702#(or (<= (+ 9 i2) A) (< (+ i1 10) A) (<= A (+ 9 i1))), 107633#(or (<= (+ 2 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 107646#(or (<= A (+ 5 i1)) (<= (+ i2 1) A) (< (+ 6 i1) A)), 107632#(or (<= (+ i2 1) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 107705#(or (<= (+ i2 10) A) (<= A (+ i1 1)) (< (+ 2 i1) A)), 107657#(or (<= (+ i2 8) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 107696#(or (<= (+ 9 i2) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 107677#(or (< (+ 9 i1) A) (<= A (+ i1 8)) (<= (+ i2 4) A)), 107630#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 7 i2) A)), 107662#(or (<= A (+ 6 i1)) (<= (+ 3 i2) A) (< (+ 7 i1) A)), 107643#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= (+ 5 i2) A)), 107686#(or (<= (+ 3 i2) A) (< (+ i1 10) A) (<= A (+ 9 i1))), 107635#(or (<= (+ i2 4) A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 107610#(or (<= (+ i2 1) A) (< (+ i1 1) A) (<= A i1)), 107618#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 3 i2) A)), 107673#(or (<= (+ 7 i2) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 107701#(or (< (+ 9 i1) A) (<= A (+ i1 8)) (<= (+ 9 i2) A)), 107697#(or (<= A (+ i1 4)) (<= (+ 9 i2) A) (< (+ 5 i1) A)), 107617#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 2 i2) A)), 107653#(or (<= (+ i2 8) A) (< i1 A)), 107621#(or (<= A (+ i1 1)) (< (+ 2 i1) A) (<= (+ 6 i2) A)), 107670#(or (<= A (+ 7 i1)) (<= (+ i2 4) A) (< (+ i1 8) A)), 107668#(or (<= (+ 2 i2) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 107708#(or (<= (+ i2 10) A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 107667#(or (<= (+ i2 1) A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 107723#(or (<= (+ i2 10) A) (<= A 9) (< 10 A)), 107728#(or (<= 10 A) (<= A (+ 3 i1)) (< (+ i1 4) A)), 107675#(or (< (+ 9 i1) A) (<= A (+ i1 8)) (<= (+ 2 i2) A)), 107642#(or (<= A (+ i1 4)) (< (+ 5 i1) A) (<= (+ i2 4) A)), 107724#(or (<= 10 A) (< i1 A)), 107606#(or (<= (+ 3 i2) A) (< i1 A)), 107624#(or (<= (+ 3 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 107709#(or (<= (+ i2 10) A) (<= A (+ 5 i1)) (< (+ 6 i1) A)), 107639#(or (<= (+ i2 1) A) (<= A (+ i1 4)) (< (+ 5 i1) A)), 107693#(or (<= (+ 9 i2) A) (< (+ i1 1) A) (<= A i1)), 107654#(or (<= (+ i2 8) A) (< (+ i1 1) A) (<= A i1)), 107732#(or (<= 10 A) (<= A (+ 7 i1)) (< (+ i1 8) A)), 107661#(or (<= A (+ 6 i1)) (<= (+ 2 i2) A) (< (+ 7 i1) A)), 107640#(or (<= A (+ i1 4)) (<= (+ 2 i2) A) (< (+ 5 i1) A)), 107683#(or (< (+ 9 i1) A) (<= (+ i2 8) A) (<= A (+ i1 8))), 107726#(or (<= 10 A) (<= A (+ i1 1)) (< (+ 2 i1) A)), 107688#(or (< (+ i1 10) A) (<= (+ 5 i2) A) (<= A (+ 9 i1))), 107676#(or (< (+ 9 i1) A) (<= (+ 3 i2) A) (<= A (+ i1 8))), 107631#(or (<= (+ 7 i2) A) (<= A (+ 2 i1)) (< (+ 3 i1) A)), 107666#(or (<= A (+ 6 i1)) (<= (+ 7 i2) A) (< (+ 7 i1) A)), 107671#(or (<= A (+ 7 i1)) (< (+ i1 8) A) (<= (+ 5 i2) A)), 107716#(or (<= A 9) (<= (+ 3 i2) A) (< 10 A)), 107731#(or (<= A (+ 6 i1)) (<= 10 A) (< (+ 7 i1) A)), 107608#(or (< i1 A) (<= (+ 5 i2) A)), 107650#(or (<= A (+ 5 i1)) (< (+ 6 i1) A) (<= (+ 5 i2) A)), 107615#(or (<= (+ 6 i2) A) (< (+ i1 1) A) (<= A i1)), 107727#(or (<= 10 A) (<= A (+ 2 i1)) (< (+ 3 i1) A))] [2022-03-15 22:23:28,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 154 states [2022-03-15 22:23:28,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:28,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2022-03-15 22:23:28,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2561, Invalid=24171, Unknown=0, NotChecked=0, Total=26732 [2022-03-15 22:23:28,521 INFO L87 Difference]: Start difference. First operand 927 states and 2585 transitions. Second operand has 154 states, 154 states have (on average 2.9220779220779223) internal successors, (450), 154 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:24:33,415 INFO L93 Difference]: Finished difference Result 7436 states and 21347 transitions. [2022-03-15 22:24:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 901 states. [2022-03-15 22:24:33,416 INFO L78 Accepts]: Start accepts. Automaton has has 154 states, 154 states have (on average 2.9220779220779223) internal successors, (450), 154 states have internal predecessors, (450), 0 states have call successors, (0), 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 22:24:33,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:24:33,429 INFO L225 Difference]: With dead ends: 7436 [2022-03-15 22:24:33,430 INFO L226 Difference]: Without dead ends: 7436 [2022-03-15 22:24:33,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2131 GetRequests, 1088 SyntacticMatches, 2 SemanticMatches, 1041 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502296 ImplicationChecksByTransitivity, 58.3s TimeCoverageRelationStatistics Valid=146738, Invalid=940068, Unknown=0, NotChecked=0, Total=1086806 [2022-03-15 22:24:33,478 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 2606 mSDsluCounter, 3901 mSDsCounter, 0 mSdLazyCounter, 9609 mSolverCounterSat, 2100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2606 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 11709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2100 IncrementalHoareTripleChecker+Valid, 9609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:24:33,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2606 Valid, 50 Invalid, 11709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2100 Valid, 9609 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-03-15 22:24:33,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7436 states. [2022-03-15 22:24:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7436 to 1134. [2022-03-15 22:24:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1133 states have (on average 2.845542806707855) internal successors, (3224), 1133 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:33,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 3224 transitions. [2022-03-15 22:24:33,527 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 3224 transitions. Word has length 32 [2022-03-15 22:24:33,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:24:33,527 INFO L470 AbstractCegarLoop]: Abstraction has 1134 states and 3224 transitions. [2022-03-15 22:24:33,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 154 states, 154 states have (on average 2.9220779220779223) internal successors, (450), 154 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:24:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 3224 transitions. [2022-03-15 22:24:33,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 22:24:33,529 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:24:33,529 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:24:33,545 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 22:24:33,729 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,SelfDestructingSolverStorable49 [2022-03-15 22:24:33,730 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:24:33,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:24:33,730 INFO L85 PathProgramCache]: Analyzing trace with hash 678065405, now seen corresponding path program 45 times [2022-03-15 22:24:33,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:24:33,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904536805] [2022-03-15 22:24:33,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:24:33,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:24:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:24:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:33,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:24:33,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904536805] [2022-03-15 22:24:33,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904536805] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:24:33,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945079998] [2022-03-15 22:24:33,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:24:33,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:24:33,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:24:33,888 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 22:24:33,888 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 22:24:33,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 22:24:33,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:24:33,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 22:24:33,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:24:34,103 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 22:24:34,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:24:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:24:34,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945079998] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:24:34,153 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:24:34,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 34 [2022-03-15 22:24:34,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1497285174] [2022-03-15 22:24:34,153 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:24:34,156 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:24:34,312 INFO L252 McrAutomatonBuilder]: Finished intersection with 311 states and 709 transitions. [2022-03-15 22:24:34,313 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:24:39,715 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 130 new interpolants: [120365#(or (<= A (+ 3 i1)) (<= (+ 5 i2) i1)), 120354#(or (<= (+ 5 i2) i1) (<= A (+ 2 i1))), 120410#(or (<= A 8) (<= i2 8)), 120342#(or (<= A (+ i1 1)) (<= (+ 5 i2) i1)), 120401#(or (<= i2 (+ i1 1)) (<= A (+ i1 8))), 120375#(or (<= A (+ 7 i1)) (<= i2 (+ 6 i1))), 120380#(or (<= i2 (+ i1 1)) (<= A (+ 7 i1))), 120408#(<= A 9), 120384#(<= A (+ 9 i1)), 120412#(or (<= A 8) (<= i2 6)), 120416#(or (<= A (+ i1 4)) (<= 4 i1)), 120317#(<= A (+ 6 i1)), 120364#(or (<= (+ 6 i2) i1) (<= A (+ 2 i1))), 120341#(or (<= (+ 6 i2) i1) (<= A i1)), 120407#(or (<= 10 A) (<= A 8)), 120319#(or (<= A (+ 5 i1)) (<= i2 (+ 5 i1))), 120353#(or (<= A (+ i1 1)) (<= (+ 6 i2) i1)), 120343#(or (<= (+ i2 4) i1) (<= A (+ 2 i1))), 120305#(or (<= A i1) (<= i2 i1)), 120346#(or (<= A (+ 3 i1)) (<= (+ 2 i2) i1)), 120389#(or (<= A (+ i1 8)) (<= i2 (+ 5 i1))), 120378#(or (<= A (+ 7 i1)) (<= i2 (+ 3 i1))), 120345#(or (<= A (+ 3 i1)) (<= (+ i2 1) i1)), 120306#(or (<= i2 (+ i1 1)) (<= A (+ i1 1))), 120347#(or (<= A (+ 3 i1)) (<= (+ 3 i2) i1)), 120413#(or (<= i2 5) (<= A 8)), 120331#(or (<= A (+ 6 i1)) (<= i2 (+ i1 4))), 120422#(or (<= A 8) (<= i2 3)), 120372#(<= A (+ i1 8)), 120387#(or (<= A (+ i1 8)) (<= i2 (+ 7 i1))), 120397#(or (<= A (+ 7 i1)) (<= i2 i1)), 120322#(or (<= A (+ 6 i1)) (<= i2 (+ 7 i1))), 120376#(or (<= i2 (+ 5 i1)) (<= A (+ 7 i1))), 120419#(or (<= A (+ 7 i1)) (<= 1 i1)), 120344#(or (<= A (+ 3 i1)) (<= i2 i1)), 120297#(<= A (+ i1 1)), 120390#(or (<= A (+ 3 i2)) (<= (+ 5 i2) A)), 120351#(or (<= A (+ i1 4)) (<= (+ 2 i2) i1)), 120398#(or (<= A (+ i1 8)) (<= i2 (+ i1 4))), 120379#(or (<= A (+ 7 i1)) (<= i2 (+ 2 i1))), 120316#(or (<= A (+ i1 4)) (<= i2 (+ 3 i1))), 120367#(or (<= A (+ 5 i1)) (<= (+ 3 i2) i1)), 120336#(or (<= (+ 5 i2) i1) (<= A i1)), 120349#(or (<= A (+ i1 4)) (<= i2 i1)), 120307#(or (<= A (+ 2 i1)) (<= i2 (+ 2 i1))), 120325#(or (<= (+ 2 i2) i1) (<= A i1)), 120314#(or (<= A (+ i1 4)) (<= i2 (+ 5 i1))), 120339#(or (<= A (+ 2 i1)) (<= (+ 2 i2) i1)), 120402#(or (<= 8 i1) (<= A i1)), 120338#(or (<= A (+ 2 i1)) (<= (+ i2 1) i1)), 120333#(or (<= (+ i2 4) i1) (<= A i1)), 120335#(or (<= A (+ i1 1)) (<= (+ 3 i2) i1)), 120394#(or (<= (+ 9 i2) A) (<= A (+ 7 i2))), 120352#(or (<= (+ 7 i2) i1) (<= A i1)), 120368#(or (<= A (+ 6 i1)) (<= i2 (+ 3 i1))), 120356#(or (<= A (+ i1 4)) (<= (+ 3 i2) i1)), 120383#(or (<= A (+ 2 i2)) (<= (+ i2 4) A)), 120320#(or (<= A (+ 5 i1)) (<= i2 (+ i1 4))), 120409#(or (<= i2 9) (<= A 8)), 120318#(or (<= A (+ 5 i1)) (<= i2 (+ 6 i1))), 120366#(or (<= (+ i2 4) i1) (<= A (+ i1 4))), 120321#(<= A (+ 7 i1)), 120358#(or (<= A (+ 5 i1)) (<= i2 (+ i1 1))), 120403#(or (<= 7 i1) (<= A (+ i1 1))), 120330#(or (<= A (+ 5 i1)) (<= i2 (+ 3 i1))), 120324#(or (<= A (+ 6 i1)) (<= i2 (+ 5 i1))), 120313#(<= A (+ 5 i1)), 120371#(or (<= A (+ 6 i1)) (<= i2 i1)), 120374#(or (<= A (+ 7 i1)) (<= i2 (+ 7 i1))), 120396#(or (<= A (+ 6 i1)) (<= (+ i2 1) i1)), 120329#(or (<= A (+ i1 4)) (<= i2 (+ 2 i1))), 120361#(or (<= A (+ 5 i1)) (<= (+ 2 i2) i1)), 120425#(or (<= i2 0) (<= A 8)), 120296#(<= A i1), 120337#(or (<= (+ i2 4) i1) (<= A (+ i1 1))), 120395#(or (<= (+ i2 10) A) (<= A (+ i2 8))), 120391#(or (<= A (+ i2 4)) (<= (+ 6 i2) A)), 120308#(or (<= A (+ 3 i1)) (<= i2 (+ 3 i1))), 120421#(or (<= 0 i1) (<= A (+ i1 8))), 120340#(or (<= A (+ 2 i1)) (<= (+ 3 i2) i1)), 120350#(or (<= A (+ i1 4)) (<= (+ i2 1) i1)), 120309#(or (<= A i1) (<= (+ i2 1) i1)), 120393#(or (<= (+ i2 8) A) (<= A (+ 6 i2))), 120311#(or (<= i2 (+ i1 1)) (<= A (+ 2 i1))), 120400#(or (<= A (+ i1 8)) (<= i2 (+ 2 i1))), 120388#(or (<= A (+ i1 8)) (<= i2 (+ 6 i1))), 120334#(or (<= A (+ i1 1)) (<= (+ 2 i2) i1)), 120362#(or (<= (+ i2 8) i1) (<= A i1)), 120302#(or (<= A (+ 2 i1)) (<= i2 (+ 3 i1))), 120369#(or (<= A (+ 6 i1)) (<= i2 (+ 2 i1))), 120300#(or (<= A (+ i1 1)) (<= i2 (+ 2 i1))), 120303#(<= A (+ i1 4)), 120332#(or (<= A i1) (<= (+ 3 i2) i1)), 120406#(or (<= A (+ 7 i1)) (<= (+ i2 1) i1)), 120299#(<= A (+ 2 i1)), 120415#(or (<= 5 i1) (<= A (+ 3 i1))), 120381#(or (<= A i2) (<= (+ 2 i2) A)), 120326#(or (<= A (+ i1 1)) (<= (+ i2 1) i1)), 120310#(or (<= A (+ i1 1)) (<= i2 i1)), 120373#(or (<= i2 (+ i1 8)) (<= A (+ 7 i1))), 120423#(or (<= i2 2) (<= A 8)), 120323#(or (<= A (+ 6 i1)) (<= i2 (+ 6 i1))), 120386#(or (<= i2 (+ i1 8)) (<= A (+ i1 8))), 120385#(or (<= A (+ i1 8)) (<= i2 (+ 9 i1))), 120420#(or (<= A (+ i1 8)) (<= i2 i1)), 120399#(or (<= A (+ i1 8)) (<= i2 (+ 3 i1))), 120411#(or (<= A 8) (<= i2 7)), 120360#(or (<= A (+ 5 i1)) (<= (+ i2 1) i1)), 120355#(or (<= (+ i2 4) i1) (<= A (+ 3 i1))), 120304#(or (<= i2 (+ i1 4)) (<= A (+ 3 i1))), 120315#(or (<= A (+ i1 4)) (<= i2 (+ i1 4))), 120348#(or (<= i2 (+ i1 1)) (<= A (+ i1 4))), 120312#(or (<= A (+ 3 i1)) (<= i2 (+ 2 i1))), 120298#(or (<= i2 (+ i1 1)) (<= A i1)), 120370#(or (<= A (+ 6 i1)) (<= i2 (+ i1 1))), 120404#(or (<= 6 i1) (<= A (+ 2 i1))), 120392#(or (<= A (+ 5 i2)) (<= (+ 7 i2) A)), 120418#(or (<= A (+ 6 i1)) (<= 2 i1)), 120417#(or (<= A (+ 5 i1)) (<= 3 i1)), 120363#(or (<= (+ 7 i2) i1) (<= A (+ i1 1))), 120414#(or (<= i2 4) (<= A 8)), 120424#(or (<= i2 1) (<= A 8)), 120382#(or (<= (+ 3 i2) A) (<= A (+ i2 1))), 120327#(or (<= A (+ 2 i1)) (<= i2 i1)), 120357#(or (<= A (+ 5 i1)) (<= i2 (+ 2 i1))), 120328#(or (<= i2 (+ i1 1)) (<= A (+ 3 i1))), 120359#(or (<= A (+ 5 i1)) (<= i2 i1)), 120377#(or (<= i2 (+ i1 4)) (<= A (+ 7 i1))), 120301#(<= A (+ 3 i1)), 120405#(or (<= A (+ 6 i1)) (<= (+ 2 i2) i1))] [2022-03-15 22:24:39,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 153 states [2022-03-15 22:24:39,715 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:24:39,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2022-03-15 22:24:39,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6253, Invalid=20479, Unknown=0, NotChecked=0, Total=26732 [2022-03-15 22:24:39,718 INFO L87 Difference]: Start difference. First operand 1134 states and 3224 transitions. Second operand has 153 states, 153 states have (on average 2.8627450980392157) internal successors, (438), 153 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 22:25:09,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 589 states. [2022-03-15 22:25:09,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1479 GetRequests, 748 SyntacticMatches, 1 SemanticMatches, 729 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221995 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=118073, Invalid=415557, Unknown=0, NotChecked=0, Total=533630 [2022-03-15 22:25:09,222 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 720 mSDsluCounter, 2553 mSDsCounter, 0 mSdLazyCounter, 6373 mSolverCounterSat, 899 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 7272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 899 IncrementalHoareTripleChecker+Valid, 6373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:09,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [720 Valid, 30 Invalid, 7272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [899 Valid, 6373 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 22:25:09,223 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:25:09,230 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:25:09,230 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:25:09,241 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 22:25:09,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:09,432 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (1134states) and FLOYD_HOARE automaton (currently 589 states, 153 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 731 known predicates. [2022-03-15 22:25:09,433 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:25:09,433 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:25:09,433 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:25:09,435 INFO L732 BasicCegarLoop]: Path program histogram: [45, 3, 2, 1] [2022-03-15 22:25:09,437 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:25:09,437 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:25:09,438 INFO L202 PluginConnector]: Adding new model multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:25:09 BasicIcfg [2022-03-15 22:25:09,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:25:09,438 INFO L158 Benchmark]: Toolchain (without parser) took 735261.41ms. Allocated memory was 183.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 145.4MB in the beginning and 842.9MB in the end (delta: -697.4MB). Peak memory consumption was 451.8MB. Max. memory is 8.0GB. [2022-03-15 22:25:09,438 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:25:09,439 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.81ms. Allocated memory is still 183.5MB. Free memory was 145.3MB in the beginning and 143.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:25:09,439 INFO L158 Benchmark]: Boogie Preprocessor took 15.08ms. Allocated memory is still 183.5MB. Free memory was 143.8MB in the beginning and 142.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:25:09,439 INFO L158 Benchmark]: RCFGBuilder took 162.81ms. Allocated memory is still 183.5MB. Free memory was 142.8MB in the beginning and 133.5MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:25:09,439 INFO L158 Benchmark]: TraceAbstraction took 735056.73ms. Allocated memory was 183.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 132.9MB in the beginning and 842.9MB in the end (delta: -709.9MB). Peak memory consumption was 439.2MB. Max. memory is 8.0GB. [2022-03-15 22:25:09,439 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.09ms. Allocated memory is still 183.5MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.81ms. Allocated memory is still 183.5MB. Free memory was 145.3MB in the beginning and 143.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.08ms. Allocated memory is still 183.5MB. Free memory was 143.8MB in the beginning and 142.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 162.81ms. Allocated memory is still 183.5MB. Free memory was 142.8MB in the beginning and 133.5MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 735056.73ms. Allocated memory was 183.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 132.9MB in the beginning and 842.9MB in the end (delta: -709.9MB). Peak memory consumption was 439.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 41 PlacesBefore, 27 PlacesAfterwards, 33 TransitionsBefore, 19 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 12 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 255 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 225, positive: 219, positive conditional: 0, positive unconditional: 219, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 146, positive: 140, positive conditional: 0, positive unconditional: 140, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 225, positive: 79, positive conditional: 0, positive unconditional: 79, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 146, unknown conditional: 0, unknown unconditional: 146] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 11, Positive conditional cache size: 0, Positive unconditional cache size: 11, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (1134states) and FLOYD_HOARE automaton (currently 589 states, 153 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 731 known predicates. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (1134states) and FLOYD_HOARE automaton (currently 589 states, 153 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 731 known predicates. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (1134states) and FLOYD_HOARE automaton (currently 589 states, 153 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 731 known predicates. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (1134states) and FLOYD_HOARE automaton (currently 589 states, 153 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 731 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 55 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 735.0s, OverallIterations: 51, TraceHistogramMax: 10, PathProgramHistogramMax: 45, EmptinessCheckTime: 0.0s, AutomataDifference: 541.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17964 SdHoareTripleChecker+Valid, 144.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17964 mSDsluCounter, 763 SdHoareTripleChecker+Invalid, 121.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147833 mSDsCounter, 17285 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 397331 IncrementalHoareTripleChecker+Invalid, 414616 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17285 mSolverCounterUnsat, 51 mSDtfsCounter, 397331 mSolverCounterSat, 0.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23681 GetRequests, 11912 SyntacticMatches, 217 SemanticMatches, 11551 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2062435 ImplicationChecksByTransitivity, 454.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1134occurred in iteration=50, InterpolantAutomatonStates: 8453, 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, 50 MinimizatonAttempts, 34453 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 2219 NumberOfCodeBlocks, 2219 NumberOfCodeBlocksAsserted, 182 NumberOfCheckSat, 3152 ConstructedInterpolants, 16 QuantifiedInterpolants, 22207 SizeOfPredicates, 199 NumberOfNonLiveVariables, 4690 ConjunctsInSsa, 1004 ConjunctsInUnsatCore, 143 InterpolantComputations, 5 PerfectInterpolantSequences, 1721/5441 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