/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-bad/commit-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:47:18,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:47:18,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:47:18,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:47:18,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:47:19,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:47:19,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:47:19,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:47:19,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:47:19,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:47:19,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:47:19,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:47:19,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:47:19,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:47:19,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:47:19,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:47:19,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:47:19,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:47:19,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:47:19,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:47:19,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:47:19,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:47:19,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:47:19,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:47:19,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:47:19,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:47:19,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:47:19,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:47:19,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:47:19,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:47:19,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:47:19,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:47:19,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:47:19,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:47:19,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:47:19,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:47:19,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:47:19,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:47:19,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:47:19,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:47:19,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:47:19,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 21:47:19,045 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:47:19,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:47:19,046 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:47:19,046 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:47:19,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:47:19,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:47:19,047 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:47:19,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:47:19,047 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:47:19,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:47:19,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:47:19,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:47:19,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:47:19,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:47:19,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:47:19,049 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:47:19,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:47:19,049 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:47:19,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:47:19,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:47:19,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:47:19,050 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:47:19,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:47:19,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:47:19,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:47:19,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:47:19,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:47:19,051 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:47:19,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:47:19,051 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:47:19,051 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:47:19,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:47:19,052 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 21:47:19,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:47:19,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:47:19,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:47:19,257 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:47:19,258 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:47:19,259 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/commit-2.wvr.bpl [2022-03-15 21:47:19,259 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/commit-2.wvr.bpl' [2022-03-15 21:47:19,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:47:19,298 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:47:19,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:47:19,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:47:19,299 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:47:19,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "commit-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:19" (1/1) ... [2022-03-15 21:47:19,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "commit-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:19" (1/1) ... [2022-03-15 21:47:19,322 INFO L137 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:47:19,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:47:19,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:47:19,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:47:19,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:47:19,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "commit-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:19" (1/1) ... [2022-03-15 21:47:19,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "commit-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:19" (1/1) ... [2022-03-15 21:47:19,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "commit-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:19" (1/1) ... [2022-03-15 21:47:19,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "commit-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:19" (1/1) ... [2022-03-15 21:47:19,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "commit-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:19" (1/1) ... [2022-03-15 21:47:19,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "commit-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:19" (1/1) ... [2022-03-15 21:47:19,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "commit-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:19" (1/1) ... [2022-03-15 21:47:19,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:47:19,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:47:19,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:47:19,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:47:19,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "commit-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:19" (1/1) ... [2022-03-15 21:47:19,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:47:19,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:19,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 21:47:19,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 21:47:19,444 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:47:19,444 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:47:19,444 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:47:19,445 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:47:19,445 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:47:19,445 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:47:19,445 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:47:19,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:47:19,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:47:19,446 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:47:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:47:19,446 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:47:19,447 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2022-03-15 21:47:19,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 21:47:19,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 21:47:19,448 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 21:47:19,499 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:47:19,501 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:47:19,682 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:47:19,761 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:47:19,762 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 21:47:19,762 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread1EXIT is neither atomic block end nor error location. [2022-03-15 21:47:19,763 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread2EXIT is neither atomic block end nor error location. [2022-03-15 21:47:19,763 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread3EXIT is neither atomic block end nor error location. [2022-03-15 21:47:19,763 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread4EXIT is neither atomic block end nor error location. [2022-03-15 21:47:19,765 INFO L202 PluginConnector]: Adding new model commit-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:47:19 BoogieIcfgContainer [2022-03-15 21:47:19,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:47:19,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:47:19,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:47:19,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:47:19,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "commit-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:19" (1/2) ... [2022-03-15 21:47:19,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b3c75c and model type commit-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:47:19, skipping insertion in model container [2022-03-15 21:47:19,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "commit-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:47:19" (2/2) ... [2022-03-15 21:47:19,787 INFO L111 eAbstractionObserver]: Analyzing ICFG commit-2.wvr.bpl [2022-03-15 21:47:19,790 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:47:19,791 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:47:19,791 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:47:19,791 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:47:19,817 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 21:47:19,854 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:47:19,858 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 21:47:19,858 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 21:47:19,866 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:47:19,874 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 82 flow [2022-03-15 21:47:19,876 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 82 flow [2022-03-15 21:47:19,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 82 flow [2022-03-15 21:47:19,896 INFO L129 PetriNetUnfolder]: 4/21 cut-off events. [2022-03-15 21:47:19,896 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 21:47:19,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 21 events. 4/21 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2022-03-15 21:47:19,904 INFO L116 LiptonReduction]: Number of co-enabled transitions 96 [2022-03-15 21:47:19,942 INFO L131 LiptonReduction]: Checked pairs total: 108 [2022-03-15 21:47:19,942 INFO L133 LiptonReduction]: Total number of compositions: 3 [2022-03-15 21:47:19,951 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 23 transitions, 78 flow [2022-03-15 21:47:19,973 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 48 states, 47 states have (on average 3.4893617021276597) internal successors, (164), 47 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 47 states have (on average 3.4893617021276597) internal successors, (164), 47 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:19,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:47:19,980 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:19,980 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:19,981 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:19,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:19,985 INFO L85 PathProgramCache]: Analyzing trace with hash 125410778, now seen corresponding path program 1 times [2022-03-15 21:47:19,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:20,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966466128] [2022-03-15 21:47:20,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:20,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:20,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:20,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966466128] [2022-03-15 21:47:20,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966466128] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:47:20,102 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:47:20,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 21:47:20,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1837912002] [2022-03-15 21:47:20,104 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:20,111 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:20,155 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 98 transitions. [2022-03-15 21:47:20,155 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:20,428 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:47:20,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:47:20,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:20,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:47:20,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:47:20,449 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 3.4893617021276597) internal successors, (164), 47 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:20,490 INFO L93 Difference]: Finished difference Result 93 states and 325 transitions. [2022-03-15 21:47:20,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:47:20,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 21:47:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:20,500 INFO L225 Difference]: With dead ends: 93 [2022-03-15 21:47:20,501 INFO L226 Difference]: Without dead ends: 88 [2022-03-15 21:47:20,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:47:20,505 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:20,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:47:20,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-03-15 21:47:20,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-03-15 21:47:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 3.574712643678161) internal successors, (311), 87 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 311 transitions. [2022-03-15 21:47:20,541 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 311 transitions. Word has length 14 [2022-03-15 21:47:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:20,541 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 311 transitions. [2022-03-15 21:47:20,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 311 transitions. [2022-03-15 21:47:20,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:47:20,543 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:20,543 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:20,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:47:20,544 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:20,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash -407215713, now seen corresponding path program 1 times [2022-03-15 21:47:20,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:20,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100761636] [2022-03-15 21:47:20,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:20,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:20,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:20,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100761636] [2022-03-15 21:47:20,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100761636] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:20,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998399498] [2022-03-15 21:47:20,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:20,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:20,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:20,599 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:47:20,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 21:47:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:20,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:47:20,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:20,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:20,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998399498] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:20,893 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:20,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 3 [2022-03-15 21:47:20,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [14349948] [2022-03-15 21:47:20,895 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:20,896 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:20,907 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 137 transitions. [2022-03-15 21:47:20,907 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:21,406 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:47:21,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:47:21,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:21,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:47:21,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:47:21,408 INFO L87 Difference]: Start difference. First operand 88 states and 311 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:21,444 INFO L93 Difference]: Finished difference Result 119 states and 424 transitions. [2022-03-15 21:47:21,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:47:21,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:47:21,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:21,457 INFO L225 Difference]: With dead ends: 119 [2022-03-15 21:47:21,457 INFO L226 Difference]: Without dead ends: 105 [2022-03-15 21:47:21,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 64 SyntacticMatches, 10 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:47:21,462 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:21,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 9 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:47:21,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-03-15 21:47:21,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2022-03-15 21:47:21,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 3.5853658536585367) internal successors, (294), 82 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 294 transitions. [2022-03-15 21:47:21,476 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 294 transitions. Word has length 15 [2022-03-15 21:47:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:21,476 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 294 transitions. [2022-03-15 21:47:21,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 294 transitions. [2022-03-15 21:47:21,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:47:21,477 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:21,478 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:21,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:21,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:21,702 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash -391188155, now seen corresponding path program 1 times [2022-03-15 21:47:21,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:21,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93362383] [2022-03-15 21:47:21,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:21,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:21,739 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:21,740 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93362383] [2022-03-15 21:47:21,740 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93362383] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:47:21,740 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:47:21,740 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 21:47:21,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [824029071] [2022-03-15 21:47:21,740 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:21,742 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:21,750 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 147 transitions. [2022-03-15 21:47:21,750 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:22,210 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [782#(and (not (= node_2_state 1)) (or (<= node_2_back node_2_front) (not (= node_2_state 0))))] [2022-03-15 21:47:22,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:47:22,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:22,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:47:22,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:47:22,212 INFO L87 Difference]: Start difference. First operand 83 states and 294 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:22,249 INFO L93 Difference]: Finished difference Result 127 states and 416 transitions. [2022-03-15 21:47:22,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:47:22,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 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 15 [2022-03-15 21:47:22,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:22,253 INFO L225 Difference]: With dead ends: 127 [2022-03-15 21:47:22,253 INFO L226 Difference]: Without dead ends: 119 [2022-03-15 21:47:22,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:47:22,256 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:22,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 13 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:47:22,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-03-15 21:47:22,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 97. [2022-03-15 21:47:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 3.5) internal successors, (336), 96 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 336 transitions. [2022-03-15 21:47:22,278 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 336 transitions. Word has length 15 [2022-03-15 21:47:22,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:22,279 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 336 transitions. [2022-03-15 21:47:22,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 336 transitions. [2022-03-15 21:47:22,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:47:22,280 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:22,280 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:22,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 21:47:22,285 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:22,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:22,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1301653763, now seen corresponding path program 1 times [2022-03-15 21:47:22,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:22,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267928035] [2022-03-15 21:47:22,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:22,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:22,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:22,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267928035] [2022-03-15 21:47:22,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267928035] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:47:22,328 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:47:22,328 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 21:47:22,328 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2054033456] [2022-03-15 21:47:22,329 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:22,330 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:22,339 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 147 transitions. [2022-03-15 21:47:22,339 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:22,778 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1107#(and (or (not (= node_1_state 0)) (<= node_1_back node_1_front)) (not (= node_1_state 1)))] [2022-03-15 21:47:22,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:47:22,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:22,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:47:22,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:47:22,780 INFO L87 Difference]: Start difference. First operand 97 states and 336 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:22,815 INFO L93 Difference]: Finished difference Result 75 states and 236 transitions. [2022-03-15 21:47:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:47:22,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:47:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:22,816 INFO L225 Difference]: With dead ends: 75 [2022-03-15 21:47:22,816 INFO L226 Difference]: Without dead ends: 63 [2022-03-15 21:47:22,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:47:22,817 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:22,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 13 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:47:22,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-03-15 21:47:22,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-03-15 21:47:22,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 3.338709677419355) internal successors, (207), 62 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 207 transitions. [2022-03-15 21:47:22,821 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 207 transitions. Word has length 15 [2022-03-15 21:47:22,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:22,821 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 207 transitions. [2022-03-15 21:47:22,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:22,821 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 207 transitions. [2022-03-15 21:47:22,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:47:22,823 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:22,823 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:22,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 21:47:22,824 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:22,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1902368137, now seen corresponding path program 1 times [2022-03-15 21:47:22,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:22,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416410337] [2022-03-15 21:47:22,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:22,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:22,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:22,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:22,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416410337] [2022-03-15 21:47:22,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416410337] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:22,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061557370] [2022-03-15 21:47:22,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:22,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:22,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:22,888 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:47:22,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 21:47:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:22,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:47:22,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:23,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:23,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061557370] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:23,069 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:23,069 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 3 [2022-03-15 21:47:23,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [901982985] [2022-03-15 21:47:23,069 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:23,071 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:23,077 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 137 transitions. [2022-03-15 21:47:23,077 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:23,607 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1316#(and safe (<= manager_back manager_front))] [2022-03-15 21:47:23,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 21:47:23,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:23,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 21:47:23,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:47:23,608 INFO L87 Difference]: Start difference. First operand 63 states and 207 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:23,642 INFO L93 Difference]: Finished difference Result 114 states and 388 transitions. [2022-03-15 21:47:23,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:47:23,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:47:23,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:23,644 INFO L225 Difference]: With dead ends: 114 [2022-03-15 21:47:23,644 INFO L226 Difference]: Without dead ends: 107 [2022-03-15 21:47:23,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:47:23,645 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:23,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 17 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:47:23,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-03-15 21:47:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-03-15 21:47:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 3.452830188679245) internal successors, (366), 106 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 366 transitions. [2022-03-15 21:47:23,650 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 366 transitions. Word has length 15 [2022-03-15 21:47:23,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:23,650 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 366 transitions. [2022-03-15 21:47:23,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:23,650 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 366 transitions. [2022-03-15 21:47:23,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:47:23,651 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:23,651 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:23,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:23,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:23,877 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:23,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1156147362, now seen corresponding path program 1 times [2022-03-15 21:47:23,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:23,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721561300] [2022-03-15 21:47:23,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:23,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:47:23,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:23,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721561300] [2022-03-15 21:47:23,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721561300] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:47:23,916 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:47:23,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 21:47:23,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1510559566] [2022-03-15 21:47:23,916 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:23,918 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:23,928 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 164 transitions. [2022-03-15 21:47:23,928 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:24,744 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1729#(and (not (= manager_state 2)) (or (not (= manager_state 3)) (<= manager_back manager_front)) (not (= 5 manager_state)) (or (not (= manager_state 0)) (<= manager_back manager_front)) (or (not (= manager_state 4)) (<= manager_back manager_front)) (not (= manager_state 1)))] [2022-03-15 21:47:24,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:47:24,744 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:24,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:47:24,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:47:24,745 INFO L87 Difference]: Start difference. First operand 107 states and 366 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:24,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:24,763 INFO L93 Difference]: Finished difference Result 56 states and 165 transitions. [2022-03-15 21:47:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:47:24,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:47:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:24,764 INFO L225 Difference]: With dead ends: 56 [2022-03-15 21:47:24,764 INFO L226 Difference]: Without dead ends: 53 [2022-03-15 21:47:24,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:47:24,764 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:24,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 9 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:47:24,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-03-15 21:47:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-03-15 21:47:24,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 3.076923076923077) internal successors, (160), 52 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 21:47:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 160 transitions. [2022-03-15 21:47:24,767 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 160 transitions. Word has length 16 [2022-03-15 21:47:24,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:24,767 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 160 transitions. [2022-03-15 21:47:24,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:24,768 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 160 transitions. [2022-03-15 21:47:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:47:24,768 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:24,768 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:24,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 21:47:24,768 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:24,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:24,769 INFO L85 PathProgramCache]: Analyzing trace with hash -707345940, now seen corresponding path program 2 times [2022-03-15 21:47:24,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:24,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132427262] [2022-03-15 21:47:24,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:24,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:24,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:24,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132427262] [2022-03-15 21:47:24,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132427262] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:24,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716017598] [2022-03-15 21:47:24,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:47:24,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:24,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:24,824 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:47:24,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 21:47:24,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:47:24,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:24,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:47:24,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:24,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:25,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:47:25,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:47:25,168 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:25,169 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 140 treesize of output 140 [2022-03-15 21:47:25,188 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:25,189 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 132 treesize of output 134 [2022-03-15 21:47:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:25,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716017598] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:25,880 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:25,880 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-03-15 21:47:25,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1012386624] [2022-03-15 21:47:25,880 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:25,882 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:25,888 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 107 transitions. [2022-03-15 21:47:25,888 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:25,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:47:25,992 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:47:26,538 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1991#(and (or safe (not (= manager_state 1))) (or (not (= manager_state 3)) (<= manager_back manager_front)) (or (not (= manager_state 0)) (= update (select manager manager_front)) (<= manager_back manager_front)) (or (not (= manager_state 4)) (<= manager_back manager_front)) (or (not (= 5 manager_state)) safe) (or (not (= manager_state 2)) safe))] [2022-03-15 21:47:26,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:47:26,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:26,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:47:26,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-03-15 21:47:26,539 INFO L87 Difference]: Start difference. First operand 53 states and 160 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:26,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:26,639 INFO L93 Difference]: Finished difference Result 131 states and 434 transitions. [2022-03-15 21:47:26,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:47:26,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:47:26,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:26,641 INFO L225 Difference]: With dead ends: 131 [2022-03-15 21:47:26,641 INFO L226 Difference]: Without dead ends: 121 [2022-03-15 21:47:26,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:47:26,642 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:26,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 23 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:47:26,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-03-15 21:47:26,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2022-03-15 21:47:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 3.44) internal successors, (344), 100 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 344 transitions. [2022-03-15 21:47:26,646 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 344 transitions. Word has length 16 [2022-03-15 21:47:26,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:26,647 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 344 transitions. [2022-03-15 21:47:26,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:26,647 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 344 transitions. [2022-03-15 21:47:26,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:47:26,648 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:26,648 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:26,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:26,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:26,867 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:26,868 INFO L85 PathProgramCache]: Analyzing trace with hash -452870195, now seen corresponding path program 3 times [2022-03-15 21:47:26,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:26,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787551053] [2022-03-15 21:47:26,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:26,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:26,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:26,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787551053] [2022-03-15 21:47:26,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787551053] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:26,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713575110] [2022-03-15 21:47:26,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:47:26,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:26,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:26,931 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:47:26,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 21:47:26,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:47:26,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:26,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:47:26,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:27,254 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 21:47:27,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:27,433 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 269 [2022-03-15 21:47:27,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 267 [2022-03-15 21:47:27,741 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:27,754 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 235 treesize of output 229 [2022-03-15 21:47:27,763 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:27,763 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 221 treesize of output 223 [2022-03-15 21:47:28,435 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 21:47:28,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713575110] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:28,435 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:28,436 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-03-15 21:47:28,436 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [884691669] [2022-03-15 21:47:28,436 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:28,438 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:28,446 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 134 transitions. [2022-03-15 21:47:28,446 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:29,058 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:47:29,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:47:29,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:29,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:47:29,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:47:29,059 INFO L87 Difference]: Start difference. First operand 101 states and 344 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:29,128 INFO L93 Difference]: Finished difference Result 150 states and 521 transitions. [2022-03-15 21:47:29,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:47:29,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:47:29,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:29,129 INFO L225 Difference]: With dead ends: 150 [2022-03-15 21:47:29,129 INFO L226 Difference]: Without dead ends: 145 [2022-03-15 21:47:29,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:47:29,130 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:29,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 32 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:47:29,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-03-15 21:47:29,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 117. [2022-03-15 21:47:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 3.7241379310344827) internal successors, (432), 116 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 432 transitions. [2022-03-15 21:47:29,135 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 432 transitions. Word has length 17 [2022-03-15 21:47:29,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:29,135 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 432 transitions. [2022-03-15 21:47:29,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 432 transitions. [2022-03-15 21:47:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:47:29,136 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:29,136 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:29,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:29,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:29,337 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:29,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:29,337 INFO L85 PathProgramCache]: Analyzing trace with hash -210674919, now seen corresponding path program 1 times [2022-03-15 21:47:29,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:29,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976240580] [2022-03-15 21:47:29,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:29,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:29,382 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:29,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976240580] [2022-03-15 21:47:29,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976240580] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:29,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131271498] [2022-03-15 21:47:29,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:29,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:29,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:29,384 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:47:29,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 21:47:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:29,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:47:29,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:29,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:29,793 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:29,793 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 292 treesize of output 286 [2022-03-15 21:47:29,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 257 [2022-03-15 21:47:29,806 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 255 [2022-03-15 21:47:29,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 253 [2022-03-15 21:47:30,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:30,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131271498] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:30,400 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:30,401 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2022-03-15 21:47:30,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [286354371] [2022-03-15 21:47:30,401 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:30,402 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:30,409 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 122 transitions. [2022-03-15 21:47:30,409 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:31,170 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:47:31,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:47:31,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:47:31,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-03-15 21:47:31,746 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2928#(and (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (= update (select node_2 node_2_front))) (or safe (not (= node_2_state 1)))), 2929#(and (or (not (= manager_state 2)) (not (= (select node_2 node_2_back) update)) (not (= node_2_state 0)) (<= (+ node_2_back 1) node_2_front) (= update (select node_2 node_2_front))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 0)) (= update (select node_2 node_2_front))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 3)) (= update (select node_2 node_2_front))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (= update (select node_2 node_2_front)) (not (= manager_state 1))) (or (not (= manager_state 0)) (not (= node_2_state 1))) (or (not (= manager_state 4)) (<= node_2_back node_2_front) (not (= node_2_state 0)) (= update (select node_2 node_2_front))) (or (not (= 5 manager_state)) safe (not (= node_2_state 1))) (or (not (= manager_state 4)) (not (= node_2_state 1))) (or (not (= manager_state 3)) (not (= node_2_state 1))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= 5 manager_state)) (= update (select node_2 node_2_front))) (or (not (= manager_state 2)) (not (= (select node_2 node_2_back) update)) safe (not (= node_2_state 1))) (or safe (not (= node_2_state 1)) (not (= manager_state 1))))] [2022-03-15 21:47:31,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 21:47:31,746 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:31,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 21:47:31,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:47:31,747 INFO L87 Difference]: Start difference. First operand 117 states and 432 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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 21:47:31,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:31,837 INFO L93 Difference]: Finished difference Result 282 states and 1084 transitions. [2022-03-15 21:47:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:47:31,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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 17 [2022-03-15 21:47:31,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:31,839 INFO L225 Difference]: With dead ends: 282 [2022-03-15 21:47:31,839 INFO L226 Difference]: Without dead ends: 272 [2022-03-15 21:47:31,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:47:31,840 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 25 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:31,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 35 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:47:31,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-03-15 21:47:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 180. [2022-03-15 21:47:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 4.206703910614525) internal successors, (753), 179 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 753 transitions. [2022-03-15 21:47:31,847 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 753 transitions. Word has length 17 [2022-03-15 21:47:31,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:31,847 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 753 transitions. [2022-03-15 21:47:31,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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 21:47:31,848 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 753 transitions. [2022-03-15 21:47:31,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:47:31,848 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:31,848 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:31,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:32,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:32,057 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:32,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:32,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1197367549, now seen corresponding path program 1 times [2022-03-15 21:47:32,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:32,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422988324] [2022-03-15 21:47:32,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:32,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:32,121 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:32,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422988324] [2022-03-15 21:47:32,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422988324] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:32,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708697531] [2022-03-15 21:47:32,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:32,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:32,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:32,124 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:47:32,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 21:47:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:32,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:47:32,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:32,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:32,451 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 269 [2022-03-15 21:47:32,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 267 [2022-03-15 21:47:32,462 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:32,463 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 288 treesize of output 282 [2022-03-15 21:47:32,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 253 [2022-03-15 21:47:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:33,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708697531] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:33,069 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:33,069 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-03-15 21:47:33,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1541870321] [2022-03-15 21:47:33,069 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:33,071 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:33,076 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 115 transitions. [2022-03-15 21:47:33,076 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:33,839 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3661#(and (or (not (= manager_state 4)) (and (or (not (= node_1_state 0)) (<= node_1_back node_1_front)) (not (= node_1_state 1)))) (or (not (= manager_state 0)) (and (or (not (= node_1_state 0)) (<= node_1_back node_1_front)) (not (= node_1_state 1)))) (or (not (= manager_state 2)) (and (or (not (= node_1_state 0)) (<= node_1_back node_1_front)) (not (= node_1_state 1)))) (or (not (= manager_state 3)) (and (or (not (= node_1_state 0)) (<= node_1_back node_1_front)) (not (= node_1_state 1)))) (or (and (not (= node_1_state 1)) (or (not (= node_1_state 0)) (<= (+ node_1_back 1) node_1_front))) (not (= manager_state 1))) (or (not (= 5 manager_state)) (and (or (not (= node_1_state 0)) (<= node_1_back node_1_front)) (not (= node_1_state 1))))), 3680#(and (or (not (= node_1_state 0)) (<= node_1_back node_1_front)) (not (= node_1_state 1)))] [2022-03-15 21:47:33,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:47:33,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:33,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:47:33,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:47:33,840 INFO L87 Difference]: Start difference. First operand 180 states and 753 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:33,879 INFO L93 Difference]: Finished difference Result 322 states and 1307 transitions. [2022-03-15 21:47:33,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:47:33,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:47:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:33,882 INFO L225 Difference]: With dead ends: 322 [2022-03-15 21:47:33,882 INFO L226 Difference]: Without dead ends: 320 [2022-03-15 21:47:33,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:47:33,882 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:33,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 17 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:47:33,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-03-15 21:47:33,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 237. [2022-03-15 21:47:33,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 4.27542372881356) internal successors, (1009), 236 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 1009 transitions. [2022-03-15 21:47:33,891 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 1009 transitions. Word has length 17 [2022-03-15 21:47:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:33,891 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 1009 transitions. [2022-03-15 21:47:33,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 1009 transitions. [2022-03-15 21:47:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:47:33,892 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:33,893 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:33,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:34,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:34,108 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:34,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:34,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1154056692, now seen corresponding path program 4 times [2022-03-15 21:47:34,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:34,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094029696] [2022-03-15 21:47:34,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:34,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:47:34,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:34,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094029696] [2022-03-15 21:47:34,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094029696] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:34,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881472765] [2022-03-15 21:47:34,177 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:47:34,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:34,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:34,178 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:47:34,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 21:47:34,209 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:47:34,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:34,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:47:34,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:47:34,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:34,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 269 [2022-03-15 21:47:34,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 267 [2022-03-15 21:47:34,864 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:34,864 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 235 treesize of output 237 [2022-03-15 21:47:34,879 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:34,879 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 229 treesize of output 223 [2022-03-15 21:47:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:47:35,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881472765] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:35,173 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:35,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-03-15 21:47:35,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [152747678] [2022-03-15 21:47:35,173 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:35,175 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:35,186 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 173 transitions. [2022-03-15 21:47:35,186 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:35,746 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:47:35,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 21:47:35,746 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:35,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 21:47:35,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:47:35,747 INFO L87 Difference]: Start difference. First operand 237 states and 1009 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:35,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:35,797 INFO L93 Difference]: Finished difference Result 260 states and 977 transitions. [2022-03-15 21:47:35,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 21:47:35,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:47:35,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:35,799 INFO L225 Difference]: With dead ends: 260 [2022-03-15 21:47:35,799 INFO L226 Difference]: Without dead ends: 254 [2022-03-15 21:47:35,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:47:35,800 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:35,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:47:35,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-03-15 21:47:35,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 231. [2022-03-15 21:47:35,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 3.9521739130434783) internal successors, (909), 230 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 909 transitions. [2022-03-15 21:47:35,810 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 909 transitions. Word has length 18 [2022-03-15 21:47:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:35,810 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 909 transitions. [2022-03-15 21:47:35,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:35,810 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 909 transitions. [2022-03-15 21:47:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:47:35,811 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:35,811 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:35,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:36,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:36,023 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:36,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:36,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1289251188, now seen corresponding path program 5 times [2022-03-15 21:47:36,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:36,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20334364] [2022-03-15 21:47:36,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:36,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:36,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:36,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20334364] [2022-03-15 21:47:36,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20334364] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:36,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717780414] [2022-03-15 21:47:36,149 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:47:36,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:36,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:36,150 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:47:36,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 21:47:36,193 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:47:36,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:36,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:47:36,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:36,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:36,816 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:36,816 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 386 treesize of output 388 [2022-03-15 21:47:36,824 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:36,825 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 380 treesize of output 382 [2022-03-15 21:47:37,410 INFO L353 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-03-15 21:47:37,410 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 188 treesize of output 186 [2022-03-15 21:47:37,425 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:37,425 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 168 treesize of output 166 [2022-03-15 21:47:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:37,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717780414] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:37,971 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:37,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-03-15 21:47:37,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1808900012] [2022-03-15 21:47:37,971 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:37,973 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:37,981 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 147 transitions. [2022-03-15 21:47:37,981 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:38,071 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:47:38,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:47:38,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:47:38,471 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:47:38,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:47:38,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:47:40,464 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [5433#(and (or (<= manager_back manager_front) (not (= manager_state 1))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2))) (or (not (= manager_state 0)) (= update (select manager manager_front)) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (= update (select manager (+ manager_front 1)))) (or (not (= 5 manager_state)) (= update (select manager manager_front)) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 3)))), 5431#(and (or safe (not (= manager_state 1))) (or (not (= manager_state 3)) (<= manager_back manager_front)) (or (not (= manager_state 0)) (= update (select manager manager_front)) (<= manager_back manager_front)) (or (not (= manager_state 4)) (<= manager_back manager_front)) (or (not (= 5 manager_state)) safe) (or (not (= manager_state 2)) safe)), 5432#(and (or safe (not (= manager_state 1))) (or (not (= manager_state 0)) (= update (select manager manager_front)) (<= manager_back manager_front)) (or (not (= manager_state 2)) (<= manager_back manager_front)) (or (not (= 5 manager_state)) (= update (select manager manager_front)) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 3))) (or (not (= manager_state 4)) (<= manager_back manager_front)))] [2022-03-15 21:47:40,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 21:47:40,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:40,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 21:47:40,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:47:40,465 INFO L87 Difference]: Start difference. First operand 231 states and 909 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:40,539 INFO L93 Difference]: Finished difference Result 284 states and 1085 transitions. [2022-03-15 21:47:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:47:40,539 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:47:40,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:40,541 INFO L225 Difference]: With dead ends: 284 [2022-03-15 21:47:40,541 INFO L226 Difference]: Without dead ends: 279 [2022-03-15 21:47:40,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:47:40,542 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 30 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:40,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 49 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:47:40,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-03-15 21:47:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 239. [2022-03-15 21:47:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 3.9831932773109244) internal successors, (948), 238 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 948 transitions. [2022-03-15 21:47:40,550 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 948 transitions. Word has length 18 [2022-03-15 21:47:40,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:40,550 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 948 transitions. [2022-03-15 21:47:40,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 948 transitions. [2022-03-15 21:47:40,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:47:40,551 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:40,551 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:40,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:40,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 21:47:40,763 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:40,764 INFO L85 PathProgramCache]: Analyzing trace with hash 92686562, now seen corresponding path program 2 times [2022-03-15 21:47:40,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:40,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445916710] [2022-03-15 21:47:40,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:40,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:47:40,799 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:40,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445916710] [2022-03-15 21:47:40,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445916710] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:47:40,799 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:47:40,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:47:40,799 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [327642369] [2022-03-15 21:47:40,800 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:40,801 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:40,809 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 113 transitions. [2022-03-15 21:47:40,809 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:42,100 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [6205#(and (or (not (= manager_state 2)) (<= node_2_back node_2_front) (not (= node_2_state 0))) (or (not (= manager_state 2)) (not (= node_2_state 1))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 1))) (or (not (= manager_state 4)) (<= node_2_back node_2_front) (not (= node_2_state 0))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 0))) (or (not (= manager_state 0)) (not (= node_2_state 1))) (or (not (= 5 manager_state)) (not (= node_2_state 1))) (or (not (= manager_state 4)) (not (= node_2_state 1))) (or (not (= manager_state 3)) (not (= node_2_state 1))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= 5 manager_state))) (or (not (= node_2_state 1)) (not (= manager_state 1))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 3)))), 6206#(and (or (not (= manager_state 2)) (not (= node_2_state 1))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 1))) (or (not (= manager_state 4)) (<= node_2_back node_2_front) (not (= node_2_state 0))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 0))) (or (not (= manager_state 0)) (not (= node_2_state 1))) (or (not (= 5 manager_state)) (not (= node_2_state 1))) (or (not (= manager_state 4)) (not (= node_2_state 1))) (or (not (= manager_state 3)) (not (= node_2_state 1))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= 5 manager_state))) (or (not (= node_2_state 1)) (not (= manager_state 1))) (or (not (= manager_state 2)) (not (= node_2_state 0)) (<= (+ node_2_back 1) node_2_front)) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 3)))), 6204#(and (not (= manager_state 2)) (not (= manager_state 4)) (not (= 5 manager_state)) (not (= manager_state 0)) (not (= manager_state 3)) (not (= manager_state 1)))] [2022-03-15 21:47:42,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 21:47:42,100 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:42,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 21:47:42,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:47:42,101 INFO L87 Difference]: Start difference. First operand 239 states and 948 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:42,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:42,177 INFO L93 Difference]: Finished difference Result 282 states and 1075 transitions. [2022-03-15 21:47:42,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 21:47:42,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 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 18 [2022-03-15 21:47:42,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:42,180 INFO L225 Difference]: With dead ends: 282 [2022-03-15 21:47:42,180 INFO L226 Difference]: Without dead ends: 269 [2022-03-15 21:47:42,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:47:42,186 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 54 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:42,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 21 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:47:42,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-03-15 21:47:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 225. [2022-03-15 21:47:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 4.098214285714286) internal successors, (918), 224 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 918 transitions. [2022-03-15 21:47:42,195 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 918 transitions. Word has length 18 [2022-03-15 21:47:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:42,195 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 918 transitions. [2022-03-15 21:47:42,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 918 transitions. [2022-03-15 21:47:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:47:42,196 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:42,197 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:42,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 21:47:42,197 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:47:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:42,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1239138878, now seen corresponding path program 2 times [2022-03-15 21:47:42,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:42,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567076833] [2022-03-15 21:47:42,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:42,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:42,336 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:42,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567076833] [2022-03-15 21:47:42,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567076833] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:42,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56826253] [2022-03-15 21:47:42,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:47:42,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:42,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:42,337 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:47:42,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 21:47:42,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:47:42,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:42,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 21:47:42,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:42,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:42,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:43,457 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:43,457 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 500 treesize of output 504 [2022-03-15 21:47:43,473 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:43,473 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 496 treesize of output 504 [2022-03-15 21:47:45,508 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:45,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 300 treesize of output 464 [2022-03-15 21:47:45,540 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:45,541 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 272 treesize of output 272 [2022-03-15 21:48:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:45,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56826253] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:45,607 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:45,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-03-15 21:48:45,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [42144733] [2022-03-15 21:48:45,608 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:45,609 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:45,617 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 123 transitions. [2022-03-15 21:48:45,617 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:46,162 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:48:46,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-03-15 21:48:46,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:48:46,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-03-15 21:48:46,784 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:48:46,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:48:46,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:48:47,887 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [7058#(and (or (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or safe (not (= node_1_state 1)))), 7059#(and (or (not (= 5 manager_state)) safe (not (= node_1_state 1))) (or (not (= 5 manager_state)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or (not (= manager_state 0)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 4)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 2)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or (not (= manager_state 4)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (= manager_state 3)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 2)) safe (not (= node_1_state 1))) (or (not (= manager_state 3)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or safe (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back))) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= manager_state 0)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (<= manager_back manager_front))), 7060#(and (or (not (= manager_state 0)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (<= (+ node_1_back 1) node_1_front)) (or (not (= 5 manager_state)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 2)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 2)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (= manager_state 4)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= 5 manager_state)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (= manager_state 4)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (= manager_state 0)) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 3)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or safe (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back))) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 3)) (not (= node_1_state 1))))] [2022-03-15 21:48:47,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 21:48:47,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:47,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 21:48:47,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:48:47,888 INFO L87 Difference]: Start difference. First operand 225 states and 918 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:48,026 INFO L93 Difference]: Finished difference Result 570 states and 2408 transitions. [2022-03-15 21:48:48,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:48:48,026 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:48:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:48,030 INFO L225 Difference]: With dead ends: 570 [2022-03-15 21:48:48,030 INFO L226 Difference]: Without dead ends: 554 [2022-03-15 21:48:48,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:48:48,031 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:48,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 63 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:48:48,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-03-15 21:48:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 340. [2022-03-15 21:48:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 4.592920353982301) internal successors, (1557), 339 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1557 transitions. [2022-03-15 21:48:48,042 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1557 transitions. Word has length 18 [2022-03-15 21:48:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:48,042 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 1557 transitions. [2022-03-15 21:48:48,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1557 transitions. [2022-03-15 21:48:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:48:48,043 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:48,043 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:48,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-15 21:48:48,244 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 21:48:48,244 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:48:48,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:48,244 INFO L85 PathProgramCache]: Analyzing trace with hash -778440847, now seen corresponding path program 6 times [2022-03-15 21:48:48,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:48,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932427550] [2022-03-15 21:48:48,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:48,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:48,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:48,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932427550] [2022-03-15 21:48:48,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932427550] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:48,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619876154] [2022-03-15 21:48:48,340 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:48:48,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:48,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:48,341 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:48:48,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 21:48:48,375 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:48:48,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:48,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:48:48,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:48,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-03-15 21:48:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:48:48,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:49,142 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:49,142 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 452 treesize of output 456 [2022-03-15 21:48:49,152 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:49,152 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 448 treesize of output 452 [2022-03-15 21:48:49,752 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:49,753 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 243 treesize of output 237 [2022-03-15 21:48:49,759 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:49,759 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 229 treesize of output 229 [2022-03-15 21:48:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:48:50,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619876154] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:50,289 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:50,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-03-15 21:48:50,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1721657186] [2022-03-15 21:48:50,289 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:50,291 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:50,302 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 181 transitions. [2022-03-15 21:48:50,302 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:51,404 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:48:51,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:48:51,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:51,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:48:51,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:48:51,405 INFO L87 Difference]: Start difference. First operand 340 states and 1557 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:51,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:51,489 INFO L93 Difference]: Finished difference Result 581 states and 2508 transitions. [2022-03-15 21:48:51,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:48:51,490 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:48:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:51,494 INFO L225 Difference]: With dead ends: 581 [2022-03-15 21:48:51,494 INFO L226 Difference]: Without dead ends: 573 [2022-03-15 21:48:51,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:48:51,494 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:51,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 35 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:48:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-03-15 21:48:51,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 381. [2022-03-15 21:48:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 4.660526315789474) internal successors, (1771), 380 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1771 transitions. [2022-03-15 21:48:51,507 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1771 transitions. Word has length 19 [2022-03-15 21:48:51,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:51,508 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 1771 transitions. [2022-03-15 21:48:51,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1771 transitions. [2022-03-15 21:48:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:48:51,509 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:51,509 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:51,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 21:48:51,727 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 21:48:51,727 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:48:51,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:51,728 INFO L85 PathProgramCache]: Analyzing trace with hash -913635343, now seen corresponding path program 7 times [2022-03-15 21:48:51,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:51,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297079137] [2022-03-15 21:48:51,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:51,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:51,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:51,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297079137] [2022-03-15 21:48:51,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297079137] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:51,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129698726] [2022-03-15 21:48:51,818 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:48:51,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:51,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:51,819 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:48:51,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 21:48:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:51,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 21:48:51,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:51,995 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:51,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:52,680 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:52,681 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 420 treesize of output 420 [2022-03-15 21:48:52,690 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:52,690 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 412 treesize of output 412 [2022-03-15 21:48:53,108 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:53,108 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 199 treesize of output 195 [2022-03-15 21:48:53,131 INFO L353 Elim1Store]: treesize reduction 37, result has 39.3 percent of original size [2022-03-15 21:48:53,131 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 187 treesize of output 186 [2022-03-15 21:48:53,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:53,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129698726] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:53,698 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:53,698 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-03-15 21:48:53,698 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [598908524] [2022-03-15 21:48:53,698 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:53,700 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:53,712 INFO L252 McrAutomatonBuilder]: Finished intersection with 77 states and 167 transitions. [2022-03-15 21:48:53,712 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:53,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:48:53,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:48:54,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:48:54,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:48:54,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:48:54,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:48:54,655 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:48:54,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:48:57,209 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [9917#(and (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (= update (select manager (+ manager_front 1)))) (or (= (select manager (+ manager_front 2)) update) (not (= manager_state 3)) (<= manager_back (+ manager_front 2))) (or (not (= 5 manager_state)) (= update (select manager manager_front)) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 0))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 1)))), 9915#(and (or safe (not (= manager_state 1))) (or (not (= manager_state 0)) (= update (select manager manager_front)) (<= manager_back manager_front)) (or (not (= manager_state 2)) (<= manager_back manager_front)) (or (not (= 5 manager_state)) (= update (select manager manager_front)) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 3))) (or (not (= manager_state 4)) (<= manager_back manager_front))), 9916#(and (or (<= manager_back manager_front) (not (= manager_state 1))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2))) (or (not (= manager_state 0)) (= update (select manager manager_front)) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (= update (select manager (+ manager_front 1)))) (or (not (= 5 manager_state)) (= update (select manager manager_front)) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 3)))), 9914#(and (or safe (not (= manager_state 1))) (or (not (= manager_state 3)) (<= manager_back manager_front)) (or (not (= manager_state 0)) (= update (select manager manager_front)) (<= manager_back manager_front)) (or (not (= manager_state 4)) (<= manager_back manager_front)) (or (not (= 5 manager_state)) safe) (or (not (= manager_state 2)) safe))] [2022-03-15 21:48:57,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:48:57,210 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:57,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:48:57,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2022-03-15 21:48:57,210 INFO L87 Difference]: Start difference. First operand 381 states and 1771 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:57,784 INFO L93 Difference]: Finished difference Result 889 states and 3755 transitions. [2022-03-15 21:48:57,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:48:57,785 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:48:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:57,789 INFO L225 Difference]: With dead ends: 889 [2022-03-15 21:48:57,790 INFO L226 Difference]: Without dead ends: 870 [2022-03-15 21:48:57,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=300, Invalid=630, Unknown=0, NotChecked=0, Total=930 [2022-03-15 21:48:57,790 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 116 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:57,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 137 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:48:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2022-03-15 21:48:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 494. [2022-03-15 21:48:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 4.758620689655173) internal successors, (2346), 493 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 2346 transitions. [2022-03-15 21:48:57,811 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 2346 transitions. Word has length 19 [2022-03-15 21:48:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:57,811 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 2346 transitions. [2022-03-15 21:48:57,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 2346 transitions. [2022-03-15 21:48:57,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:48:57,812 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:57,813 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:57,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 21:48:58,027 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 21:48:58,027 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:48:58,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:58,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1126539767, now seen corresponding path program 8 times [2022-03-15 21:48:58,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:58,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750690326] [2022-03-15 21:48:58,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:58,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:48:58,102 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:58,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750690326] [2022-03-15 21:48:58,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750690326] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:58,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492228741] [2022-03-15 21:48:58,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:48:58,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:58,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:58,104 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:48:58,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 21:48:58,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:48:58,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:58,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:48:58,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:58,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-03-15 21:48:58,328 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:48:58,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:58,793 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:58,793 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 452 treesize of output 456 [2022-03-15 21:48:58,802 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:58,802 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 448 treesize of output 452 [2022-03-15 21:48:59,313 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:59,314 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 243 treesize of output 243 [2022-03-15 21:48:59,323 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:59,323 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 235 treesize of output 229 [2022-03-15 21:48:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:48:59,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492228741] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:59,906 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:59,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-03-15 21:48:59,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2069345725] [2022-03-15 21:48:59,906 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:59,907 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:59,916 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 131 transitions. [2022-03-15 21:48:59,916 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:00,627 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11935#(and (not (= manager_state 2)) (not (= manager_state 4)) (not (= 5 manager_state)) (not (= manager_state 0)) (not (= manager_state 3)) (not (= manager_state 1)))] [2022-03-15 21:49:00,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 21:49:00,627 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:00,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 21:49:00,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:49:00,628 INFO L87 Difference]: Start difference. First operand 494 states and 2346 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 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 21:49:00,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:00,683 INFO L93 Difference]: Finished difference Result 477 states and 2122 transitions. [2022-03-15 21:49:00,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:49:00,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 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 19 [2022-03-15 21:49:00,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:00,686 INFO L225 Difference]: With dead ends: 477 [2022-03-15 21:49:00,686 INFO L226 Difference]: Without dead ends: 470 [2022-03-15 21:49:00,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:49:00,686 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:00,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 35 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:49:00,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-03-15 21:49:00,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 452. [2022-03-15 21:49:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 4.580931263858093) internal successors, (2066), 451 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 2066 transitions. [2022-03-15 21:49:00,699 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 2066 transitions. Word has length 19 [2022-03-15 21:49:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:00,699 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 2066 transitions. [2022-03-15 21:49:00,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 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 21:49:00,700 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 2066 transitions. [2022-03-15 21:49:00,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:49:00,701 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:00,701 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:00,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:00,923 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 21:49:00,923 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:49:00,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:00,924 INFO L85 PathProgramCache]: Analyzing trace with hash -829456583, now seen corresponding path program 3 times [2022-03-15 21:49:00,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:00,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548673409] [2022-03-15 21:49:00,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:00,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:01,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:01,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548673409] [2022-03-15 21:49:01,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548673409] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:01,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855082213] [2022-03-15 21:49:01,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:49:01,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:01,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:01,016 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:49:01,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 21:49:01,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:49:01,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:01,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 21:49:01,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:01,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:02,282 INFO L353 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-03-15 21:49:02,283 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 572 treesize of output 554 [2022-03-15 21:49:02,300 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:02,301 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 528 treesize of output 538 [2022-03-15 21:49:02,312 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:02,313 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 514 treesize of output 514 [2022-03-15 21:49:02,325 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:02,325 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 506 treesize of output 506 [2022-03-15 21:49:05,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:05,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855082213] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:05,017 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:05,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-03-15 21:49:05,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2024854720] [2022-03-15 21:49:05,017 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:05,019 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:05,028 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 119 transitions. [2022-03-15 21:49:05,028 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:05,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-03-15 21:49:05,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:06,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:06,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-03-15 21:49:06,348 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:06,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:06,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-03-15 21:49:06,828 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:07,817 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [13445#(and (or (not (= manager_state 4)) (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (not (= node_1_state 0)) (not (= update (select node_1 node_1_back))) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= manager_state 2)) (not (= node_1_state 1))) (or (not (= manager_state 3)) (not (= node_1_state 1))) (or (not (= manager_state 3)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or (not (= manager_state 4)) (not (= node_1_state 1))) (or (not (= manager_state 0)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back))) (<= (+ node_1_back 1) node_1_front)) (or (not (= 5 manager_state)) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (= 5 manager_state)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= update (select node_1 node_1_back)))) (or (not (= manager_state 0)) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (= manager_state 2)) (not (= node_1_state 0)) (<= node_1_back node_1_front))), 13443#(and (or (not (= manager_state 4)) (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (not (= manager_state 0)) (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (not (= 5 manager_state)) safe (not (= node_1_state 1))) (or (not (= 5 manager_state)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or (not (= manager_state 3)) (not (= node_1_state 1))) (or (not (= manager_state 2)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or (not (= manager_state 4)) (not (= node_1_state 1))) (or (not (= manager_state 0)) (not (= node_1_state 1))) (or (not (= manager_state 2)) safe (not (= node_1_state 1))) (or (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or safe (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (not (= manager_state 3)) (not (= node_1_state 0)) (<= node_1_back node_1_front))), 13444#(and (or (not (= 5 manager_state)) (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (not (= manager_state 2)) (not (= node_1_state 1))) (or (not (= manager_state 3)) (not (= node_1_state 1))) (or (not (= manager_state 4)) (not (= node_1_state 1))) (or safe (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (not (= 5 manager_state)) (not (= node_1_state 1))) (or (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back))) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= manager_state 0)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= update (select node_1 node_1_back)))) (or (not (= manager_state 0)) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (= manager_state 2)) (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (not (= manager_state 4)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or (not (= manager_state 3)) (not (= node_1_state 0)) (<= node_1_back node_1_front))), 13442#(and (not (= manager_state 4)) (or safe (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (not (= manager_state 0)) (not (= manager_state 3)) (or (not (= 5 manager_state)) safe) (or (not (= manager_state 2)) safe))] [2022-03-15 21:49:07,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 21:49:07,818 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:07,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 21:49:07,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-03-15 21:49:07,818 INFO L87 Difference]: Start difference. First operand 452 states and 2066 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:07,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:07,943 INFO L93 Difference]: Finished difference Result 491 states and 2193 transitions. [2022-03-15 21:49:07,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 21:49:07,944 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:49:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:07,946 INFO L225 Difference]: With dead ends: 491 [2022-03-15 21:49:07,946 INFO L226 Difference]: Without dead ends: 486 [2022-03-15 21:49:07,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:49:07,947 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 42 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:07,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 63 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:49:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-03-15 21:49:07,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 452. [2022-03-15 21:49:07,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 4.578713968957872) internal successors, (2065), 451 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 2065 transitions. [2022-03-15 21:49:07,959 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 2065 transitions. Word has length 19 [2022-03-15 21:49:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:07,959 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 2065 transitions. [2022-03-15 21:49:07,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 2065 transitions. [2022-03-15 21:49:07,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:49:07,961 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:07,961 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:07,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-15 21:49:08,182 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 21:49:08,183 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:49:08,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:08,183 INFO L85 PathProgramCache]: Analyzing trace with hash -114270926, now seen corresponding path program 9 times [2022-03-15 21:49:08,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:08,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453475766] [2022-03-15 21:49:08,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:08,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:49:08,269 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:08,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453475766] [2022-03-15 21:49:08,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453475766] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:08,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420956031] [2022-03-15 21:49:08,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:49:08,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:08,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:08,271 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:49:08,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 21:49:08,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:49:08,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:08,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:49:08,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:08,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-03-15 21:49:08,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-03-15 21:49:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:49:08,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:09,411 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:09,411 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 482 treesize of output 484 [2022-03-15 21:49:09,420 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:09,421 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 476 treesize of output 478 [2022-03-15 21:49:09,952 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:09,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 245 [2022-03-15 21:49:09,959 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:09,959 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 237 treesize of output 235 [2022-03-15 21:49:10,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:49:10,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420956031] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:10,566 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:10,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-03-15 21:49:10,566 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1751046134] [2022-03-15 21:49:10,566 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:10,568 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:10,579 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 139 transitions. [2022-03-15 21:49:10,579 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:11,519 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [14976#(and (not (= manager_state 2)) (or (not (= manager_state 3)) (<= manager_back manager_front)) (not (= 5 manager_state)) (or (not (= manager_state 0)) (<= manager_back manager_front)) (or (not (= manager_state 4)) (<= manager_back manager_front)) (not (= manager_state 1)))] [2022-03-15 21:49:11,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:49:11,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:11,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:49:11,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:49:11,520 INFO L87 Difference]: Start difference. First operand 452 states and 2065 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:11,598 INFO L93 Difference]: Finished difference Result 566 states and 2342 transitions. [2022-03-15 21:49:11,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:49:11,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:49:11,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:11,602 INFO L225 Difference]: With dead ends: 566 [2022-03-15 21:49:11,602 INFO L226 Difference]: Without dead ends: 556 [2022-03-15 21:49:11,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:49:11,602 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 24 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:11,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 62 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:49:11,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-03-15 21:49:11,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 459. [2022-03-15 21:49:11,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 4.423580786026201) internal successors, (2026), 458 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 2026 transitions. [2022-03-15 21:49:11,615 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 2026 transitions. Word has length 20 [2022-03-15 21:49:11,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:11,615 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 2026 transitions. [2022-03-15 21:49:11,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 2026 transitions. [2022-03-15 21:49:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:49:11,617 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:11,617 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:11,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:11,831 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 21:49:11,831 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:49:11,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:11,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1187179458, now seen corresponding path program 3 times [2022-03-15 21:49:11,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:11,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406751042] [2022-03-15 21:49:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:11,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:12,000 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:12,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406751042] [2022-03-15 21:49:12,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406751042] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:12,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190317359] [2022-03-15 21:49:12,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:49:12,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:12,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:12,001 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:49:12,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 21:49:12,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:49:12,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:12,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 21:49:12,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:12,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:13,994 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:13,994 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 609 treesize of output 607 [2022-03-15 21:49:14,012 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:14,013 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 599 treesize of output 607 [2022-03-15 21:49:15,476 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:15,476 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 409 treesize of output 397 [2022-03-15 21:49:15,524 INFO L353 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2022-03-15 21:49:15,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 389 treesize of output 397 [2022-03-15 21:49:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:21,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190317359] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:21,338 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:21,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 21:49:21,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1882180808] [2022-03-15 21:49:21,338 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:21,340 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:21,353 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 129 transitions. [2022-03-15 21:49:21,353 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:21,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-03-15 21:49:21,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:22,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:22,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:22,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-03-15 21:49:22,836 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:49:22,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:24,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:24,238 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-03-15 21:49:24,255 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:49:24,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:25,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:25,176 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:25,786 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [16596#(and (or safe (not (= manager_state 1))) (or (not (= manager_state 3)) (<= manager_back manager_front)) (or (not (= manager_state 0)) (<= manager_back manager_front)) (or (not (= manager_state 2)) (not (= (select node_2 node_2_back) update)) safe) (or (not (= manager_state 4)) (<= manager_back manager_front)) (or (not (= 5 manager_state)) safe)), 16598#(and (or (not (= manager_state 2)) (not (= (select node_2 node_2_back) update)) (<= (+ manager_back 1) manager_front) (not (= node_2_state 1))) (or (not (= manager_state 2)) (not (= (select node_2 node_2_back) update)) (not (= node_2_state 0)) (<= (+ node_2_back 1) node_2_front) (<= manager_back manager_front)) (or (<= (+ manager_back 1) manager_front) (not (= 5 manager_state)) (not (= node_2_state 1))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= 5 manager_state)) (<= manager_back manager_front)) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 0)) (= update (select node_2 node_2_front)) (<= manager_back manager_front)) (or (not (= manager_state 4)) (<= node_2_back node_2_front) (not (= node_2_state 0)) (= update (select node_2 node_2_front)) (<= manager_back manager_front)) (or (not (= manager_state 4)) (not (= node_2_state 1)) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 3))) (or (<= node_2_back node_2_front) (not (= (select node_2 node_2_back) update)) (not (= node_2_state 0)) (= update (select node_2 node_2_front)) (not (= manager_state 1))) (or (not (= manager_state 3)) (not (= node_2_state 1)) (<= manager_back manager_front)) (or (not (= manager_state 0)) (not (= node_2_state 1)) (<= manager_back manager_front)) (or (not (= (select node_2 node_2_back) update)) safe (not (= node_2_state 1)) (not (= manager_state 1)))), 16599#(and (or (not (= 5 manager_state)) (not (= node_2_state 1)) (<= manager_back manager_front)) (or (not (= (select node_2 node_2_back) update)) (not (= manager_state 0)) (not (= node_2_state 1)) (<= manager_back manager_front)) (or (not (= manager_state 2)) (not (= (select node_2 node_2_back) update)) (not (= node_2_state 1)) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 3)) (not (= node_2_state 1))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= 5 manager_state)) (= update (select node_2 node_2_front)) (<= manager_back manager_front)) (or (not (= (select node_2 node_2_back) update)) (<= (+ manager_back 1) manager_front) (not (= node_2_state 1)) (not (= manager_state 1))) (or (not (= manager_state 4)) (not (= node_2_state 1)) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (<= node_2_back node_2_front) (not (= node_2_state 0))) (or (<= manager_back (+ manager_front 1)) (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 3)) (= update (select node_2 node_2_front))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2)) (not (= (select node_2 node_2_back) update)) (not (= node_2_state 0)) (<= (+ node_2_back 1) node_2_front)) (or (not (= (select node_2 node_2_back) update)) (not (= node_2_state 0)) (<= (+ node_2_back 1) node_2_front) (<= manager_back manager_front) (not (= manager_state 1))) (or (<= node_2_back node_2_front) (not (= (select node_2 node_2_back) update)) (not (= node_2_state 0)) (not (= manager_state 0)) (= update (select node_2 node_2_front)) (<= manager_back manager_front))), 16600#(and (or (<= manager_back (+ manager_front 1)) (not (= (select node_2 node_2_back) update)) (not (= node_2_state 0)) (<= (+ node_2_back 1) node_2_front) (not (= manager_state 0))) (or (not (= (select node_2 node_2_back) update)) (not (= manager_state 0)) (not (= node_2_state 1)) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2)) (not (= (select node_2 node_2_back) update)) (not (= node_2_state 1))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (<= node_2_back node_2_front) (not (= node_2_state 0)) (= update (select node_2 node_2_front))) (or (<= manager_back (+ manager_front 1)) (not (= (select node_2 node_2_back) update)) (not (= node_2_state 0)) (<= (+ node_2_back 1) node_2_front) (not (= manager_state 1))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 3)) (not (= node_2_state 1))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 3)) (<= manager_back (+ manager_front 2))) (or (not (= (select node_2 node_2_back) update)) (not (= 5 manager_state)) (not (= node_2_state 1)) (<= manager_back manager_front)) (or (not (= (select node_2 node_2_back) update)) (not (= node_2_state 1)) (<= manager_back manager_front) (not (= manager_state 1))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2)) (not (= (select node_2 node_2_back) update)) (not (= node_2_state 0)) (<= (+ node_2_back 1) node_2_front) (= update (select node_2 node_2_front))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (not (= node_2_state 1))) (or (<= node_2_back node_2_front) (not (= (select node_2 node_2_back) update)) (not (= node_2_state 0)) (not (= 5 manager_state)) (= update (select node_2 node_2_front)) (<= manager_back manager_front))), 16597#(and (or (not (= manager_state 2)) (<= node_2_back node_2_front) (not (= (select node_2 node_2_back) update)) (not (= node_2_state 0)) (= update (select node_2 node_2_front))) (or (not (= manager_state 4)) (<= (+ manager_back 1) manager_front) (not (= node_2_state 1))) (or (<= (+ manager_back 1) manager_front) (not (= manager_state 0)) (not (= node_2_state 1))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (= update (select node_2 node_2_front)) (not (= manager_state 1))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 3)) (<= manager_back manager_front)) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 0)) (<= manager_back manager_front)) (or (not (= 5 manager_state)) safe (not (= node_2_state 1))) (or (<= (+ manager_back 1) manager_front) (not (= manager_state 3)) (not (= node_2_state 1))) (or (not (= manager_state 4)) (<= node_2_back node_2_front) (not (= node_2_state 0)) (<= manager_back manager_front)) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= 5 manager_state)) (= update (select node_2 node_2_front))) (or (not (= manager_state 2)) (not (= (select node_2 node_2_back) update)) safe (not (= node_2_state 1))) (or safe (not (= node_2_state 1)) (not (= manager_state 1))))] [2022-03-15 21:49:25,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:49:25,787 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:25,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:49:25,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:49:25,787 INFO L87 Difference]: Start difference. First operand 459 states and 2026 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:27,746 INFO L93 Difference]: Finished difference Result 836 states and 3327 transitions. [2022-03-15 21:49:27,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 21:49:27,747 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:49:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:27,750 INFO L225 Difference]: With dead ends: 836 [2022-03-15 21:49:27,750 INFO L226 Difference]: Without dead ends: 824 [2022-03-15 21:49:27,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=387, Invalid=1019, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 21:49:27,751 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 192 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:27,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 125 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:49:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2022-03-15 21:49:27,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 492. [2022-03-15 21:49:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 4.5030549898167) internal successors, (2211), 491 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 2211 transitions. [2022-03-15 21:49:27,766 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 2211 transitions. Word has length 20 [2022-03-15 21:49:27,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:27,767 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 2211 transitions. [2022-03-15 21:49:27,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:27,767 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 2211 transitions. [2022-03-15 21:49:27,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:49:27,769 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:27,769 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:27,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:27,978 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 21:49:27,979 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:49:27,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:27,979 INFO L85 PathProgramCache]: Analyzing trace with hash 648195298, now seen corresponding path program 4 times [2022-03-15 21:49:27,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:27,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467592479] [2022-03-15 21:49:27,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:27,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:28,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:28,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467592479] [2022-03-15 21:49:28,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467592479] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:28,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028035177] [2022-03-15 21:49:28,046 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:49:28,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:28,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:28,047 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:49:28,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 21:49:28,088 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:49:28,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:28,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:49:28,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:28,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:29,054 INFO L353 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-03-15 21:49:29,054 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 570 treesize of output 528 [2022-03-15 21:49:29,064 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:29,064 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 510 treesize of output 514 [2022-03-15 21:49:29,074 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:29,074 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 506 treesize of output 510 [2022-03-15 21:49:29,084 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:29,084 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 502 treesize of output 506 [2022-03-15 21:49:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:30,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028035177] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:30,438 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:30,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-03-15 21:49:30,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [709838106] [2022-03-15 21:49:30,438 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:30,439 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:30,451 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 187 transitions. [2022-03-15 21:49:30,451 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:32,725 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [18577#(and (or (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (<= node_1_back node_1_front) (not (= node_1_state 1)))), 18578#(and (or (<= node_1_back (+ node_1_front 1)) (not (= node_1_state 0))) (or (<= node_1_back node_1_front) (not (= node_1_state 1)))), 18579#(and (or (not (= manager_state 4)) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (= manager_state 0)) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (= manager_state 4)) (<= node_1_back (+ node_1_front 1)) (not (= node_1_state 0))) (or (<= node_1_back (+ node_1_front 1)) (not (= 5 manager_state)) (not (= node_1_state 0))) (or (not (= manager_state 2)) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (= manager_state 2)) (<= node_1_back (+ node_1_front 1)) (not (= node_1_state 0))) (or (<= node_1_back (+ node_1_front 1)) (not (= manager_state 3)) (not (= node_1_state 0))) (or (not (= node_1_state 0)) (<= node_1_back node_1_front) (not (= manager_state 1))) (or (<= node_1_back (+ node_1_front 1)) (not (= manager_state 0)) (not (= node_1_state 0))) (or (not (= node_1_state 1)) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= 5 manager_state)) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (= manager_state 3)) (<= node_1_back node_1_front) (not (= node_1_state 1)))), 18576#(and (or (not (= node_1_state 0)) (<= node_1_back node_1_front)) (not (= node_1_state 1))), 18557#(and (or (not (= manager_state 4)) (and (or (<= node_1_back (+ node_1_front 1)) (not (= node_1_state 0))) (or (not (< node_1_front node_1_back)) (not (= node_1_state 1))))) (or (and (or (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 1)))) (not (= manager_state 0))) (or (and (or (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 1)))) (not (= manager_state 1))) (or (not (= 5 manager_state)) (and (or (<= node_1_back (+ node_1_front 1)) (not (= node_1_state 0))) (or (not (< node_1_front node_1_back)) (not (= node_1_state 1))))) (or (not (= manager_state 3)) (and (or (<= node_1_back (+ node_1_front 1)) (not (= node_1_state 0))) (or (not (< node_1_front node_1_back)) (not (= node_1_state 1))))) (or (not (= manager_state 2)) (and (or (<= node_1_back (+ node_1_front 1)) (not (= node_1_state 0))) (or (not (< node_1_front node_1_back)) (not (= node_1_state 1))))))] [2022-03-15 21:49:32,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:49:32,725 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:32,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:49:32,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:49:32,725 INFO L87 Difference]: Start difference. First operand 492 states and 2211 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:32,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:32,994 INFO L93 Difference]: Finished difference Result 1860 states and 8140 transitions. [2022-03-15 21:49:32,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 21:49:32,994 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:49:32,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:33,005 INFO L225 Difference]: With dead ends: 1860 [2022-03-15 21:49:33,006 INFO L226 Difference]: Without dead ends: 1824 [2022-03-15 21:49:33,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=456, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:49:33,006 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 145 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:33,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 64 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:49:33,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2022-03-15 21:49:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 852. [2022-03-15 21:49:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 5.039952996474736) internal successors, (4289), 851 states have internal predecessors, (4289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 4289 transitions. [2022-03-15 21:49:33,033 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 4289 transitions. Word has length 20 [2022-03-15 21:49:33,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:33,033 INFO L470 AbstractCegarLoop]: Abstraction has 852 states and 4289 transitions. [2022-03-15 21:49:33,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 4289 transitions. [2022-03-15 21:49:33,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:49:33,036 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:33,037 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:33,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:33,251 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 21:49:33,251 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:49:33,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:33,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1554956610, now seen corresponding path program 5 times [2022-03-15 21:49:33,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:33,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876533090] [2022-03-15 21:49:33,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:33,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:33,402 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:33,402 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876533090] [2022-03-15 21:49:33,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876533090] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:33,402 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854027736] [2022-03-15 21:49:33,402 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:49:33,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:33,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:33,403 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:49:33,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 21:49:33,436 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:49:33,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:33,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 21:49:33,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:33,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:34,910 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:34,910 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 515 treesize of output 513 [2022-03-15 21:49:34,919 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:34,920 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 505 treesize of output 503 [2022-03-15 21:49:35,554 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:35,554 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 276 treesize of output 270 [2022-03-15 21:49:35,564 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:35,564 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 256 [2022-03-15 21:49:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:36,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854027736] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:36,213 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:36,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 21:49:36,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [219301213] [2022-03-15 21:49:36,213 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:36,215 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:36,225 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 127 transitions. [2022-03-15 21:49:36,225 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:36,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-03-15 21:49:36,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:37,593 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:37,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-03-15 21:49:37,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:38,868 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:38,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-03-15 21:49:38,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:39,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:39,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:40,454 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [22289#(and (or (not (= manager_state 3)) (<= manager_back manager_front)) (or safe (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or (not (= manager_state 0)) (<= manager_back manager_front)) (or (not (= manager_state 4)) (<= manager_back manager_front)) (or (not (= 5 manager_state)) safe) (or (not (= manager_state 2)) safe)), 22292#(and (or (not (= node_1_state 0)) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= manager_state 0)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (<= (+ node_1_back 1) node_1_front)) (or (not (= 5 manager_state)) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (= manager_state 2)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 4)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= 5 manager_state)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (not (= manager_state 0)) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 3)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or (<= (+ manager_back 1) manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2)) (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 3)) (not (= node_1_state 1)))), 22293#(and (or (not (= 5 manager_state)) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 0)) (not (= node_1_state 0)) (not (= update (select node_1 node_1_back))) (<= (+ node_1_back 1) node_1_front)) (or (<= manager_back (+ manager_front 1)) (not (= node_1_state 0)) (not (= update (select node_1 node_1_back))) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= update (select node_1 node_1_back)))) (or (not (= manager_state 0)) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (= manager_state 3)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back (+ manager_front 2))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2)) (not (= node_1_state 1))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or (not (= 5 manager_state)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (<= (+ node_1_back 1) node_1_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 3)) (not (= node_1_state 1))) (or (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1)))), 22291#(and (or (not (= manager_state 2)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (<= (+ manager_back 1) manager_front) (not (= 5 manager_state)) (not (= node_1_state 1))) (or (not (= manager_state 2)) (<= (+ manager_back 1) manager_front) (not (= node_1_state 1))) (or (not (= 5 manager_state)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (= manager_state 4)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 4)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 3)) (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (not (= manager_state 3)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 0)) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (= manager_state 0)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or safe (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back))) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front))), 22290#(and (or (not (= manager_state 4)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (= manager_state 4)) (<= (+ manager_back 1) manager_front) (not (= node_1_state 1))) (or (not (= 5 manager_state)) safe (not (= node_1_state 1))) (or (not (= 5 manager_state)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or (not (= manager_state 0)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (= manager_state 3)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (<= (+ manager_back 1) manager_front) (not (= manager_state 0)) (not (= node_1_state 1))) (or (not (= manager_state 2)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or (not (= manager_state 2)) safe (not (= node_1_state 1))) (or (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or safe (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (<= (+ manager_back 1) manager_front) (not (= manager_state 3)) (not (= node_1_state 1))))] [2022-03-15 21:49:40,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:49:40,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:40,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:49:40,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:49:40,455 INFO L87 Difference]: Start difference. First operand 852 states and 4289 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:42,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:42,663 INFO L93 Difference]: Finished difference Result 1356 states and 6159 transitions. [2022-03-15 21:49:42,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 21:49:42,663 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:49:42,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:42,670 INFO L225 Difference]: With dead ends: 1356 [2022-03-15 21:49:42,670 INFO L226 Difference]: Without dead ends: 1344 [2022-03-15 21:49:42,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=338, Invalid=1068, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 21:49:42,671 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 200 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:42,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 147 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:49:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2022-03-15 21:49:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 901. [2022-03-15 21:49:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 5.1033333333333335) internal successors, (4593), 900 states have internal predecessors, (4593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 4593 transitions. [2022-03-15 21:49:42,696 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 4593 transitions. Word has length 20 [2022-03-15 21:49:42,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:42,696 INFO L470 AbstractCegarLoop]: Abstraction has 901 states and 4593 transitions. [2022-03-15 21:49:42,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 4593 transitions. [2022-03-15 21:49:42,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:49:42,699 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:42,700 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:42,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:42,921 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 21:49:42,921 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:49:42,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:42,922 INFO L85 PathProgramCache]: Analyzing trace with hash 514137764, now seen corresponding path program 6 times [2022-03-15 21:49:42,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:42,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374558083] [2022-03-15 21:49:42,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:42,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:43,010 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:43,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374558083] [2022-03-15 21:49:43,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374558083] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:43,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172208594] [2022-03-15 21:49:43,011 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:49:43,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:43,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:43,012 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:49:43,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 21:49:43,042 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:49:43,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:43,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 21:49:43,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:43,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-03-15 21:49:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:43,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:45,075 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-15 21:49:45,075 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 637 treesize of output 627 [2022-03-15 21:49:45,085 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:45,085 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 611 treesize of output 611 [2022-03-15 21:49:46,264 INFO L353 Elim1Store]: treesize reduction 10, result has 81.8 percent of original size [2022-03-15 21:49:46,264 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 382 treesize of output 390 [2022-03-15 21:49:46,273 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:46,274 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 346 treesize of output 342 [2022-03-15 21:49:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:50,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172208594] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:50,575 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:50,575 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2022-03-15 21:49:50,575 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1672892574] [2022-03-15 21:49:50,575 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:50,577 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:50,587 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 139 transitions. [2022-03-15 21:49:50,587 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:51,122 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:51,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:51,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-03-15 21:49:51,179 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 21:49:52,482 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:52,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:53,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:53,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:49:54,033 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [25611#(and (or (not (= 5 manager_state)) safe (not (= node_1_state 1))) (or (not (= 5 manager_state)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or (not (= manager_state 3)) (not (= node_1_state 1))) (or (not (= manager_state 0)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or (not (= manager_state 3)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or (not (= manager_state 2)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or (not (= manager_state 4)) (not (= node_1_state 1))) (or (not (= manager_state 0)) (not (= node_1_state 1))) (or (not (= manager_state 2)) safe (not (= node_1_state 1))) (or safe (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back))) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= manager_state 4)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front))), 25612#(and (or (not (= manager_state 4)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (not (= 5 manager_state)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update)) (or (not (= manager_state 4)) (not (< node_1_front node_1_back)) (not (= node_1_state 0))) (or (not (< node_1_front node_1_back)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or (not (= manager_state 2)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (not (= manager_state 3)) (not (= node_1_state 0))) (or (not (= manager_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (= manager_state 2)) (not (< node_1_front node_1_back)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update)) (or (not (< node_1_front node_1_back)) (not (= manager_state 0)) (not (= node_1_state 0))) (or (not (= 5 manager_state)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (= manager_state 3)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front))), 25614#(and (or (not (= manager_state 4)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (= manager_state 4)) (not (< node_1_front node_1_back)) (not (= node_1_state 0))) (or (not (= manager_state 0)) (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back)))) (or (not (= manager_state 2)) (not (< node_1_front node_1_back)) (not (= node_1_state 0))) (or (not (= manager_state 2)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (not (= 5 manager_state)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back)))) (or (not (= manager_state 0)) (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 0)) (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or (not (= manager_state 3)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (not (= manager_state 3)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update)) (or (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= 5 manager_state)) (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (<= (+ node_1_back 1) node_1_front))), 25610#(and (or (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or safe (not (= node_1_state 1)))), 25613#(and (or (not (= manager_state 4)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (= manager_state 2)) (not (< node_1_front node_1_back)) (not (= node_1_state 0))) (or (not (= manager_state 2)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (not (= manager_state 3)) (not (= node_1_state 0))) (or (not (< node_1_front node_1_back)) (not (= manager_state 0)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back)))) (or (not (= manager_state 0)) (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= 5 manager_state)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (= manager_state 4)) (not (< node_1_front node_1_back)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update)) (or (not (= manager_state 3)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (< node_1_front node_1_back)) (not (= 5 manager_state)) (not (= node_1_state 0))) (or (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back))) (not (= manager_state 1))))] [2022-03-15 21:49:54,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:49:54,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:54,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:49:54,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-03-15 21:49:54,034 INFO L87 Difference]: Start difference. First operand 901 states and 4593 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:54,531 INFO L93 Difference]: Finished difference Result 1294 states and 5987 transitions. [2022-03-15 21:49:54,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 21:49:54,531 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:49:54,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:54,539 INFO L225 Difference]: With dead ends: 1294 [2022-03-15 21:49:54,539 INFO L226 Difference]: Without dead ends: 1277 [2022-03-15 21:49:54,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:49:54,540 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 110 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:54,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 137 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:49:54,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2022-03-15 21:49:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 941. [2022-03-15 21:49:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 940 states have (on average 5.134042553191489) internal successors, (4826), 940 states have internal predecessors, (4826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:54,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 4826 transitions. [2022-03-15 21:49:54,567 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 4826 transitions. Word has length 20 [2022-03-15 21:49:54,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:54,567 INFO L470 AbstractCegarLoop]: Abstraction has 941 states and 4826 transitions. [2022-03-15 21:49:54,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:54,567 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 4826 transitions. [2022-03-15 21:49:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:49:54,570 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:54,570 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:54,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:54,783 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 21:49:54,783 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:49:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:54,784 INFO L85 PathProgramCache]: Analyzing trace with hash -460865022, now seen corresponding path program 7 times [2022-03-15 21:49:54,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:54,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695476731] [2022-03-15 21:49:54,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:54,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:54,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:54,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695476731] [2022-03-15 21:49:54,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695476731] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:54,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893243730] [2022-03-15 21:49:54,962 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:49:54,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:54,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:54,964 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:49:54,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 21:49:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:55,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 21:49:55,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:55,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:56,792 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:56,792 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 636 treesize of output 632 [2022-03-15 21:49:56,810 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:56,811 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 624 treesize of output 634 [2022-03-15 21:49:58,658 INFO L353 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2022-03-15 21:49:58,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 416 treesize of output 416 [2022-03-15 21:49:58,670 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:58,670 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 360 treesize of output 348 [2022-03-15 21:50:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:02,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893243730] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:02,184 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:02,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 21:50:02,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1098968766] [2022-03-15 21:50:02,185 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:02,186 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:02,197 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 139 transitions. [2022-03-15 21:50:02,197 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:02,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-03-15 21:50:02,306 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:02,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:02,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-03-15 21:50:05,140 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:05,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-03-15 21:50:05,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:05,622 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:05,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:06,648 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [28934#(and (or (not (= manager_state 2)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (= manager_state 4)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (<= (+ manager_back 1) manager_front) (not (= 5 manager_state)) (not (= node_1_state 1))) (or (not (= manager_state 4)) (<= (+ manager_back 1) manager_front) (not (= node_1_state 1))) (or (not (= manager_state 2)) (<= (+ manager_back 1) manager_front) (not (= node_1_state 1))) (or (not (= 5 manager_state)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (= manager_state 0)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 3)) (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (not (= manager_state 3)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (<= (+ manager_back 1) manager_front) (not (= manager_state 0)) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or safe (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1)))), 28933#(and (or safe (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or (not (= manager_state 0)) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (not (= 5 manager_state)) (<= manager_back manager_front)) (or (not (= manager_state 2)) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 3))) (or (not (= manager_state 4)) (<= manager_back manager_front))), 28936#(and (or (not (= 5 manager_state)) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (= manager_state 2)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 0)) (not (= node_1_state 0)) (not (= update (select node_1 node_1_back))) (<= (+ node_1_back 1) node_1_front)) (or (not (= 5 manager_state)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (<= manager_back (+ manager_front 1)) (not (= node_1_state 0)) (not (= update (select node_1 node_1_back))) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= manager_state 0)) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (= manager_state 4)) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (= manager_state 3)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back (+ manager_front 2))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2)) (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (not (= update (select node_1 node_1_back)))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 3)) (not (= node_1_state 1))) (or (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1)))), 28932#(and (or (not (= manager_state 3)) (<= manager_back manager_front)) (or safe (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or (not (= manager_state 0)) (<= manager_back manager_front)) (or (not (= manager_state 4)) (<= manager_back manager_front)) (or (not (= 5 manager_state)) safe) (or (not (= manager_state 2)) safe)), 28935#(and (or (not (= node_1_state 0)) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (<= (+ manager_back 1) manager_front) (not (= 5 manager_state)) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (= manager_state 2)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 4)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 3)) (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (not (= manager_state 3)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 0)) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (<= (+ manager_back 1) manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (not (= manager_state 0)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2)) (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (not (= 5 manager_state)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))))] [2022-03-15 21:50:06,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:50:06,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:06,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:50:06,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:50:06,649 INFO L87 Difference]: Start difference. First operand 941 states and 4826 transitions. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:08,185 INFO L93 Difference]: Finished difference Result 1462 states and 6846 transitions. [2022-03-15 21:50:08,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 21:50:08,185 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:50:08,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:08,195 INFO L225 Difference]: With dead ends: 1462 [2022-03-15 21:50:08,195 INFO L226 Difference]: Without dead ends: 1448 [2022-03-15 21:50:08,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=364, Invalid=968, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:50:08,196 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 147 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:08,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 147 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:50:08,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2022-03-15 21:50:08,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1014. [2022-03-15 21:50:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 5.185587364264561) internal successors, (5253), 1013 states have internal predecessors, (5253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 5253 transitions. [2022-03-15 21:50:08,222 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 5253 transitions. Word has length 20 [2022-03-15 21:50:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:08,223 INFO L470 AbstractCegarLoop]: Abstraction has 1014 states and 5253 transitions. [2022-03-15 21:50:08,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 5253 transitions. [2022-03-15 21:50:08,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:50:08,226 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:08,226 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:08,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 21:50:08,448 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 21:50:08,448 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:50:08,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:08,449 INFO L85 PathProgramCache]: Analyzing trace with hash -512152103, now seen corresponding path program 4 times [2022-03-15 21:50:08,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:08,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93870672] [2022-03-15 21:50:08,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:08,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:08,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:08,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93870672] [2022-03-15 21:50:08,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93870672] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:08,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351652115] [2022-03-15 21:50:08,588 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:50:08,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:08,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:08,589 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:50:08,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 21:50:08,633 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:50:08,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:08,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:50:08,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:08,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-03-15 21:50:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:09,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:10,190 INFO L353 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-03-15 21:50:10,190 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 598 treesize of output 538 [2022-03-15 21:50:10,199 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:50:10,199 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 538 treesize of output 540 [2022-03-15 21:50:10,208 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:50:10,209 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 532 treesize of output 534 [2022-03-15 21:50:10,229 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:50:10,229 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 526 treesize of output 528 [2022-03-15 21:50:11,414 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:11,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351652115] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:11,415 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:11,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-03-15 21:50:11,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1244573599] [2022-03-15 21:50:11,415 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:11,417 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:11,433 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 212 transitions. [2022-03-15 21:50:11,433 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:15,189 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [32592#(and (or (not (= node_2_state 0)) (<= node_2_back (+ node_2_front 1))) (or (<= node_2_back node_2_front) (not (= node_2_state 1)))), 32594#(and (or (not (= manager_state 2)) (<= node_2_back node_2_front) (not (= node_2_state 0)) (<= manager_back manager_front)) (or (not (= node_2_state 0)) (<= node_2_back (+ node_2_front 1)) (not (= 5 manager_state)) (<= manager_back manager_front)) (or (<= (+ node_2_back 1) node_2_front) (not (= node_2_state 1)) (not (= manager_state 1))) (or (not (= manager_state 4)) (not (= node_2_state 0)) (<= node_2_back (+ node_2_front 1)) (<= manager_back manager_front)) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 1))) (or (<= manager_back (+ manager_front 1)) (<= node_2_back node_2_front) (not (= manager_state 3)) (not (= node_2_state 1))) (or (not (= node_2_state 0)) (<= node_2_back (+ node_2_front 1)) (not (= manager_state 0)) (<= manager_back manager_front)) (or (not (= manager_state 2)) (<= (+ node_2_back 1) node_2_front) (not (= node_2_state 1)) (<= manager_back manager_front)) (or (not (= manager_state 4)) (<= node_2_back node_2_front) (not (= node_2_state 1)) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (= node_2_state 0)) (<= node_2_back (+ node_2_front 1)) (not (= manager_state 3))) (or (<= node_2_back node_2_front) (not (= manager_state 0)) (not (= node_2_state 1)) (<= manager_back manager_front)) (or (<= node_2_back node_2_front) (not (= 5 manager_state)) (not (= node_2_state 1)) (<= manager_back manager_front))), 32591#(and (or (<= node_2_back node_2_front) (not (= node_2_state 0))) (or (<= node_2_back node_2_front) (not (= node_2_state 1)))), 32590#(and (not (= node_2_state 1)) (or (<= node_2_back node_2_front) (not (= node_2_state 0)))), 32593#(and (or (<= node_2_back node_2_front) (not (= manager_state 3)) (not (= node_2_state 1)) (<= manager_back manager_front)) (or (not (= manager_state 4)) (not (= node_2_state 0)) (<= node_2_back (+ node_2_front 1)) (<= manager_back manager_front)) (or (not (= manager_state 2)) (<= node_2_back node_2_front) (not (= node_2_state 0))) (or (not (= node_2_state 0)) (<= node_2_back (+ node_2_front 1)) (not (= 5 manager_state))) (or (not (= node_2_state 0)) (<= node_2_back (+ node_2_front 1)) (not (= manager_state 1))) (or (not (= node_2_state 0)) (<= node_2_back (+ node_2_front 1)) (not (= manager_state 0)) (<= manager_back manager_front)) (or (<= node_2_back node_2_front) (not (= 5 manager_state)) (not (= node_2_state 1))) (or (<= node_2_back node_2_front) (not (= node_2_state 1)) (not (= manager_state 1))) (or (not (= manager_state 2)) (<= (+ node_2_back 1) node_2_front) (not (= node_2_state 1))) (or (not (= manager_state 4)) (<= node_2_back node_2_front) (not (= node_2_state 1)) (<= manager_back manager_front)) (or (<= node_2_back node_2_front) (not (= manager_state 0)) (not (= node_2_state 1)) (<= manager_back manager_front)) (or (not (= node_2_state 0)) (<= node_2_back (+ node_2_front 1)) (not (= manager_state 3)) (<= manager_back manager_front))), 32595#(and (or (not (= node_2_state 0)) (<= node_2_back (+ node_2_front 1)) (not (= 5 manager_state)) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (<= node_2_back node_2_front) (not (= manager_state 3)) (not (= node_2_state 1))) (or (<= (+ node_2_back 1) node_2_front) (not (= manager_state 0)) (not (= node_2_state 1)) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (<= node_2_back node_2_front) (not (= node_2_state 1))) (or (<= manager_back (+ manager_front 1)) (not (= node_2_state 0)) (<= node_2_back (+ node_2_front 1)) (not (= manager_state 3))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2)) (<= node_2_back node_2_front) (not (= node_2_state 0))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2)) (<= (+ node_2_back 1) node_2_front) (not (= node_2_state 1))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (<= manager_back manager_front) (not (= manager_state 1))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 0)) (<= manager_back manager_front)) (or (<= node_2_back node_2_front) (not (= 5 manager_state)) (not (= node_2_state 1)) (<= manager_back manager_front)) (or (<= (+ node_2_back 1) node_2_front) (not (= node_2_state 1)) (<= manager_back manager_front) (not (= manager_state 1))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (not (= node_2_state 0)) (<= node_2_back (+ node_2_front 1))))] [2022-03-15 21:50:15,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 21:50:15,189 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:15,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 21:50:15,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=488, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:50:15,190 INFO L87 Difference]: Start difference. First operand 1014 states and 5253 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:15,724 INFO L93 Difference]: Finished difference Result 4340 states and 21620 transitions. [2022-03-15 21:50:15,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:50:15,725 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:50:15,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:15,742 INFO L225 Difference]: With dead ends: 4340 [2022-03-15 21:50:15,742 INFO L226 Difference]: Without dead ends: 4270 [2022-03-15 21:50:15,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:50:15,743 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 276 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:15,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 78 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:50:15,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4270 states. [2022-03-15 21:50:15,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4270 to 2175. [2022-03-15 21:50:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2175 states, 2174 states have (on average 5.6936522539098435) internal successors, (12378), 2174 states have internal predecessors, (12378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2175 states to 2175 states and 12378 transitions. [2022-03-15 21:50:15,824 INFO L78 Accepts]: Start accepts. Automaton has 2175 states and 12378 transitions. Word has length 21 [2022-03-15 21:50:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:15,825 INFO L470 AbstractCegarLoop]: Abstraction has 2175 states and 12378 transitions. [2022-03-15 21:50:15,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:15,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2175 states and 12378 transitions. [2022-03-15 21:50:15,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:50:15,831 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:15,831 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:15,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 21:50:16,055 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 21:50:16,055 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:50:16,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:16,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1501213213, now seen corresponding path program 5 times [2022-03-15 21:50:16,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:16,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426859442] [2022-03-15 21:50:16,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:16,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:16,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:16,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426859442] [2022-03-15 21:50:16,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426859442] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:16,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17487477] [2022-03-15 21:50:16,232 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:50:16,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:16,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:16,235 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:50:16,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 21:50:16,268 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:50:16,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:16,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 21:50:16,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:16,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:18,631 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:50:18,632 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 667 treesize of output 665 [2022-03-15 21:50:18,653 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-15 21:50:18,653 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 657 treesize of output 651 [2022-03-15 21:50:19,801 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:50:19,801 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 408 treesize of output 402 [2022-03-15 21:50:19,838 INFO L353 Elim1Store]: treesize reduction 12, result has 80.3 percent of original size [2022-03-15 21:50:19,838 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 394 treesize of output 392 [2022-03-15 21:50:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:22,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17487477] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:22,603 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:22,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 21:50:22,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [862860635] [2022-03-15 21:50:22,603 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:22,605 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:22,618 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 137 transitions. [2022-03-15 21:50:22,619 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:22,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:25,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:25,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:25,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:25,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:27,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:27,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:28,207 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [41443#(and (or (not (= 5 manager_state)) safe (not (= node_2_state 1)) (not (= ok (select manager manager_back)))) (or (not (= manager_state 2)) safe (not (= node_2_state 1)) (not (= ok (select manager manager_back)))) (or (not (= manager_state 2)) (<= node_2_back node_2_front) (not (= node_2_state 0))) (or (not (= manager_state 4)) (<= node_2_back node_2_front) (not (= node_2_state 0)) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 1))) (or safe (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (not (= manager_state 1))) (or (not (= manager_state 4)) (<= (+ manager_back 1) manager_front) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (= ok (select manager manager_front))) (or (<= (+ manager_back 1) manager_front) (not (= manager_state 3)) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (= ok (select manager manager_front))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 3)) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= manager_state 0)) (<= manager_back manager_front)) (or (<= node_2_back node_2_front) (not (= node_2_state 0)) (not (= 5 manager_state))) (or (<= (+ manager_back 1) manager_front) (not (= manager_state 0)) (not (= node_2_state 1)) (not (= ok (select manager manager_back))))), 41445#(and (or (not (= manager_state 4)) (not (= node_2_state 0)) (not (< node_2_front node_2_back)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (<= node_2_back node_2_front) (not (= manager_state 0)) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (<= node_2_back node_2_front) (<= (+ manager_back 1) manager_front) (not (= 5 manager_state)) (not (= node_2_state 1)) (not (= ok (select manager manager_back)))) (or (not (= node_2_state 0)) (not (< node_2_front node_2_back)) (not (= ok (select manager manager_back))) (not (= manager_state 1))) (or (not (= manager_state 2)) (<= (+ node_2_back 1) node_2_front) (<= (+ manager_back 1) manager_front) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (= ok (select manager manager_front))) (or (not (= manager_state 4)) (<= node_2_back node_2_front) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (<= node_2_back node_2_front) (= (select manager (+ manager_front 1)) ok) (not (= manager_state 3)) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (not (= manager_state 2)) (not (= node_2_state 0)) (<= (+ manager_back 1) manager_front) (not (< node_2_front (+ node_2_back 1))) (not (= ok (select manager manager_back))) (= ok (select manager manager_front))) (or (<= node_2_back node_2_front) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (not (= manager_state 1))) (or (not (= node_2_state 0)) (not (< node_2_front node_2_back)) (not (= manager_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (not (= node_2_state 0)) (= (select manager (+ manager_front 1)) ok) (not (< node_2_front node_2_back)) (not (= manager_state 3)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (not (= node_2_state 0)) (<= (+ manager_back 1) manager_front) (not (< node_2_front node_2_back)) (not (= 5 manager_state)) (not (= ok (select manager manager_back))))), 41447#(and (or (<= node_2_back node_2_front) (not (= 5 manager_state)) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (not (= node_2_state 0)) (= (select manager (+ manager_front 1)) ok) (not (< node_2_front (+ node_2_back 1))) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= manager_state 1))) (or (<= (+ node_2_back 1) node_2_front) (= (select manager (+ manager_front 1)) ok) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= manager_state 1))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (<= node_2_back node_2_front) (not (= node_2_state 1)) (not (= ok (select manager manager_back)))) (or (<= manager_back (+ manager_front 1)) (<= node_2_back node_2_front) (not (= manager_state 3)) (not (= node_2_state 1)) (not (= ok (select manager manager_back)))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (not (= node_2_state 0)) (not (< node_2_front node_2_back)) (not (= ok (select manager manager_back)))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2)) (not (= node_2_state 0)) (not (< node_2_front (+ node_2_back 1))) (not (= ok (select manager manager_back)))) (or (<= manager_back (+ manager_front 1)) (not (= node_2_state 0)) (not (< node_2_front node_2_back)) (not (= manager_state 3)) (not (= ok (select manager manager_back)))) (or (not (= node_2_state 0)) (= (select manager (+ manager_front 1)) ok) (not (= manager_state 0)) (not (< node_2_front (+ node_2_back 1))) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (not (= node_2_state 0)) (not (< node_2_front node_2_back)) (not (= 5 manager_state)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (<= (+ node_2_back 1) node_2_front) (= (select manager (+ manager_front 1)) ok) (not (= manager_state 0)) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2)) (<= (+ node_2_back 1) node_2_front) (not (= node_2_state 1)) (not (= ok (select manager manager_back))))), 41446#(and (or (<= node_2_back node_2_front) (not (= 5 manager_state)) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (not (= manager_state 2)) (<= (+ node_2_back 1) node_2_front) (= (select manager (+ manager_front 1)) ok) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (not (= manager_state 4)) (not (= node_2_state 0)) (not (< node_2_front node_2_back)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (<= node_2_back node_2_front) (not (= manager_state 0)) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (<= node_2_back node_2_front) (not (= manager_state 3)) (not (= node_2_state 1)) (not (= ok (select manager manager_back)))) (or (not (= manager_state 2)) (not (= node_2_state 0)) (= (select manager (+ manager_front 1)) ok) (not (< node_2_front (+ node_2_back 1))) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (= node_2_state 0)) (not (< node_2_front node_2_back)) (not (= manager_state 3)) (not (= ok (select manager manager_back)))) (or (not (= node_2_state 0)) (<= (+ manager_back 1) manager_front) (not (< node_2_front (+ node_2_back 1))) (not (= ok (select manager manager_back))) (= ok (select manager manager_front)) (not (= manager_state 1))) (or (not (= node_2_state 0)) (not (< node_2_front node_2_back)) (not (= 5 manager_state)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (not (= manager_state 4)) (<= node_2_back node_2_front) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (<= (+ node_2_back 1) node_2_front) (<= (+ manager_back 1) manager_front) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (= ok (select manager manager_front)) (not (= manager_state 1))) (or (not (= node_2_state 0)) (not (< node_2_front node_2_back)) (not (= manager_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front))), 41442#(and (or safe (not (= manager_state 1))) (or (not (= manager_state 3)) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (not (= manager_state 0)) (<= manager_back manager_front)) (or (not (= manager_state 4)) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (not (= 5 manager_state)) safe) (or (not (= manager_state 2)) safe)), 41444#(and (or (not (= manager_state 4)) (not (= node_2_state 0)) (<= (+ manager_back 1) manager_front) (not (< node_2_front node_2_back)) (not (= ok (select manager manager_back))) (= ok (select manager manager_front))) (or (not (= node_2_state 0)) (<= (+ manager_back 1) manager_front) (not (< node_2_front node_2_back)) (not (= manager_state 0)) (not (= ok (select manager manager_back)))) (or (not (= manager_state 4)) (<= node_2_back node_2_front) (<= (+ manager_back 1) manager_front) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (= ok (select manager manager_front))) (or (not (= node_2_state 0)) (<= (+ manager_back 1) manager_front) (not (< node_2_front node_2_back)) (not (= manager_state 3)) (not (= ok (select manager manager_back))) (= ok (select manager manager_front))) (or (not (= node_2_state 0)) (not (< node_2_front node_2_back)) (not (= ok (select manager manager_back))) (not (= manager_state 1))) (or (<= node_2_back node_2_front) (<= (+ manager_back 1) manager_front) (not (= manager_state 0)) (not (= node_2_state 1)) (not (= ok (select manager manager_back)))) (or (not (= node_2_state 0)) (not (< node_2_front node_2_back)) (not (= 5 manager_state)) (not (= ok (select manager manager_back)))) (or (<= node_2_back node_2_front) (<= (+ manager_back 1) manager_front) (not (= manager_state 3)) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (= ok (select manager manager_front))) (or (not (= manager_state 2)) (not (= node_2_state 0)) (not (< node_2_front node_2_back)) (not (= ok (select manager manager_back)))) (or (<= node_2_back node_2_front) (not (= 5 manager_state)) (not (= node_2_state 1)) (not (= ok (select manager manager_back)))) (or (<= node_2_back node_2_front) (not (= node_2_state 1)) (not (= ok (select manager manager_back))) (not (= manager_state 1))) (or (not (= manager_state 2)) (<= node_2_back node_2_front) (not (= node_2_state 1)) (not (= ok (select manager manager_back)))))] [2022-03-15 21:50:28,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:50:28,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:28,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:50:28,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=634, Unknown=0, NotChecked=0, Total=870 [2022-03-15 21:50:28,209 INFO L87 Difference]: Start difference. First operand 2175 states and 12378 transitions. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:31,555 INFO L93 Difference]: Finished difference Result 2764 states and 14584 transitions. [2022-03-15 21:50:31,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 21:50:31,556 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:50:31,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:31,567 INFO L225 Difference]: With dead ends: 2764 [2022-03-15 21:50:31,568 INFO L226 Difference]: Without dead ends: 2742 [2022-03-15 21:50:31,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=546, Invalid=1434, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:50:31,569 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 220 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:31,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 218 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:50:31,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2022-03-15 21:50:31,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2237. [2022-03-15 21:50:31,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 2236 states have (on average 5.681127012522361) internal successors, (12703), 2236 states have internal predecessors, (12703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 12703 transitions. [2022-03-15 21:50:31,633 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 12703 transitions. Word has length 21 [2022-03-15 21:50:31,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:31,633 INFO L470 AbstractCegarLoop]: Abstraction has 2237 states and 12703 transitions. [2022-03-15 21:50:31,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:31,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 12703 transitions. [2022-03-15 21:50:31,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:50:31,640 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:31,640 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:31,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 21:50:31,862 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 21:50:31,862 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:50:31,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:31,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1869556389, now seen corresponding path program 8 times [2022-03-15 21:50:31,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:31,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111540249] [2022-03-15 21:50:31,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:31,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:32,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:32,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111540249] [2022-03-15 21:50:32,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111540249] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:32,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620033843] [2022-03-15 21:50:32,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:50:32,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:32,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:32,024 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:50:32,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 21:50:32,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:50:32,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:32,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 21:50:32,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:32,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:34,372 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:50:34,373 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 667 treesize of output 665 [2022-03-15 21:50:34,396 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-15 21:50:34,396 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 657 treesize of output 651 [2022-03-15 21:50:35,616 INFO L353 Elim1Store]: treesize reduction 12, result has 80.3 percent of original size [2022-03-15 21:50:35,617 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 411 treesize of output 409 [2022-03-15 21:50:35,626 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:50:35,626 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 361 treesize of output 355 [2022-03-15 21:50:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:40,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620033843] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:40,188 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:40,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 21:50:40,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2108030550] [2022-03-15 21:50:40,189 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:40,192 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:40,205 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 135 transitions. [2022-03-15 21:50:40,205 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:40,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:40,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:43,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:43,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:43,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:43,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:44,289 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:44,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:44,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:44,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:45,739 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:45,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:45,852 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:45,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:50:46,662 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [48861#(and (or (not (= manager_state 3)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (not (= manager_state 4)) (<= (+ manager_back 1) manager_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1)) (= ok (select manager manager_front))) (or (not (= 5 manager_state)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or safe (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (not (= manager_state 0)) (= update (select manager manager_front)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (= manager_state 2)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or (not (= manager_state 2)) safe (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (not (= 5 manager_state)) safe (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (<= (+ manager_back 1) manager_front) (not (= manager_state 0)) (= update (select manager manager_front)) (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or (not (= manager_state 4)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (<= (+ manager_back 1) manager_front) (not (= manager_state 3)) (not (= ok (select manager manager_back))) (not (= node_1_state 1)) (= ok (select manager manager_front)))), 48863#(and (or (not (= manager_state 4)) (not (< node_1_front node_1_back)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (not (= manager_state 2)) (not (< node_1_front node_1_back)) (<= (+ manager_back 1) manager_front) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (= ok (select manager manager_front))) (or (not (= manager_state 2)) (<= (+ manager_back 1) manager_front) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1)) (= ok (select manager manager_front))) (or (<= (+ manager_back 1) manager_front) (not (= 5 manager_state)) (= update (select manager manager_front)) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (not (= manager_state 4)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (= (select manager (+ manager_front 1)) ok) (not (= manager_state 3)) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= manager_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or (= (select manager (+ manager_front 1)) ok) (not (= manager_state 3)) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (<= (+ manager_back 1) manager_front) (not (= 5 manager_state)) (= update (select manager manager_front)) (not (= node_1_state 0)) (not (= ok (select manager manager_back)))) (or (not (< node_1_front node_1_back)) (not (= manager_state 0)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))))), 48860#(and (or safe (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or (not (= manager_state 0)) (= update (select manager manager_front)) (<= manager_back manager_front)) (or (not (= manager_state 3)) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (not (= manager_state 4)) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (not (= 5 manager_state)) safe) (or (not (= manager_state 2)) safe)), 48864#(and (or (not (= 5 manager_state)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (= manager_state 4)) (= update (select manager (+ manager_front 1))) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (not (= 5 manager_state)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (<= (+ manager_back 1) manager_front) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (= ok (select manager manager_front)) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= manager_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (<= manager_back (+ manager_front 1)) (not (< node_1_front node_1_back)) (not (= manager_state 3)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back)))) (or (not (= manager_state 4)) (not (< node_1_front node_1_back)) (= update (select manager (+ manager_front 1))) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 3)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (<= (+ manager_back 1) manager_front) (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (= ok (select manager manager_front)) (not (= manager_state 1))) (or (not (= manager_state 2)) (not (< node_1_front node_1_back)) (= (select manager (+ manager_front 1)) ok) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (not (= manager_state 0)) (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (not (= manager_state 2)) (= (select manager (+ manager_front 1)) ok) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= node_1_state 1)))), 48865#(and (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (= (select manager (+ manager_front 1)) ok) (not (= manager_state 0)) (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (<= manager_back (+ manager_front 1)) (= (select manager (+ manager_front 2)) update) (not (= manager_state 3)) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (= (select manager (+ manager_front 1)) ok) (not (= manager_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= 5 manager_state)) (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (not (< node_1_front node_1_back)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back)))) (or (not (= 5 manager_state)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2)) (not (< node_1_front node_1_back)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back)))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (= (select manager (+ manager_front 1)) ok) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (<= manager_back (+ manager_front 1)) (= (select manager (+ manager_front 2)) update) (not (< node_1_front node_1_back)) (not (= manager_state 3)) (not (= node_1_state 0)) (not (= ok (select manager manager_back)))) (or (= (select manager (+ manager_front 1)) ok) (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= manager_state 1)))), 48862#(and (or (not (< node_1_front node_1_back)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (not (< node_1_front node_1_back)) (<= (+ manager_back 1) manager_front) (not (= manager_state 0)) (= update (select manager manager_front)) (not (= node_1_state 0)) (not (= ok (select manager manager_back)))) (or (not (= manager_state 2)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (not (= manager_state 2)) (not (< node_1_front node_1_back)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back)))) (or (not (= 5 manager_state)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (not (= manager_state 4)) (<= (+ manager_back 1) manager_front) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1)) (= ok (select manager manager_front))) (or (not (< node_1_front node_1_back)) (not (= 5 manager_state)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back)))) (or (<= (+ manager_back 1) manager_front) (not (= manager_state 3)) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1)) (= ok (select manager manager_front))) (or (<= (+ manager_back 1) manager_front) (not (= manager_state 0)) (= update (select manager manager_front)) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (not (= manager_state 4)) (not (< node_1_front node_1_back)) (<= (+ manager_back 1) manager_front) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (= ok (select manager manager_front))) (or (not (< node_1_front node_1_back)) (<= (+ manager_back 1) manager_front) (not (= manager_state 3)) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (= ok (select manager manager_front))))] [2022-03-15 21:50:46,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:50:46,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:46,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:50:46,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=633, Unknown=0, NotChecked=0, Total=870 [2022-03-15 21:50:46,663 INFO L87 Difference]: Start difference. First operand 2237 states and 12703 transitions. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:51,478 INFO L93 Difference]: Finished difference Result 2841 states and 14988 transitions. [2022-03-15 21:50:51,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 21:50:51,479 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:50:51,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:51,491 INFO L225 Difference]: With dead ends: 2841 [2022-03-15 21:50:51,491 INFO L226 Difference]: Without dead ends: 2820 [2022-03-15 21:50:51,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=569, Invalid=1411, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:50:51,492 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 227 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:51,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 236 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:50:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2022-03-15 21:50:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2291. [2022-03-15 21:50:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2291 states, 2290 states have (on average 5.678602620087336) internal successors, (13004), 2290 states have internal predecessors, (13004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 13004 transitions. [2022-03-15 21:50:51,561 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 13004 transitions. Word has length 21 [2022-03-15 21:50:51,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:51,561 INFO L470 AbstractCegarLoop]: Abstraction has 2291 states and 13004 transitions. [2022-03-15 21:50:51,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 13004 transitions. [2022-03-15 21:50:51,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:50:51,568 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:51,568 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:51,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 21:50:51,787 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 21:50:51,787 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:50:51,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:51,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1982511767, now seen corresponding path program 9 times [2022-03-15 21:50:51,789 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:51,789 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260639722] [2022-03-15 21:50:51,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:51,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:51,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:51,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260639722] [2022-03-15 21:50:51,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260639722] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:51,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450068222] [2022-03-15 21:50:51,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:50:51,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:51,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:51,960 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:50:51,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 21:50:51,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 21:50:51,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:51,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 21:50:51,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:52,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:54,504 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-15 21:50:54,504 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 696 treesize of output 692 [2022-03-15 21:50:54,514 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:50:54,515 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 676 treesize of output 672 [2022-03-15 21:50:55,946 INFO L353 Elim1Store]: treesize reduction 12, result has 80.3 percent of original size [2022-03-15 21:50:55,946 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 437 treesize of output 427 [2022-03-15 21:50:55,956 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:50:55,956 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 379 treesize of output 371 [2022-03-15 21:51:02,682 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:02,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450068222] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:02,682 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:02,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 21:51:02,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [736532532] [2022-03-15 21:51:02,682 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:02,684 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:02,697 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 135 transitions. [2022-03-15 21:51:02,697 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:02,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:02,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:04,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:04,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:04,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:04,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:06,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:06,560 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:06,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:06,632 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:08,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:08,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:08,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:08,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:09,353 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [56463#(and (or safe (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or (not (= manager_state 0)) (= update (select manager manager_front)) (<= manager_back manager_front)) (or (not (= manager_state 3)) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (not (= manager_state 4)) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (not (= 5 manager_state)) safe) (or (not (= manager_state 2)) safe)), 56464#(and (or (not (= manager_state 3)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (not (= manager_state 4)) (<= (+ manager_back 1) manager_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1)) (= ok (select manager manager_front))) (or (not (= 5 manager_state)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or safe (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (not (= manager_state 0)) (= update (select manager manager_front)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (= manager_state 2)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front)) (or (not (= manager_state 2)) safe (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (not (= 5 manager_state)) safe (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (<= (+ manager_back 1) manager_front) (not (= manager_state 0)) (= update (select manager manager_front)) (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or (not (= manager_state 4)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (<= (+ manager_back 1) manager_front) (not (= manager_state 3)) (not (= ok (select manager manager_back))) (not (= node_1_state 1)) (= ok (select manager manager_front)))), 56468#(and (or (= (select manager (+ manager_front 1)) ok) (not (= manager_state 0)) (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 2)) (not (< node_1_front node_1_back)) (= (select manager (+ manager_front 1)) ok) (not (= node_1_state 0)) (not (= ok (select manager manager_back)))) (or (<= manager_back (+ manager_front 1)) (not (= manager_state 4)) (not (< node_1_front node_1_back)) (= update (select manager (+ manager_front 1))) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back)))) (or (not (= manager_state 2)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= node_1_state 1))) (or (<= manager_back (+ manager_front 1)) (= (select manager (+ manager_front 2)) update) (not (= manager_state 3)) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (not (= 5 manager_state)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (= (select manager (+ manager_front 1)) ok) (not (= manager_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= 5 manager_state)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= manager_state 4)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (= (select manager (+ manager_front 1)) ok) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (<= manager_back (+ manager_front 1)) (= (select manager (+ manager_front 2)) update) (not (< node_1_front node_1_back)) (not (= manager_state 3)) (not (= node_1_state 0)) (not (= ok (select manager manager_back)))) (or (= (select manager (+ manager_front 1)) ok) (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= manager_state 1)))), 56466#(and (or (not (< node_1_front node_1_back)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or (<= (+ manager_back 1) manager_front) (not (= manager_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (= manager_state 2)) (not (< node_1_front node_1_back)) (<= (+ manager_back 1) manager_front) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (= ok (select manager manager_front))) (or (not (= manager_state 2)) (<= (+ manager_back 1) manager_front) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1)) (= ok (select manager manager_front))) (or (<= (+ manager_back 1) manager_front) (not (= 5 manager_state)) (= update (select manager manager_front)) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (= (select manager (+ manager_front 1)) ok) (not (= manager_state 3)) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= manager_state 4)) (not (< node_1_front node_1_back)) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (not (< node_1_front node_1_back)) (not (= manager_state 0)) (= update (select manager manager_front)) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (not (= manager_state 4)) (<= (+ manager_back 1) manager_front) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (= (select manager (+ manager_front 1)) ok) (not (= manager_state 3)) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (<= (+ manager_back 1) manager_front) (not (= 5 manager_state)) (= update (select manager manager_front)) (not (= node_1_state 0)) (not (= ok (select manager manager_back))))), 56467#(and (or (<= manager_back (+ manager_front 1)) (not (< node_1_front node_1_back)) (= (select manager (+ manager_front 1)) ok) (not (= manager_state 3)) (not (= node_1_state 0)) (not (= ok (select manager manager_back)))) (or (<= (+ manager_back 1) manager_front) (not (= 5 manager_state)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (= manager_state 3)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (not (= 5 manager_state)) (= update (select manager manager_front)) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (not (= manager_state 4)) (= update (select manager (+ manager_front 1))) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= node_1_state 1))) (or (<= (+ manager_back 1) manager_front) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (= ok (select manager manager_front)) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= manager_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= manager_state 4)) (not (< node_1_front node_1_back)) (= update (select manager (+ manager_front 1))) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (<= (+ manager_back 1) manager_front) (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (= ok (select manager manager_front)) (not (= manager_state 1))) (or (not (= manager_state 2)) (not (< node_1_front node_1_back)) (= (select manager (+ manager_front 1)) ok) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (not (< node_1_front node_1_back)) (not (= manager_state 0)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (not (= manager_state 2)) (= (select manager (+ manager_front 1)) ok) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= node_1_state 1)))), 56465#(and (or safe (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (<= manager_back (+ manager_front 1)) (= (select manager (+ manager_front 1)) ok) (not (= manager_state 3)) (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (not (= manager_state 4)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= node_1_state 1)) (= ok (select manager manager_front))) (or (<= (+ manager_back 1) manager_front) (not (= 5 manager_state)) (= update (select manager manager_front)) (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (not (= manager_state 4)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (= (select manager (+ manager_front 1)) ok) (not (= manager_state 3)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 2)) (<= (+ manager_back 1) manager_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1)) (= ok (select manager manager_front))) (or (not (= 5 manager_state)) (= update (select manager manager_front)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (= manager_state 0)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= update (select node_1 node_1_back))) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= manager_state 2)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (not (= manager_state 0)) (= update (select manager manager_front)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))))] [2022-03-15 21:51:09,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:51:09,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:09,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:51:09,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2022-03-15 21:51:09,354 INFO L87 Difference]: Start difference. First operand 2291 states and 13004 transitions. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:14,384 INFO L93 Difference]: Finished difference Result 2905 states and 15382 transitions. [2022-03-15 21:51:14,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 21:51:14,385 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:51:14,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:14,394 INFO L225 Difference]: With dead ends: 2905 [2022-03-15 21:51:14,394 INFO L226 Difference]: Without dead ends: 2876 [2022-03-15 21:51:14,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=560, Invalid=1420, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:51:14,395 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 208 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:14,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 241 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:51:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2022-03-15 21:51:14,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 2348. [2022-03-15 21:51:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2348 states, 2347 states have (on average 5.666808691947167) internal successors, (13300), 2347 states have internal predecessors, (13300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 13300 transitions. [2022-03-15 21:51:14,466 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 13300 transitions. Word has length 21 [2022-03-15 21:51:14,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:14,466 INFO L470 AbstractCegarLoop]: Abstraction has 2348 states and 13300 transitions. [2022-03-15 21:51:14,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 13300 transitions. [2022-03-15 21:51:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:51:14,473 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:14,473 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:14,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 21:51:14,687 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 21:51:14,687 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:51:14,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:14,688 INFO L85 PathProgramCache]: Analyzing trace with hash -243361155, now seen corresponding path program 10 times [2022-03-15 21:51:14,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:14,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249089967] [2022-03-15 21:51:14,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:14,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:14,808 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:14,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249089967] [2022-03-15 21:51:14,808 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249089967] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:14,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445438305] [2022-03-15 21:51:14,808 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:51:14,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:14,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:14,809 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:51:14,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 21:51:14,848 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:51:14,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:14,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 21:51:14,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:15,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-03-15 21:51:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:15,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:17,165 INFO L353 Elim1Store]: treesize reduction 62, result has 36.1 percent of original size [2022-03-15 21:51:17,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 703 treesize of output 669 [2022-03-15 21:51:17,177 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:17,177 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 635 treesize of output 635 [2022-03-15 21:51:17,188 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:17,189 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 627 treesize of output 627 [2022-03-15 21:51:17,227 INFO L353 Elim1Store]: treesize reduction 18, result has 67.3 percent of original size [2022-03-15 21:51:17,227 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 619 treesize of output 617 [2022-03-15 21:51:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:21,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445438305] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:21,469 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:21,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-03-15 21:51:21,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1761613704] [2022-03-15 21:51:21,469 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:21,471 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:21,483 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 147 transitions. [2022-03-15 21:51:21,483 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:25,111 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [64243#(and (or (not (= manager_state 4)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (= 5 manager_state)) (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (not (= node_1_state 1)) (not (= manager_state 1))) (or (not (= manager_state 0)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (= manager_state 2)) (not (= node_1_state 1))) (or (not (= manager_state 3)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (= manager_state 0)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 4)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 3)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= node_1_state 0)) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= 5 manager_state)) (not (= node_1_state 1))) (or (not (= manager_state 2)) (not (= node_1_state 0)) (<= node_1_back node_1_front))), 64247#(and (or (not (= manager_state 4)) (<= node_1_back (+ node_1_front 1)) (not (= node_1_state 0)) (<= manager_back manager_front)) (or (not (= 5 manager_state)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (= manager_state 0)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (<= manager_back (+ manager_front 1)) (not (< node_1_front node_1_back)) (not (= manager_state 3)) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (not (= 5 manager_state)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 2)) (not (< node_1_front node_1_back)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 0)) (not (< node_1_front (+ node_1_back 1))) (<= manager_back manager_front) (not (= node_1_state 1))) (or (<= manager_back (+ manager_front 1)) (<= node_1_back (+ node_1_front 1)) (not (= manager_state 3)) (not (= node_1_state 0))) (or (<= (+ manager_back 1) manager_front) (not (= node_1_state 0)) (<= node_1_back node_1_front) (not (= manager_state 1))) (or (not (= manager_state 4)) (not (< node_1_front node_1_back)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (<= (+ manager_back 1) manager_front) (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (not (= manager_state 2)) (<= node_1_back (+ node_1_front 1)) (not (= node_1_state 0)) (<= manager_back manager_front))), 64244#(and (or (not (= manager_state 2)) (not (< node_1_front node_1_back)) (not (= node_1_state 0))) (or (not (= manager_state 2)) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (= manager_state 4)) (not (< node_1_front node_1_back)) (not (= node_1_state 0)) (<= manager_back manager_front)) (or (not (< node_1_front node_1_back)) (not (= manager_state 0)) (not (= node_1_state 0)) (<= manager_back manager_front)) (or (<= (+ manager_back 1) manager_front) (not (= manager_state 0)) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (= node_1_state 1)) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (< node_1_front node_1_back)) (not (= manager_state 3)) (not (= node_1_state 0)) (<= manager_back manager_front)) (or (not (< node_1_front node_1_back)) (not (= node_1_state 0)) (not (= manager_state 1))) (or (not (= 5 manager_state)) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (<= (+ manager_back 1) manager_front) (not (= manager_state 3)) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (= manager_state 4)) (<= (+ manager_back 1) manager_front) (<= node_1_back node_1_front) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (not (= 5 manager_state)) (not (= node_1_state 0)))), 64245#(and (or (<= (+ manager_back 1) manager_front) (<= node_1_back (+ node_1_front 1)) (not (= manager_state 0)) (not (= node_1_state 0))) (or (not (< node_1_front node_1_back)) (<= (+ manager_back 1) manager_front) (not (= manager_state 3)) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (not (= 5 manager_state)) (not (= node_1_state 1))) (or (<= node_1_back (+ node_1_front 1)) (not (= 5 manager_state)) (not (= node_1_state 0))) (or (not (= manager_state 2)) (<= node_1_back (+ node_1_front 1)) (not (= node_1_state 0))) (or (not (= node_1_state 0)) (<= node_1_back node_1_front) (not (= manager_state 1))) (or (not (< node_1_front node_1_back)) (<= (+ manager_back 1) manager_front) (not (= manager_state 0)) (not (= node_1_state 1))) (or (not (= manager_state 4)) (not (< node_1_front node_1_back)) (<= (+ manager_back 1) manager_front) (not (= node_1_state 1))) (or (not (= manager_state 2)) (not (< node_1_front node_1_back)) (not (= node_1_state 1))) (or (<= (+ manager_back 1) manager_front) (<= node_1_back (+ node_1_front 1)) (not (= manager_state 3)) (not (= node_1_state 0))) (or (not (< node_1_front node_1_back)) (not (= node_1_state 1)) (not (= manager_state 1))) (or (not (= manager_state 4)) (<= (+ manager_back 1) manager_front) (<= node_1_back (+ node_1_front 1)) (not (= node_1_state 0)))), 64246#(and (or (not (< node_1_front node_1_back)) (<= (+ manager_back 1) manager_front) (not (= 5 manager_state)) (not (= node_1_state 1))) (or (not (= manager_state 4)) (<= node_1_back (+ node_1_front 1)) (not (= node_1_state 0)) (<= manager_back manager_front)) (or (<= (+ manager_back 1) manager_front) (<= node_1_back (+ node_1_front 1)) (not (= 5 manager_state)) (not (= node_1_state 0))) (or (not (= manager_state 0)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (< node_1_front node_1_back)) (not (= manager_state 3)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 2)) (<= (+ manager_back 1) manager_front) (<= node_1_back (+ node_1_front 1)) (not (= node_1_state 0))) (or (not (= node_1_state 0)) (<= node_1_back node_1_front) (not (= manager_state 1))) (or (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (not (= manager_state 4)) (not (< node_1_front node_1_back)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (not (= manager_state 0)) (<= manager_back manager_front) (not (= node_1_state 1))) (or (<= node_1_back (+ node_1_front 1)) (not (= manager_state 3)) (not (= node_1_state 0)) (<= manager_back manager_front)) (or (not (= manager_state 2)) (not (< node_1_front node_1_back)) (<= (+ manager_back 1) manager_front) (not (= node_1_state 1)))), 64242#(and (or (not (= node_1_state 0)) (<= node_1_back node_1_front)) (not (= node_1_state 1)))] [2022-03-15 21:51:25,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 21:51:25,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:25,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 21:51:25,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:51:25,112 INFO L87 Difference]: Start difference. First operand 2348 states and 13300 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:26,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:26,341 INFO L93 Difference]: Finished difference Result 4252 states and 22403 transitions. [2022-03-15 21:51:26,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 21:51:26,342 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 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 21 [2022-03-15 21:51:26,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:26,353 INFO L225 Difference]: With dead ends: 4252 [2022-03-15 21:51:26,354 INFO L226 Difference]: Without dead ends: 4224 [2022-03-15 21:51:26,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=361, Invalid=829, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:51:26,355 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 125 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:26,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 136 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:51:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4224 states. [2022-03-15 21:51:26,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4224 to 2749. [2022-03-15 21:51:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2749 states, 2748 states have (on average 5.793668122270742) internal successors, (15921), 2748 states have internal predecessors, (15921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 15921 transitions. [2022-03-15 21:51:26,436 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 15921 transitions. Word has length 21 [2022-03-15 21:51:26,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:26,436 INFO L470 AbstractCegarLoop]: Abstraction has 2749 states and 15921 transitions. [2022-03-15 21:51:26,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:26,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 15921 transitions. [2022-03-15 21:51:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:51:26,445 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:26,445 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:26,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-03-15 21:51:26,650 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 21:51:26,650 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:51:26,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:26,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1218363941, now seen corresponding path program 11 times [2022-03-15 21:51:26,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:26,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742703170] [2022-03-15 21:51:26,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:26,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:26,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:26,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742703170] [2022-03-15 21:51:26,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742703170] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:26,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394503691] [2022-03-15 21:51:26,838 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:51:26,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:26,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:26,839 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:51:26,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 21:51:26,875 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:51:26,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:26,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 21:51:26,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:27,138 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:27,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:29,005 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-15 21:51:29,005 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 695 treesize of output 695 [2022-03-15 21:51:29,016 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:29,016 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 679 treesize of output 675 [2022-03-15 21:51:30,439 INFO L353 Elim1Store]: treesize reduction 12, result has 80.3 percent of original size [2022-03-15 21:51:30,440 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 442 treesize of output 424 [2022-03-15 21:51:30,454 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:30,455 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 376 treesize of output 368 [2022-03-15 21:51:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:39,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394503691] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:39,598 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:39,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 21:51:39,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [68065583] [2022-03-15 21:51:39,598 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:39,600 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:39,612 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 147 transitions. [2022-03-15 21:51:39,612 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:39,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:39,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:40,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:40,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:42,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:42,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:42,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:42,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:42,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:42,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:42,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:42,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 21:51:46,576 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [74156#(and (or safe (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or (not (= manager_state 0)) (= update (select manager manager_front)) (<= manager_back manager_front)) (or (not (= manager_state 3)) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (not (= manager_state 4)) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (not (= 5 manager_state)) safe) (or (not (= manager_state 2)) safe)), 74161#(and (or (= (select manager (+ manager_front 1)) ok) (not (= manager_state 0)) (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (not (= 5 manager_state)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (<= manager_back (+ manager_front 1)) (= (select manager (+ manager_front 2)) update) (not (= manager_state 3)) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (not (= 5 manager_state)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (= (select manager (+ manager_front 1)) ok) (not (= manager_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= manager_state 4)) (not (< node_1_front node_1_back)) (= update (select manager (+ manager_front 1))) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (not (= manager_state 4)) (= update (select manager (+ manager_front 1))) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (= (select manager (+ manager_front 1)) ok) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (<= manager_back (+ manager_front 1)) (= (select manager (+ manager_front 2)) update) (not (< node_1_front node_1_back)) (not (= manager_state 3)) (not (= node_1_state 0)) (not (= ok (select manager manager_back)))) (or (not (= manager_state 2)) (not (< node_1_front node_1_back)) (= (select manager (+ manager_front 1)) ok) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (= (select manager (+ manager_front 1)) ok) (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or (not (= manager_state 2)) (= (select manager (+ manager_front 1)) ok) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= node_1_state 1)))), 74157#(and (or safe (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or (not (= manager_state 0)) (= update (select manager manager_front)) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (<= manager_back (+ manager_front 1)) (= (select manager (+ manager_front 1)) ok) (not (= manager_state 3))) (or (not (= 5 manager_state)) (= update (select manager manager_front)) (<= manager_back manager_front)) (or (not (= manager_state 4)) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (not (= manager_state 2)) (<= manager_back manager_front) (= ok (select manager manager_front)))), 74160#(and (or (<= (+ manager_back 1) manager_front) (not (= 5 manager_state)) (= update (select manager manager_front)) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (<= (+ manager_back 1) manager_front) (not (= 5 manager_state)) (= update (select manager manager_front)) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back)))) (or (not (< node_1_front node_1_back)) (= (select manager (+ manager_front 1)) ok) (not (= manager_state 3)) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (not (= manager_state 4)) (= update (select manager (+ manager_front 1))) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= node_1_state 1))) (or (<= (+ manager_back 1) manager_front) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (= ok (select manager manager_front)) (not (= manager_state 1)) (<= (+ node_1_back 1) node_1_front)) (or (not (= manager_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (= (select manager (+ manager_front 1)) ok) (not (= manager_state 3)) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 4)) (not (< node_1_front node_1_back)) (= update (select manager (+ manager_front 1))) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (<= (+ manager_back 1) manager_front) (not (< node_1_front (+ node_1_back 1))) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (= ok (select manager manager_front)) (not (= manager_state 1))) (or (not (= manager_state 2)) (not (< node_1_front node_1_back)) (= (select manager (+ manager_front 1)) ok) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (not (< node_1_front node_1_back)) (not (= manager_state 0)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or (not (= manager_state 2)) (= (select manager (+ manager_front 1)) ok) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= node_1_state 1)))), 74159#(and (or (not (< node_1_front node_1_back)) (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or (not (= manager_state 2)) (not (< node_1_front node_1_back)) (<= (+ manager_back 1) manager_front) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (= ok (select manager manager_front))) (or (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (not (= manager_state 2)) (<= (+ manager_back 1) manager_front) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1)) (= ok (select manager manager_front))) (or (<= (+ manager_back 1) manager_front) (not (= 5 manager_state)) (= update (select manager manager_front)) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (= (select manager (+ manager_front 1)) ok) (not (= manager_state 3)) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (<= manager_back manager_front)) (or (<= (+ manager_back 1) manager_front) (not (= manager_state 0)) (= update (select manager manager_front)) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (< node_1_front node_1_back)) (<= (+ manager_back 1) manager_front) (not (= manager_state 0)) (= update (select manager manager_front)) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back)))) (or (not (= manager_state 4)) (<= (+ manager_back 1) manager_front) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1)) (= ok (select manager manager_front))) (or (= (select manager (+ manager_front 1)) ok) (not (= manager_state 3)) (<= node_1_back node_1_front) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 4)) (not (< node_1_front node_1_back)) (<= (+ manager_back 1) manager_front) (not (= node_1_state 0)) (not (= ok (select manager manager_back))) (= ok (select manager manager_front))) (or (not (< node_1_front node_1_back)) (<= (+ manager_back 1) manager_front) (not (= 5 manager_state)) (= update (select manager manager_front)) (not (= node_1_state 0)) (not (= ok (select manager manager_back))))), 74158#(and (or (<= (+ manager_back 1) manager_front) (not (= manager_state 0)) (= update (select manager manager_front)) (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1))) (or (not (= manager_state 4)) (<= (+ manager_back 1) manager_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1)) (= ok (select manager manager_front))) (or (not (= manager_state 0)) (= update (select manager manager_front)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front) (not (= update (select node_1 node_1_back)))) (or safe (not (= ok (select manager manager_back))) (not (= update (select node_1 node_1_back))) (not (= node_1_state 1)) (not (= manager_state 1))) (or (<= manager_back (+ manager_front 1)) (= (select manager (+ manager_front 1)) ok) (not (= manager_state 3)) (not (= node_1_state 0)) (<= node_1_back node_1_front)) (or (<= (+ manager_back 1) manager_front) (not (= 5 manager_state)) (= update (select manager manager_front)) (not (= ok (select manager manager_back))) (not (= node_1_state 1))) (or (= (select manager (+ manager_front 1)) ok) (not (= manager_state 3)) (not (= ok (select manager manager_back))) (<= manager_back manager_front) (not (= node_1_state 1))) (or (not (= manager_state 2)) (<= (+ manager_back 1) manager_front) (not (= ok (select manager manager_back))) (not (= node_1_state 1)) (= ok (select manager manager_front))) (or (not (= 5 manager_state)) (= update (select manager manager_front)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front)) (or (not (= node_1_state 0)) (= (select node_1 node_1_front) update) (<= node_1_back node_1_front) (not (= update (select node_1 node_1_back))) (not (= manager_state 1))) (or (not (= manager_state 4)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front) (= ok (select manager manager_front))) (or (not (= manager_state 2)) (not (= node_1_state 0)) (<= node_1_back node_1_front) (<= manager_back manager_front) (= ok (select manager manager_front))))] [2022-03-15 21:51:46,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:51:46,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:46,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:51:46,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2022-03-15 21:51:46,577 INFO L87 Difference]: Start difference. First operand 2749 states and 15921 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:48,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:48,332 INFO L93 Difference]: Finished difference Result 2915 states and 16410 transitions. [2022-03-15 21:51:48,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 21:51:48,332 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:51:48,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:48,340 INFO L225 Difference]: With dead ends: 2915 [2022-03-15 21:51:48,341 INFO L226 Difference]: Without dead ends: 2899 [2022-03-15 21:51:48,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=381, Invalid=1179, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 21:51:48,342 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 113 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:48,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 221 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:51:48,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2022-03-15 21:51:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 2754. [2022-03-15 21:51:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2754 states, 2753 states have (on average 5.791863421721758) internal successors, (15945), 2753 states have internal predecessors, (15945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2754 states and 15945 transitions. [2022-03-15 21:51:48,419 INFO L78 Accepts]: Start accepts. Automaton has 2754 states and 15945 transitions. Word has length 21 [2022-03-15 21:51:48,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:48,419 INFO L470 AbstractCegarLoop]: Abstraction has 2754 states and 15945 transitions. [2022-03-15 21:51:48,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:48,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2754 states and 15945 transitions. [2022-03-15 21:51:48,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:51:48,427 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:48,427 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:48,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 21:51:48,644 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 21:51:48,644 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 21:51:48,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:48,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1594680503, now seen corresponding path program 1 times [2022-03-15 21:51:48,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:48,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487339741] [2022-03-15 21:51:48,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:48,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:48,796 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:48,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487339741] [2022-03-15 21:51:48,797 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487339741] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:48,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674963791] [2022-03-15 21:51:48,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:48,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:48,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:48,800 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:51:48,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 21:51:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:48,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 21:51:48,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:49,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-03-15 21:51:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:49,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:51,897 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:51,897 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 1016 treesize of output 1022 [2022-03-15 21:51:51,912 INFO L353 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-03-15 21:51:51,913 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 998 treesize of output 902 [2022-03-15 21:51:56,545 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:56,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 902 treesize of output 2596 [2022-03-15 21:51:56,812 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:56,813 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 848 treesize of output 850 Received shutdown request... [2022-03-15 22:00:36,066 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 22:00:36,068 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (4 of 5 remaining) [2022-03-15 22:00:36,083 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:00:36,090 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:00:36,090 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:00:36,268 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:00:36,269 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 22 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 22ms.. [2022-03-15 22:00:36,270 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-03-15 22:00:36,270 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-03-15 22:00:36,270 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-03-15 22:00:36,270 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-03-15 22:00:36,272 INFO L732 BasicCegarLoop]: Path program histogram: [11, 9, 5, 1, 1, 1, 1, 1, 1] [2022-03-15 22:00:36,273 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:00:36,273 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:00:36,275 INFO L202 PluginConnector]: Adding new model commit-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:00:36 BasicIcfg [2022-03-15 22:00:36,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:00:36,275 INFO L158 Benchmark]: Toolchain (without parser) took 796976.90ms. Allocated memory was 174.1MB in the beginning and 804.3MB in the end (delta: 630.2MB). Free memory was 136.5MB in the beginning and 596.5MB in the end (delta: -460.0MB). Peak memory consumption was 524.9MB. Max. memory is 8.0GB. [2022-03-15 22:00:36,275 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 174.1MB. Free memory was 137.9MB in the beginning and 137.9MB in the end (delta: 54.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:00:36,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.70ms. Allocated memory is still 174.1MB. Free memory was 136.4MB in the beginning and 134.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:00:36,275 INFO L158 Benchmark]: Boogie Preprocessor took 34.62ms. Allocated memory is still 174.1MB. Free memory was 134.9MB in the beginning and 133.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:00:36,275 INFO L158 Benchmark]: RCFGBuilder took 404.36ms. Allocated memory is still 174.1MB. Free memory was 133.7MB in the beginning and 118.2MB in the end (delta: 15.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-15 22:00:36,275 INFO L158 Benchmark]: TraceAbstraction took 796494.88ms. Allocated memory was 174.1MB in the beginning and 804.3MB in the end (delta: 630.2MB). Free memory was 149.9MB in the beginning and 596.5MB in the end (delta: -446.6MB). Peak memory consumption was 537.9MB. Max. memory is 8.0GB. [2022-03-15 22:00:36,276 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.11ms. Allocated memory is still 174.1MB. Free memory was 137.9MB in the beginning and 137.9MB in the end (delta: 54.7kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.70ms. Allocated memory is still 174.1MB. Free memory was 136.4MB in the beginning and 134.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.62ms. Allocated memory is still 174.1MB. Free memory was 134.9MB in the beginning and 133.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 404.36ms. Allocated memory is still 174.1MB. Free memory was 133.7MB in the beginning and 118.2MB in the end (delta: 15.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 796494.88ms. Allocated memory was 174.1MB in the beginning and 804.3MB in the end (delta: 630.2MB). Free memory was 149.9MB in the beginning and 596.5MB in the end (delta: -446.6MB). Peak memory consumption was 537.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 34 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 108 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 108, positive: 108, positive conditional: 0, positive unconditional: 108, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 30, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 108, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 30, unknown conditional: 0, unknown unconditional: 30] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 172]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 22 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 22ms.. - TimeoutResultAtElement [Line: 164]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 22 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 22ms.. - TimeoutResultAtElement [Line: 163]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 22 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 22ms.. - TimeoutResultAtElement [Line: 165]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 22 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 22ms.. - TimeoutResultAtElement [Line: 163]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 22 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 22ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 34 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 796.4s, OverallIterations: 31, TraceHistogramMax: 4, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.1s, AutomataDifference: 25.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2423 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2423 mSDsluCounter, 2413 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4248 mSDsCounter, 522 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4774 IncrementalHoareTripleChecker+Invalid, 5296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 522 mSolverCounterUnsat, 342 mSDtfsCounter, 4774 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2626 GetRequests, 2003 SyntacticMatches, 36 SemanticMatches, 587 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4177 ImplicationChecksByTransitivity, 37.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2754occurred in iteration=30, InterpolantAutomatonStates: 322, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 30 MinimizatonAttempts, 9099 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 161.2s InterpolantComputationTime, 1024 NumberOfCodeBlocks, 1024 NumberOfCodeBlocksAsserted, 93 NumberOfCheckSat, 1417 ConstructedInterpolants, 36 QuantifiedInterpolants, 54766 SizeOfPredicates, 420 NumberOfNonLiveVariables, 1723 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 80 InterpolantComputations, 5 PerfectInterpolantSequences, 168/672 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