./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/dancing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:35:06,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:35:06,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:35:06,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:35:06,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:35:06,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:35:06,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:35:06,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:35:06,246 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:35:06,246 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:35:06,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:35:06,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:35:06,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:35:06,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:35:06,247 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:35:06,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:35:06,247 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:35:06,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:35:06,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:35:06,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:35:06,247 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:35:06,247 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:35:06,248 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:35:06,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:35:06,248 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:35:06,248 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:35:06,248 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:35:06,248 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:35:06,248 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:35:06,248 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:35:06,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:35:06,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:35:06,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:35:06,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:35:06,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:35:06,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:35:06,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:35:06,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:35:06,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:35:06,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:35:06,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:35:06,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:35:06,249 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2025-02-08 06:35:06,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:35:06,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:35:06,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:35:06,468 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:35:06,469 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:35:06,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2025-02-08 06:35:07,661 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8fbe0c63c/e90f27c3523b415f866185cf4c9f34ce/FLAGe1599cd26 [2025-02-08 06:35:07,960 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:35:07,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2025-02-08 06:35:07,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8fbe0c63c/e90f27c3523b415f866185cf4c9f34ce/FLAGe1599cd26 [2025-02-08 06:35:08,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8fbe0c63c/e90f27c3523b415f866185cf4c9f34ce [2025-02-08 06:35:08,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:35:08,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:35:08,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:35:08,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:35:08,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:35:08,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:35:08" (1/1) ... [2025-02-08 06:35:08,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@755a91b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:08, skipping insertion in model container [2025-02-08 06:35:08,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:35:08" (1/1) ... [2025-02-08 06:35:08,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:35:08,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:35:08,445 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:35:08,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:35:08,512 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:35:08,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:08 WrapperNode [2025-02-08 06:35:08,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:35:08,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:35:08,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:35:08,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:35:08,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:08" (1/1) ... [2025-02-08 06:35:08,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:08" (1/1) ... [2025-02-08 06:35:08,536 INFO L138 Inliner]: procedures = 124, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 95 [2025-02-08 06:35:08,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:35:08,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:35:08,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:35:08,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:35:08,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:08" (1/1) ... [2025-02-08 06:35:08,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:08" (1/1) ... [2025-02-08 06:35:08,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:08" (1/1) ... [2025-02-08 06:35:08,554 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2025-02-08 06:35:08,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:08" (1/1) ... [2025-02-08 06:35:08,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:08" (1/1) ... [2025-02-08 06:35:08,560 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:08" (1/1) ... [2025-02-08 06:35:08,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:08" (1/1) ... [2025-02-08 06:35:08,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:08" (1/1) ... [2025-02-08 06:35:08,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:08" (1/1) ... [2025-02-08 06:35:08,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:35:08,563 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:35:08,563 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:35:08,563 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:35:08,564 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:08" (1/1) ... [2025-02-08 06:35:08,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:35:08,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:08,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:35:08,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:35:08,608 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2025-02-08 06:35:08,609 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2025-02-08 06:35:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 06:35:08,609 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 06:35:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:35:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:35:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:35:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:35:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:35:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:35:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:35:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:35:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:35:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:35:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:35:08,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:35:08,697 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:35:08,698 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:35:08,930 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L603: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2025-02-08 06:35:08,947 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-02-08 06:35:08,947 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:35:08,954 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:35:08,954 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:35:08,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:35:08 BoogieIcfgContainer [2025-02-08 06:35:08,955 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:35:08,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:35:08,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:35:08,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:35:08,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:35:08" (1/3) ... [2025-02-08 06:35:08,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756863c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:35:08, skipping insertion in model container [2025-02-08 06:35:08,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:35:08" (2/3) ... [2025-02-08 06:35:08,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756863c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:35:08, skipping insertion in model container [2025-02-08 06:35:08,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:35:08" (3/3) ... [2025-02-08 06:35:08,961 INFO L128 eAbstractionObserver]: Analyzing ICFG dancing.i [2025-02-08 06:35:08,970 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:35:08,972 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dancing.i that has 3 procedures, 108 locations, 1 initial locations, 1 loop locations, and 44 error locations. [2025-02-08 06:35:08,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:35:09,002 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3f45d343, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:35:09,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-02-08 06:35:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 55 states have (on average 2.0545454545454547) internal successors, (113), 99 states have internal predecessors, (113), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:35:09,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:09,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:35:09,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:09,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash 4607, now seen corresponding path program 1 times [2025-02-08 06:35:09,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:09,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755694191] [2025-02-08 06:35:09,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:09,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:09,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:35:09,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:35:09,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:09,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:09,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:09,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755694191] [2025-02-08 06:35:09,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755694191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:09,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:09,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:35:09,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884076162] [2025-02-08 06:35:09,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:09,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:35:09,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:09,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:35:09,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:09,165 INFO L87 Difference]: Start difference. First operand has 108 states, 55 states have (on average 2.0545454545454547) internal successors, (113), 99 states have internal predecessors, (113), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:09,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:09,244 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2025-02-08 06:35:09,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:35:09,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2025-02-08 06:35:09,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:09,249 INFO L225 Difference]: With dead ends: 105 [2025-02-08 06:35:09,249 INFO L226 Difference]: Without dead ends: 103 [2025-02-08 06:35:09,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:09,252 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 79 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 94 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:09,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 94 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:09,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-08 06:35:09,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-02-08 06:35:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 94 states have internal predecessors, (104), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2025-02-08 06:35:09,276 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 2 [2025-02-08 06:35:09,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:09,276 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2025-02-08 06:35:09,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:09,276 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2025-02-08 06:35:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:35:09,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:09,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:35:09,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:35:09,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:09,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:09,277 INFO L85 PathProgramCache]: Analyzing trace with hash 4608, now seen corresponding path program 1 times [2025-02-08 06:35:09,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:09,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620842161] [2025-02-08 06:35:09,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:09,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:09,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:35:09,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:35:09,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:09,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:09,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:09,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620842161] [2025-02-08 06:35:09,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620842161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:09,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:09,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:35:09,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888775743] [2025-02-08 06:35:09,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:09,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:35:09,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:09,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:35:09,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:09,330 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:09,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:09,394 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2025-02-08 06:35:09,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:35:09,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2025-02-08 06:35:09,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:09,395 INFO L225 Difference]: With dead ends: 101 [2025-02-08 06:35:09,395 INFO L226 Difference]: Without dead ends: 101 [2025-02-08 06:35:09,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:09,396 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 79 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:09,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 92 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-08 06:35:09,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-08 06:35:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 92 states have internal predecessors, (102), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:09,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2025-02-08 06:35:09,401 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 2 [2025-02-08 06:35:09,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:09,401 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2025-02-08 06:35:09,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2025-02-08 06:35:09,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:35:09,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:09,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:09,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:35:09,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:09,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:09,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2067882151, now seen corresponding path program 1 times [2025-02-08 06:35:09,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:09,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726946089] [2025-02-08 06:35:09,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:09,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:09,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:35:09,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:35:09,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:09,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:09,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:09,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726946089] [2025-02-08 06:35:09,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726946089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:09,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:09,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:35:09,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733808900] [2025-02-08 06:35:09,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:09,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:35:09,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:09,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:35:09,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:09,463 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:09,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:09,545 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2025-02-08 06:35:09,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:35:09,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 06:35:09,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:09,546 INFO L225 Difference]: With dead ends: 100 [2025-02-08 06:35:09,546 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 06:35:09,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:09,547 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:09,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 165 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:09,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 06:35:09,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-02-08 06:35:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 53 states have (on average 1.8867924528301887) internal successors, (100), 90 states have internal predecessors, (100), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2025-02-08 06:35:09,552 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 8 [2025-02-08 06:35:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:09,552 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2025-02-08 06:35:09,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2025-02-08 06:35:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:35:09,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:09,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:09,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:35:09,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:09,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2067882150, now seen corresponding path program 1 times [2025-02-08 06:35:09,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:09,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187853569] [2025-02-08 06:35:09,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:09,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:35:09,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:35:09,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:09,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:09,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:09,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187853569] [2025-02-08 06:35:09,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187853569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:09,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:09,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:35:09,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100941319] [2025-02-08 06:35:09,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:09,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:35:09,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:09,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:35:09,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:09,642 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:09,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:09,703 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2025-02-08 06:35:09,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:35:09,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 06:35:09,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:09,704 INFO L225 Difference]: With dead ends: 98 [2025-02-08 06:35:09,706 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 06:35:09,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:09,707 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:09,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 167 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:09,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 06:35:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-02-08 06:35:09,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 53 states have (on average 1.849056603773585) internal successors, (98), 88 states have internal predecessors, (98), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:09,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2025-02-08 06:35:09,717 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 8 [2025-02-08 06:35:09,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:09,718 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2025-02-08 06:35:09,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2025-02-08 06:35:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:35:09,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:09,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:09,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:35:09,718 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:09,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:09,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1335150751, now seen corresponding path program 1 times [2025-02-08 06:35:09,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:09,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624494407] [2025-02-08 06:35:09,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:09,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:09,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:35:09,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:35:09,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:09,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:09,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:09,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624494407] [2025-02-08 06:35:09,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624494407] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:09,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:09,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:35:09,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465135393] [2025-02-08 06:35:09,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:09,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:35:09,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:09,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:35:09,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:35:09,849 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:09,922 INFO L93 Difference]: Finished difference Result 172 states and 197 transitions. [2025-02-08 06:35:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:35:09,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 06:35:09,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:09,923 INFO L225 Difference]: With dead ends: 172 [2025-02-08 06:35:09,925 INFO L226 Difference]: Without dead ends: 172 [2025-02-08 06:35:09,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:35:09,926 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 73 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:09,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 395 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:09,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-02-08 06:35:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2025-02-08 06:35:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 91 states have (on average 1.9120879120879122) internal successors, (174), 127 states have internal predecessors, (174), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 06:35:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2025-02-08 06:35:09,936 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 10 [2025-02-08 06:35:09,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:09,936 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2025-02-08 06:35:09,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:09,937 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2025-02-08 06:35:09,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:35:09,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:09,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:09,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:35:09,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:09,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:09,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1335112950, now seen corresponding path program 1 times [2025-02-08 06:35:09,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:09,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909889572] [2025-02-08 06:35:09,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:09,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:09,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:35:09,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:35:09,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:09,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:10,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:10,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909889572] [2025-02-08 06:35:10,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909889572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:10,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:10,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:35:10,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036468247] [2025-02-08 06:35:10,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:10,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:35:10,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:10,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:35:10,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:35:10,060 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:10,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:10,138 INFO L93 Difference]: Finished difference Result 139 states and 192 transitions. [2025-02-08 06:35:10,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:35:10,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 06:35:10,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:10,139 INFO L225 Difference]: With dead ends: 139 [2025-02-08 06:35:10,140 INFO L226 Difference]: Without dead ends: 139 [2025-02-08 06:35:10,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:35:10,140 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 139 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:10,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 122 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-08 06:35:10,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-02-08 06:35:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 91 states have (on average 1.89010989010989) internal successors, (172), 126 states have internal predecessors, (172), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 06:35:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 192 transitions. [2025-02-08 06:35:10,146 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 192 transitions. Word has length 10 [2025-02-08 06:35:10,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:10,146 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 192 transitions. [2025-02-08 06:35:10,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:10,146 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 192 transitions. [2025-02-08 06:35:10,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:35:10,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:10,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:10,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:35:10,147 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:10,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:10,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1335112951, now seen corresponding path program 1 times [2025-02-08 06:35:10,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:10,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085312033] [2025-02-08 06:35:10,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:10,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:10,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:35:10,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:35:10,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:10,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:10,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:10,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085312033] [2025-02-08 06:35:10,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085312033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:10,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:10,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:35:10,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442606177] [2025-02-08 06:35:10,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:10,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:35:10,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:10,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:35:10,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:10,352 INFO L87 Difference]: Start difference. First operand 139 states and 192 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:10,467 INFO L93 Difference]: Finished difference Result 138 states and 190 transitions. [2025-02-08 06:35:10,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:35:10,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 06:35:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:10,468 INFO L225 Difference]: With dead ends: 138 [2025-02-08 06:35:10,468 INFO L226 Difference]: Without dead ends: 138 [2025-02-08 06:35:10,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:10,469 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 143 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:10,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 137 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-08 06:35:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-02-08 06:35:10,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 91 states have (on average 1.8681318681318682) internal successors, (170), 125 states have internal predecessors, (170), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 06:35:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 190 transitions. [2025-02-08 06:35:10,474 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 190 transitions. Word has length 10 [2025-02-08 06:35:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:10,474 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 190 transitions. [2025-02-08 06:35:10,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 190 transitions. [2025-02-08 06:35:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:35:10,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:10,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:10,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:35:10,475 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:10,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:10,475 INFO L85 PathProgramCache]: Analyzing trace with hash -2134855679, now seen corresponding path program 1 times [2025-02-08 06:35:10,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:10,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735640525] [2025-02-08 06:35:10,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:10,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:10,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:35:10,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:35:10,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:10,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:10,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:10,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735640525] [2025-02-08 06:35:10,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735640525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:10,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:10,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:35:10,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196221923] [2025-02-08 06:35:10,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:10,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:35:10,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:10,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:35:10,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:35:10,574 INFO L87 Difference]: Start difference. First operand 138 states and 190 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:10,740 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2025-02-08 06:35:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:35:10,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-08 06:35:10,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:10,742 INFO L225 Difference]: With dead ends: 165 [2025-02-08 06:35:10,742 INFO L226 Difference]: Without dead ends: 165 [2025-02-08 06:35:10,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:10,742 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 271 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:10,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 185 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-08 06:35:10,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 138. [2025-02-08 06:35:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 91 states have (on average 1.8021978021978022) internal successors, (164), 125 states have internal predecessors, (164), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 06:35:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 184 transitions. [2025-02-08 06:35:10,747 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 184 transitions. Word has length 15 [2025-02-08 06:35:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:10,747 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 184 transitions. [2025-02-08 06:35:10,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 184 transitions. [2025-02-08 06:35:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:35:10,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:10,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:10,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:35:10,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:10,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:10,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2134855680, now seen corresponding path program 1 times [2025-02-08 06:35:10,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:10,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557131524] [2025-02-08 06:35:10,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:10,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:10,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:35:10,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:35:10,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:10,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:10,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:10,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557131524] [2025-02-08 06:35:10,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557131524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:10,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:10,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:35:10,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416133770] [2025-02-08 06:35:10,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:10,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:35:10,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:10,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:35:10,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:35:10,817 INFO L87 Difference]: Start difference. First operand 138 states and 184 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:10,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:10,955 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2025-02-08 06:35:10,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:35:10,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-08 06:35:10,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:10,957 INFO L225 Difference]: With dead ends: 153 [2025-02-08 06:35:10,957 INFO L226 Difference]: Without dead ends: 153 [2025-02-08 06:35:10,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:10,957 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 255 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:10,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 172 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-08 06:35:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 133. [2025-02-08 06:35:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 91 states have (on average 1.6813186813186813) internal successors, (153), 120 states have internal predecessors, (153), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 06:35:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 173 transitions. [2025-02-08 06:35:10,961 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 173 transitions. Word has length 15 [2025-02-08 06:35:10,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:10,961 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 173 transitions. [2025-02-08 06:35:10,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:10,962 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2025-02-08 06:35:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:35:10,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:10,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:10,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:35:10,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:10,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:10,963 INFO L85 PathProgramCache]: Analyzing trace with hash -788643974, now seen corresponding path program 1 times [2025-02-08 06:35:10,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:10,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392534200] [2025-02-08 06:35:10,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:10,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:10,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:35:10,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:35:10,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:10,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:11,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:11,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392534200] [2025-02-08 06:35:11,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392534200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:11,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:11,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:35:11,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307336029] [2025-02-08 06:35:11,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:11,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:35:11,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:11,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:35:11,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:11,139 INFO L87 Difference]: Start difference. First operand 133 states and 173 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:11,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:11,306 INFO L93 Difference]: Finished difference Result 182 states and 232 transitions. [2025-02-08 06:35:11,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:35:11,306 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-02-08 06:35:11,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:11,307 INFO L225 Difference]: With dead ends: 182 [2025-02-08 06:35:11,307 INFO L226 Difference]: Without dead ends: 182 [2025-02-08 06:35:11,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:35:11,308 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 240 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:11,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 363 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:11,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-08 06:35:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 142. [2025-02-08 06:35:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 99 states have (on average 1.6464646464646464) internal successors, (163), 128 states have internal predecessors, (163), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 06:35:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 185 transitions. [2025-02-08 06:35:11,312 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 185 transitions. Word has length 19 [2025-02-08 06:35:11,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:11,312 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 185 transitions. [2025-02-08 06:35:11,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2025-02-08 06:35:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:35:11,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:11,313 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:11,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:35:11,313 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting is_list_containing_xErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:11,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:11,313 INFO L85 PathProgramCache]: Analyzing trace with hash 65941509, now seen corresponding path program 1 times [2025-02-08 06:35:11,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:11,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438029329] [2025-02-08 06:35:11,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:11,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:11,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:35:11,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:35:11,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:11,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:11,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:11,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438029329] [2025-02-08 06:35:11,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438029329] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:11,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010026399] [2025-02-08 06:35:11,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:11,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:11,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:11,374 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:11,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:35:11,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:35:11,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:35:11,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:11,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:11,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 06:35:11,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:11,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:11,531 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 06:35:11,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-02-08 06:35:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:11,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010026399] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:11,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:11,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-02-08 06:35:11,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143054612] [2025-02-08 06:35:11,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:11,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:35:11,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:11,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:35:11,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:35:11,549 INFO L87 Difference]: Start difference. First operand 142 states and 185 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:11,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:11,679 INFO L93 Difference]: Finished difference Result 156 states and 204 transitions. [2025-02-08 06:35:11,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:35:11,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-08 06:35:11,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:11,680 INFO L225 Difference]: With dead ends: 156 [2025-02-08 06:35:11,680 INFO L226 Difference]: Without dead ends: 156 [2025-02-08 06:35:11,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:11,681 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 141 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:11,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 190 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-08 06:35:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2025-02-08 06:35:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 106 states have (on average 1.6320754716981132) internal successors, (173), 134 states have internal predecessors, (173), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 06:35:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 197 transitions. [2025-02-08 06:35:11,685 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 197 transitions. Word has length 19 [2025-02-08 06:35:11,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:11,686 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 197 transitions. [2025-02-08 06:35:11,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:11,686 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 197 transitions. [2025-02-08 06:35:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:35:11,686 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:11,686 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:11,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:35:11,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 06:35:11,888 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting is_list_containing_xErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:11,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:11,888 INFO L85 PathProgramCache]: Analyzing trace with hash 65941510, now seen corresponding path program 1 times [2025-02-08 06:35:11,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:11,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433158946] [2025-02-08 06:35:11,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:11,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:11,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:35:11,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:35:11,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:11,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:12,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:12,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433158946] [2025-02-08 06:35:12,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433158946] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:12,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628644067] [2025-02-08 06:35:12,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:12,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:12,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:12,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:12,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:35:12,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:35:12,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:35:12,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:12,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:12,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 06:35:12,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:12,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:12,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:12,287 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 25 [2025-02-08 06:35:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:12,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628644067] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:12,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:12,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 15 [2025-02-08 06:35:12,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248085433] [2025-02-08 06:35:12,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:12,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 06:35:12,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:12,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 06:35:12,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:35:12,362 INFO L87 Difference]: Start difference. First operand 150 states and 197 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:12,664 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2025-02-08 06:35:12,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:35:12,664 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-08 06:35:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:12,665 INFO L225 Difference]: With dead ends: 154 [2025-02-08 06:35:12,665 INFO L226 Difference]: Without dead ends: 154 [2025-02-08 06:35:12,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:35:12,666 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 278 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:12,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 364 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:12,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-08 06:35:12,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 149. [2025-02-08 06:35:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 106 states have (on average 1.6037735849056605) internal successors, (170), 133 states have internal predecessors, (170), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 06:35:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 194 transitions. [2025-02-08 06:35:12,671 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 194 transitions. Word has length 19 [2025-02-08 06:35:12,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:12,671 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 194 transitions. [2025-02-08 06:35:12,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:12,672 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2025-02-08 06:35:12,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:35:12,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:12,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:12,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:12,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:12,877 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:12,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:12,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1952542643, now seen corresponding path program 1 times [2025-02-08 06:35:12,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:12,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684007516] [2025-02-08 06:35:12,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:12,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:12,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:35:12,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:35:12,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:12,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:13,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:13,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684007516] [2025-02-08 06:35:13,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684007516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:13,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:13,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:35:13,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660497911] [2025-02-08 06:35:13,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:13,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:35:13,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:13,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:35:13,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:13,044 INFO L87 Difference]: Start difference. First operand 149 states and 194 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:13,165 INFO L93 Difference]: Finished difference Result 184 states and 235 transitions. [2025-02-08 06:35:13,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:35:13,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-08 06:35:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:13,166 INFO L225 Difference]: With dead ends: 184 [2025-02-08 06:35:13,166 INFO L226 Difference]: Without dead ends: 184 [2025-02-08 06:35:13,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:35:13,167 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 76 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:13,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 385 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-08 06:35:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 151. [2025-02-08 06:35:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 108 states have (on average 1.5925925925925926) internal successors, (172), 135 states have internal predecessors, (172), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 06:35:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 196 transitions. [2025-02-08 06:35:13,171 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 196 transitions. Word has length 21 [2025-02-08 06:35:13,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:13,172 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 196 transitions. [2025-02-08 06:35:13,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 196 transitions. [2025-02-08 06:35:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:35:13,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:13,172 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:13,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:35:13,173 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:13,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:13,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1843588308, now seen corresponding path program 1 times [2025-02-08 06:35:13,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:13,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101761477] [2025-02-08 06:35:13,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:13,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:13,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:35:13,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:35:13,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:13,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:13,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:13,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101761477] [2025-02-08 06:35:13,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101761477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:13,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:13,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:35:13,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619463561] [2025-02-08 06:35:13,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:13,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:35:13,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:13,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:35:13,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:35:13,228 INFO L87 Difference]: Start difference. First operand 151 states and 196 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:13,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:13,247 INFO L93 Difference]: Finished difference Result 159 states and 205 transitions. [2025-02-08 06:35:13,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:35:13,248 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-02-08 06:35:13,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:13,248 INFO L225 Difference]: With dead ends: 159 [2025-02-08 06:35:13,248 INFO L226 Difference]: Without dead ends: 159 [2025-02-08 06:35:13,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:35:13,249 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 3 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:13,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 385 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:35:13,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-08 06:35:13,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-02-08 06:35:13,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 111 states have (on average 1.5765765765765767) internal successors, (175), 140 states have internal predecessors, (175), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-08 06:35:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 203 transitions. [2025-02-08 06:35:13,253 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 203 transitions. Word has length 25 [2025-02-08 06:35:13,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:13,253 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 203 transitions. [2025-02-08 06:35:13,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 203 transitions. [2025-02-08 06:35:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:35:13,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:13,254 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:13,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:35:13,254 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:13,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:13,255 INFO L85 PathProgramCache]: Analyzing trace with hash 222165083, now seen corresponding path program 1 times [2025-02-08 06:35:13,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:13,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473970636] [2025-02-08 06:35:13,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:13,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:13,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:35:13,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:35:13,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:13,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:13,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:13,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473970636] [2025-02-08 06:35:13,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473970636] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:13,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42780666] [2025-02-08 06:35:13,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:13,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:13,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:13,342 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:13,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:35:13,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:35:13,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:35:13,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:13,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:13,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 06:35:13,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:13,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:13,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42780666] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:13,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:13,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-02-08 06:35:13,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406463402] [2025-02-08 06:35:13,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:13,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 06:35:13,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:13,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 06:35:13,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:35:13,586 INFO L87 Difference]: Start difference. First operand 157 states and 203 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:35:13,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:13,970 INFO L93 Difference]: Finished difference Result 184 states and 218 transitions. [2025-02-08 06:35:13,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:35:13,971 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2025-02-08 06:35:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:13,972 INFO L225 Difference]: With dead ends: 184 [2025-02-08 06:35:13,972 INFO L226 Difference]: Without dead ends: 182 [2025-02-08 06:35:13,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:35:13,972 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 228 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:13,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 667 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:35:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-08 06:35:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 157. [2025-02-08 06:35:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 111 states have (on average 1.5675675675675675) internal successors, (174), 140 states have internal predecessors, (174), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-08 06:35:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 202 transitions. [2025-02-08 06:35:13,977 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 202 transitions. Word has length 24 [2025-02-08 06:35:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:13,977 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 202 transitions. [2025-02-08 06:35:13,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:35:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 202 transitions. [2025-02-08 06:35:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:35:13,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:13,978 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:13,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:14,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:14,182 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting is_list_containing_xErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:14,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash -490504241, now seen corresponding path program 1 times [2025-02-08 06:35:14,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:14,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079370756] [2025-02-08 06:35:14,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:14,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:14,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:35:14,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:35:14,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:14,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:14,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:14,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079370756] [2025-02-08 06:35:14,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079370756] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:14,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948759753] [2025-02-08 06:35:14,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:14,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:14,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:14,565 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:14,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:35:14,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:35:14,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:35:14,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:14,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:14,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-08 06:35:14,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:14,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:35:14,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:35:14,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-08 06:35:14,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-08 06:35:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:14,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:14,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2025-02-08 06:35:14,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:14,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:14,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948759753] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:14,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:14,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 19 [2025-02-08 06:35:14,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557035869] [2025-02-08 06:35:14,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:14,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 06:35:14,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:14,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 06:35:14,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-02-08 06:35:14,900 INFO L87 Difference]: Start difference. First operand 157 states and 202 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:15,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:15,347 INFO L93 Difference]: Finished difference Result 234 states and 294 transitions. [2025-02-08 06:35:15,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:35:15,347 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-08 06:35:15,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:15,348 INFO L225 Difference]: With dead ends: 234 [2025-02-08 06:35:15,348 INFO L226 Difference]: Without dead ends: 234 [2025-02-08 06:35:15,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2025-02-08 06:35:15,349 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 322 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:15,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1024 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:35:15,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-08 06:35:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 195. [2025-02-08 06:35:15,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 141 states have (on average 1.553191489361702) internal successors, (219), 172 states have internal predecessors, (219), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 06:35:15,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2025-02-08 06:35:15,361 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 25 [2025-02-08 06:35:15,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:15,361 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2025-02-08 06:35:15,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2025-02-08 06:35:15,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 06:35:15,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:15,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:15,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 06:35:15,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 06:35:15,562 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:15,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:15,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2132071651, now seen corresponding path program 1 times [2025-02-08 06:35:15,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:15,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637730812] [2025-02-08 06:35:15,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:15,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:15,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 06:35:15,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 06:35:15,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:15,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:15,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:15,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:15,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637730812] [2025-02-08 06:35:15,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637730812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:15,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:15,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:35:15,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367843631] [2025-02-08 06:35:15,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:15,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:35:15,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:15,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:35:15,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:35:15,616 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:15,733 INFO L93 Difference]: Finished difference Result 208 states and 256 transitions. [2025-02-08 06:35:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:35:15,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-02-08 06:35:15,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:15,734 INFO L225 Difference]: With dead ends: 208 [2025-02-08 06:35:15,734 INFO L226 Difference]: Without dead ends: 208 [2025-02-08 06:35:15,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:15,734 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 209 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:15,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 178 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:15,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-02-08 06:35:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 192. [2025-02-08 06:35:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 141 states have (on average 1.49645390070922) internal successors, (211), 169 states have internal predecessors, (211), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 06:35:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 251 transitions. [2025-02-08 06:35:15,747 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 251 transitions. Word has length 27 [2025-02-08 06:35:15,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:15,747 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 251 transitions. [2025-02-08 06:35:15,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:15,748 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 251 transitions. [2025-02-08 06:35:15,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 06:35:15,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:15,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:15,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:35:15,748 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:15,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:15,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2132071650, now seen corresponding path program 1 times [2025-02-08 06:35:15,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:15,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079682768] [2025-02-08 06:35:15,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:15,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:15,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 06:35:15,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 06:35:15,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:15,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:15,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:15,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079682768] [2025-02-08 06:35:15,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079682768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:15,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:15,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:35:15,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914578614] [2025-02-08 06:35:15,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:15,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:35:15,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:15,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:35:15,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:35:15,834 INFO L87 Difference]: Start difference. First operand 192 states and 251 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:15,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:15,989 INFO L93 Difference]: Finished difference Result 205 states and 252 transitions. [2025-02-08 06:35:15,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:35:15,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-02-08 06:35:15,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:15,991 INFO L225 Difference]: With dead ends: 205 [2025-02-08 06:35:15,991 INFO L226 Difference]: Without dead ends: 205 [2025-02-08 06:35:15,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:15,991 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 157 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:15,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 217 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:15,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-08 06:35:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 192. [2025-02-08 06:35:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 141 states have (on average 1.4680851063829787) internal successors, (207), 169 states have internal predecessors, (207), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 06:35:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 247 transitions. [2025-02-08 06:35:15,996 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 247 transitions. Word has length 27 [2025-02-08 06:35:15,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:15,996 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 247 transitions. [2025-02-08 06:35:15,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 247 transitions. [2025-02-08 06:35:15,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 06:35:15,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:15,997 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:15,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:35:15,997 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:15,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:15,998 INFO L85 PathProgramCache]: Analyzing trace with hash -189858757, now seen corresponding path program 1 times [2025-02-08 06:35:15,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:15,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816697884] [2025-02-08 06:35:15,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:15,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:16,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 06:35:16,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 06:35:16,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:16,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:16,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816697884] [2025-02-08 06:35:16,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816697884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:16,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:16,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:35:16,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182472863] [2025-02-08 06:35:16,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:16,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:35:16,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:16,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:35:16,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:35:16,097 INFO L87 Difference]: Start difference. First operand 192 states and 247 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:16,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:16,227 INFO L93 Difference]: Finished difference Result 199 states and 244 transitions. [2025-02-08 06:35:16,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:35:16,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-08 06:35:16,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:16,228 INFO L225 Difference]: With dead ends: 199 [2025-02-08 06:35:16,228 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 06:35:16,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:16,229 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 66 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:16,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 301 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:16,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 06:35:16,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2025-02-08 06:35:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.4113475177304964) internal successors, (199), 163 states have internal predecessors, (199), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 06:35:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 239 transitions. [2025-02-08 06:35:16,233 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 239 transitions. Word has length 26 [2025-02-08 06:35:16,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:16,233 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 239 transitions. [2025-02-08 06:35:16,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 239 transitions. [2025-02-08 06:35:16,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 06:35:16,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:16,234 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:16,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 06:35:16,234 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:16,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:16,235 INFO L85 PathProgramCache]: Analyzing trace with hash -189858758, now seen corresponding path program 1 times [2025-02-08 06:35:16,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:16,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283661966] [2025-02-08 06:35:16,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:16,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:16,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 06:35:16,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 06:35:16,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:16,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:16,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:16,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283661966] [2025-02-08 06:35:16,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283661966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:16,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:16,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:35:16,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047877196] [2025-02-08 06:35:16,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:16,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:35:16,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:16,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:35:16,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:35:16,276 INFO L87 Difference]: Start difference. First operand 186 states and 239 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:16,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:16,394 INFO L93 Difference]: Finished difference Result 197 states and 242 transitions. [2025-02-08 06:35:16,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:35:16,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-08 06:35:16,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:16,395 INFO L225 Difference]: With dead ends: 197 [2025-02-08 06:35:16,395 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 06:35:16,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:16,396 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 71 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:16,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 292 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:16,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 06:35:16,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 185. [2025-02-08 06:35:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 141 states have (on average 1.3971631205673758) internal successors, (197), 162 states have internal predecessors, (197), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 06:35:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 237 transitions. [2025-02-08 06:35:16,400 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 237 transitions. Word has length 26 [2025-02-08 06:35:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:16,400 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 237 transitions. [2025-02-08 06:35:16,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 237 transitions. [2025-02-08 06:35:16,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 06:35:16,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:16,405 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:16,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 06:35:16,405 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:16,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:16,406 INFO L85 PathProgramCache]: Analyzing trace with hash 590719189, now seen corresponding path program 1 times [2025-02-08 06:35:16,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:16,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995135303] [2025-02-08 06:35:16,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:16,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:16,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:35:16,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:35:16,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:16,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:16,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:16,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995135303] [2025-02-08 06:35:16,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995135303] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:16,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766501138] [2025-02-08 06:35:16,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:16,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:16,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:16,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:16,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:35:16,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:35:16,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:35:16,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:16,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:16,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 06:35:16,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:16,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:16,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:35:16,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-08 06:35:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:16,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:16,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-02-08 06:35:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:16,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766501138] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:16,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:16,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 15 [2025-02-08 06:35:16,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95039017] [2025-02-08 06:35:16,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:16,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 06:35:16,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:16,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 06:35:16,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:35:16,868 INFO L87 Difference]: Start difference. First operand 185 states and 237 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:35:17,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:17,359 INFO L93 Difference]: Finished difference Result 307 states and 370 transitions. [2025-02-08 06:35:17,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:35:17,359 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-02-08 06:35:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:17,361 INFO L225 Difference]: With dead ends: 307 [2025-02-08 06:35:17,361 INFO L226 Difference]: Without dead ends: 307 [2025-02-08 06:35:17,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:35:17,361 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 320 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:17,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 884 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:35:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-02-08 06:35:17,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 251. [2025-02-08 06:35:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 191 states have (on average 1.3717277486910995) internal successors, (262), 216 states have internal predecessors, (262), 31 states have call successors, (31), 12 states have call predecessors, (31), 12 states have return successors, (31), 22 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-08 06:35:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 324 transitions. [2025-02-08 06:35:17,373 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 324 transitions. Word has length 28 [2025-02-08 06:35:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:17,374 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 324 transitions. [2025-02-08 06:35:17,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:35:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 324 transitions. [2025-02-08 06:35:17,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 06:35:17,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:17,374 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:17,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:17,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:17,575 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:17,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:17,575 INFO L85 PathProgramCache]: Analyzing trace with hash 590719190, now seen corresponding path program 1 times [2025-02-08 06:35:17,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:17,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124904290] [2025-02-08 06:35:17,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:17,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:17,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:35:17,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:35:17,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:17,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:18,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:18,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124904290] [2025-02-08 06:35:18,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124904290] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:18,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088432465] [2025-02-08 06:35:18,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:18,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:18,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:18,537 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:18,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:35:18,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:35:18,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:35:18,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:18,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:18,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-08 06:35:18,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:18,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:35:18,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:35:18,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:35:18,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:18,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 06:35:18,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:18,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 06:35:18,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:18,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 06:35:18,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:18,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 06:35:18,838 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 06:35:18,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2025-02-08 06:35:18,853 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2025-02-08 06:35:18,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2025-02-08 06:35:19,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2025-02-08 06:35:19,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 06:35:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:19,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:19,838 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int))) (< 0 (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_696))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 1))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_695))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_696))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 1))))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse5 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_696))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (or (= .cse5 0) (< (+ .cse5 3) (select |c_#length| (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_695))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))))))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse11 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse9 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_695))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (or (= .cse9 0) (< (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_696))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 3) (select |c_#length| .cse9)))))))) is different from false [2025-02-08 06:35:19,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:19,935 INFO L378 Elim1Store]: Elim1 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 395 treesize of output 400 [2025-02-08 06:35:20,487 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_ArrVal_695 (Array Int Int))) (not (= |v_ULTIMATE.start_main_~n~0#1.base_28| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696))) (or (< (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 5) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696))) (or (< (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 5) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_3 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (< (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_2))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 5)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_8 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_8) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_1 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))) (forall ((v_prenex_6 Int) (v_prenex_7 (Array Int Int))) (< 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_7))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_6 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 1))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_ArrVal_696 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_695 (Array Int Int))) (= |v_ULTIMATE.start_main_~n~0#1.base_28| (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (< (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_2))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 5)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))) (or (= .cse10 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0)) (= .cse10 0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_5))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_4 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_8 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_8) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)) (forall ((v_prenex_6 Int) (v_prenex_7 (Array Int Int))) (< 0 (+ (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_7))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_6 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 1))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_1 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_28| (select (select (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0)) (= (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) (select (select .cse14 |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))))) (forall ((v_ArrVal_696 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_28| (select (select (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0)) (= (select (select .cse16 |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_1 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_28| (select (select (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0)) (= .cse18 (select (select (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0)) (= .cse18 0))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696))) (or (< (select (select .cse20 |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 5) (= (select (select (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)))))))) is different from false [2025-02-08 06:35:20,788 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_6 Int) (v_prenex_7 (Array Int Int))) (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_7) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_6 4) 0) .cse0) 1))) (forall ((v_prenex_8 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_8) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_695 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0) |v_ULTIMATE.start_main_~n~0#1.base_28|)) (forall ((v_ArrVal_696 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696) |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= (select (store .cse1 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0) .cse0) 0) (< (select .cse1 .cse0) 5)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696) |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= (select (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0) .cse0) 0) (< (select .cse2 .cse0) 5)))) (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_5) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_4 4) 0) .cse0))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_1 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse3 (select .cse4 .cse0))) (or (= .cse3 (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0)) (= |v_ULTIMATE.start_main_~n~0#1.base_28| (select (store .cse4 (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0)) (= .cse3 0))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696) |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= (select (store .cse5 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0) .cse0) 0) (< (select .cse5 .cse0) 5)))) (forall ((v_ArrVal_695 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) |v_ULTIMATE.start_main_~n~0#1.base_28|))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (< (select (store (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_1 4) 0) .cse0) 5)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_3 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_28| (select (store .cse6 (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0)) (= (select .cse6 .cse0) 0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (< (select (store (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_1 4) 0) .cse0) 5)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (= .cse7 (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0)) (= .cse7 0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_ArrVal_696 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_1 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= (select .cse8 .cse0) (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0)) (= (select (store .cse8 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0) |v_ULTIMATE.start_main_~n~0#1.base_28|)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_1 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0) (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_6 Int) (v_prenex_7 (Array Int Int))) (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_7) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_6 4) 0) .cse0) 1))) (forall ((v_prenex_8 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_8) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0)))))) is different from false [2025-02-08 06:35:20,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:20,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-02-08 06:35:20,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2025-02-08 06:35:20,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-02-08 06:35:20,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-02-08 06:35:20,872 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-08 06:35:20,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 1 [2025-02-08 06:35:20,875 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-08 06:35:20,878 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-08 06:35:20,881 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-08 06:35:20,886 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-08 06:35:20,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 1 [2025-02-08 06:35:20,889 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-08 06:35:20,894 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-08 06:35:20,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 1 [2025-02-08 06:35:20,903 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-08 06:35:20,907 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-08 06:35:20,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 1 [2025-02-08 06:35:20,911 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-08 06:35:20,913 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-08 06:35:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-08 06:35:20,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088432465] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:20,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:20,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 11] total 35 [2025-02-08 06:35:20,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399732113] [2025-02-08 06:35:20,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:20,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-08 06:35:20,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:20,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-08 06:35:20,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=950, Unknown=3, NotChecked=192, Total=1260 [2025-02-08 06:35:20,964 INFO L87 Difference]: Start difference. First operand 251 states and 324 transitions. Second operand has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 36 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:35:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:24,799 INFO L93 Difference]: Finished difference Result 517 states and 638 transitions. [2025-02-08 06:35:24,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-08 06:35:24,804 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 36 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2025-02-08 06:35:24,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:24,806 INFO L225 Difference]: With dead ends: 517 [2025-02-08 06:35:24,806 INFO L226 Difference]: Without dead ends: 517 [2025-02-08 06:35:24,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=666, Invalid=3003, Unknown=3, NotChecked=360, Total=4032 [2025-02-08 06:35:24,813 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 1303 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1200 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:24,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 1124 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1436 Invalid, 0 Unknown, 1200 Unchecked, 1.6s Time] [2025-02-08 06:35:24,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-02-08 06:35:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 371. [2025-02-08 06:35:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 285 states have (on average 1.3333333333333333) internal successors, (380), 316 states have internal predecessors, (380), 49 states have call successors, (49), 20 states have call predecessors, (49), 20 states have return successors, (49), 34 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-08 06:35:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 478 transitions. [2025-02-08 06:35:24,841 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 478 transitions. Word has length 28 [2025-02-08 06:35:24,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:24,841 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 478 transitions. [2025-02-08 06:35:24,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 36 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:35:24,842 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 478 transitions. [2025-02-08 06:35:24,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 06:35:24,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:24,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:24,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 06:35:25,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-08 06:35:25,046 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:25,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:25,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1724796427, now seen corresponding path program 1 times [2025-02-08 06:35:25,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:25,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442051954] [2025-02-08 06:35:25,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:25,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:25,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 06:35:25,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:35:25,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:25,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:25,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:25,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442051954] [2025-02-08 06:35:25,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442051954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:25,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:25,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:35:25,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888623843] [2025-02-08 06:35:25,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:25,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:35:25,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:25,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:35:25,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:25,217 INFO L87 Difference]: Start difference. First operand 371 states and 478 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:25,355 INFO L93 Difference]: Finished difference Result 406 states and 526 transitions. [2025-02-08 06:35:25,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:35:25,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2025-02-08 06:35:25,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:25,357 INFO L225 Difference]: With dead ends: 406 [2025-02-08 06:35:25,357 INFO L226 Difference]: Without dead ends: 406 [2025-02-08 06:35:25,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:35:25,358 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 101 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:25,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 356 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:25,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-02-08 06:35:25,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 389. [2025-02-08 06:35:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 297 states have (on average 1.3265993265993266) internal successors, (394), 330 states have internal predecessors, (394), 55 states have call successors, (55), 20 states have call predecessors, (55), 20 states have return successors, (55), 38 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-08 06:35:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 504 transitions. [2025-02-08 06:35:25,369 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 504 transitions. Word has length 30 [2025-02-08 06:35:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:25,369 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 504 transitions. [2025-02-08 06:35:25,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 504 transitions. [2025-02-08 06:35:25,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:35:25,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:25,370 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:25,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 06:35:25,370 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:25,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:25,370 INFO L85 PathProgramCache]: Analyzing trace with hash 589187933, now seen corresponding path program 1 times [2025-02-08 06:35:25,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:25,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889030378] [2025-02-08 06:35:25,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:25,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:25,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:35:25,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:35:25,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:25,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:35:25,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:25,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889030378] [2025-02-08 06:35:25,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889030378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:25,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:25,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:35:25,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982413355] [2025-02-08 06:35:25,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:25,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:35:25,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:25,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:35:25,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:35:25,403 INFO L87 Difference]: Start difference. First operand 389 states and 504 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:25,428 INFO L93 Difference]: Finished difference Result 385 states and 479 transitions. [2025-02-08 06:35:25,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:35:25,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-02-08 06:35:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:25,429 INFO L225 Difference]: With dead ends: 385 [2025-02-08 06:35:25,429 INFO L226 Difference]: Without dead ends: 385 [2025-02-08 06:35:25,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:35:25,430 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 38 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:25,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 253 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:35:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-02-08 06:35:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 371. [2025-02-08 06:35:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 291 states have (on average 1.3127147766323024) internal successors, (382), 318 states have internal predecessors, (382), 43 states have call successors, (43), 20 states have call predecessors, (43), 20 states have return successors, (43), 32 states have call predecessors, (43), 43 states have call successors, (43) [2025-02-08 06:35:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 468 transitions. [2025-02-08 06:35:25,440 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 468 transitions. Word has length 31 [2025-02-08 06:35:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:25,440 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 468 transitions. [2025-02-08 06:35:25,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:25,440 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 468 transitions. [2025-02-08 06:35:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 06:35:25,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:25,441 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:25,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 06:35:25,441 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:25,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:25,442 INFO L85 PathProgramCache]: Analyzing trace with hash -803742028, now seen corresponding path program 1 times [2025-02-08 06:35:25,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:25,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378023257] [2025-02-08 06:35:25,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:25,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:25,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 06:35:25,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:35:25,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:25,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:25,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:25,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378023257] [2025-02-08 06:35:25,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378023257] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:25,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218076402] [2025-02-08 06:35:25,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:25,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:25,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:25,630 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:25,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:35:25,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 06:35:25,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:35:25,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:25,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:25,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-08 06:35:25,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:25,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:25,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:25,795 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:35:25,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-08 06:35:25,809 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:35:25,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-08 06:35:26,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:26,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:26,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:26,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 74 [2025-02-08 06:35:26,496 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-02-08 06:35:26,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 117 treesize of output 93 [2025-02-08 06:35:26,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:26,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 81 [2025-02-08 06:35:26,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2025-02-08 06:35:26,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 78 [2025-02-08 06:35:26,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2025-02-08 06:35:26,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:26,518 INFO L378 Elim1Store]: Elim1 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 61 treesize of output 62 [2025-02-08 06:35:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218076402] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:26,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:26,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 31 [2025-02-08 06:35:26,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614871709] [2025-02-08 06:35:26,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:26,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-08 06:35:26,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:26,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-08 06:35:26,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=825, Unknown=3, NotChecked=0, Total=930 [2025-02-08 06:35:26,557 INFO L87 Difference]: Start difference. First operand 371 states and 468 transitions. Second operand has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 30 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:35:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:27,858 INFO L93 Difference]: Finished difference Result 496 states and 626 transitions. [2025-02-08 06:35:27,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 06:35:27,859 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 30 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2025-02-08 06:35:27,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:27,862 INFO L225 Difference]: With dead ends: 496 [2025-02-08 06:35:27,862 INFO L226 Difference]: Without dead ends: 490 [2025-02-08 06:35:27,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=265, Invalid=1712, Unknown=3, NotChecked=0, Total=1980 [2025-02-08 06:35:27,863 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 359 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:27,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1514 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 06:35:27,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-02-08 06:35:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 394. [2025-02-08 06:35:27,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 306 states have (on average 1.3169934640522876) internal successors, (403), 337 states have internal predecessors, (403), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (53), 35 states have call predecessors, (53), 49 states have call successors, (53) [2025-02-08 06:35:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 505 transitions. [2025-02-08 06:35:27,882 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 505 transitions. Word has length 30 [2025-02-08 06:35:27,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:27,882 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 505 transitions. [2025-02-08 06:35:27,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 30 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:35:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 505 transitions. [2025-02-08 06:35:27,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 06:35:27,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:27,883 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:27,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 06:35:28,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:28,084 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:28,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:28,084 INFO L85 PathProgramCache]: Analyzing trace with hash 765529832, now seen corresponding path program 1 times [2025-02-08 06:35:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:28,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253188119] [2025-02-08 06:35:28,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:28,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:28,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 06:35:28,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:35:28,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:28,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:28,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:28,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253188119] [2025-02-08 06:35:28,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253188119] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:28,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659011406] [2025-02-08 06:35:28,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:28,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:28,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:28,488 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:28,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:35:28,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 06:35:28,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:35:28,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:28,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:28,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-08 06:35:28,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:28,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:28,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:28,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:35:28,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:35:28,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:28,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:35:28,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:28,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:35:28,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:28,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:35:28,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:28,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:35:28,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:28,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:35:28,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:28,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:35:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:28,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:28,981 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_33| Int)) (or (forall ((v_ArrVal_885 Int) (v_ArrVal_882 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_33| v_ArrVal_882))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_885))) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_33| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_33| Int)) (or (forall ((v_ArrVal_884 Int) (v_ArrVal_881 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_33| v_ArrVal_881))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_884))) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_33| 1)))))) is different from false [2025-02-08 06:35:30,481 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_14| Int)) (or (forall ((|v_ULTIMATE.start_main_~n~0#1.base_33| Int)) (or (forall ((v_ArrVal_882 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_33| v_ArrVal_882) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_33| 1)))) (< |v_ULTIMATE.start_main_~tail~0#1.offset_14| |c_ULTIMATE.start_main_~#list~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_14| Int)) (or (forall ((|v_ULTIMATE.start_main_~n~0#1.base_33| Int)) (or (forall ((v_ArrVal_881 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_33| v_ArrVal_881) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_33| 1)))) (< |v_ULTIMATE.start_main_~tail~0#1.offset_14| |c_ULTIMATE.start_main_~#list~0#1.offset|)))) is different from false [2025-02-08 06:35:41,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:41,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2025-02-08 06:35:41,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-02-08 06:35:41,728 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-02-08 06:35:41,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 06:35:42,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-08 06:35:42,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659011406] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:42,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:42,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 24 [2025-02-08 06:35:42,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437574600] [2025-02-08 06:35:42,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:42,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 06:35:42,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:42,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 06:35:42,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=357, Unknown=20, NotChecked=82, Total=552 [2025-02-08 06:35:42,780 INFO L87 Difference]: Start difference. First operand 394 states and 505 transitions. Second operand has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:35:43,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:43,386 INFO L93 Difference]: Finished difference Result 455 states and 561 transitions. [2025-02-08 06:35:43,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:35:43,387 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-02-08 06:35:43,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:43,388 INFO L225 Difference]: With dead ends: 455 [2025-02-08 06:35:43,388 INFO L226 Difference]: Without dead ends: 455 [2025-02-08 06:35:43,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=203, Invalid=597, Unknown=20, NotChecked=110, Total=930 [2025-02-08 06:35:43,389 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 545 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 397 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:43,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 666 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 471 Invalid, 0 Unknown, 397 Unchecked, 0.4s Time] [2025-02-08 06:35:43,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-02-08 06:35:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 406. [2025-02-08 06:35:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 315 states have (on average 1.3047619047619048) internal successors, (411), 347 states have internal predecessors, (411), 50 states have call successors, (50), 23 states have call predecessors, (50), 24 states have return successors, (54), 35 states have call predecessors, (54), 50 states have call successors, (54) [2025-02-08 06:35:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 515 transitions. [2025-02-08 06:35:43,397 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 515 transitions. Word has length 30 [2025-02-08 06:35:43,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:43,397 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 515 transitions. [2025-02-08 06:35:43,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:35:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 515 transitions. [2025-02-08 06:35:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 06:35:43,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:43,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:43,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:43,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-08 06:35:43,605 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:43,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:43,605 INFO L85 PathProgramCache]: Analyzing trace with hash -327270038, now seen corresponding path program 1 times [2025-02-08 06:35:43,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:43,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965660517] [2025-02-08 06:35:43,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:43,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:43,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 06:35:43,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:35:43,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:43,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:43,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:43,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965660517] [2025-02-08 06:35:43,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965660517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:43,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:43,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:35:43,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540966626] [2025-02-08 06:35:43,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:43,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:35:43,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:43,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:35:43,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:43,723 INFO L87 Difference]: Start difference. First operand 406 states and 515 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:43,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:43,864 INFO L93 Difference]: Finished difference Result 452 states and 573 transitions. [2025-02-08 06:35:43,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:35:43,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2025-02-08 06:35:43,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:43,866 INFO L225 Difference]: With dead ends: 452 [2025-02-08 06:35:43,867 INFO L226 Difference]: Without dead ends: 452 [2025-02-08 06:35:43,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:35:43,868 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 34 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:43,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 380 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-02-08 06:35:43,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 432. [2025-02-08 06:35:43,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 336 states have (on average 1.2916666666666667) internal successors, (434), 368 states have internal predecessors, (434), 55 states have call successors, (55), 23 states have call predecessors, (55), 24 states have return successors, (60), 40 states have call predecessors, (60), 55 states have call successors, (60) [2025-02-08 06:35:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 549 transitions. [2025-02-08 06:35:43,883 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 549 transitions. Word has length 32 [2025-02-08 06:35:43,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:43,883 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 549 transitions. [2025-02-08 06:35:43,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:43,883 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 549 transitions. [2025-02-08 06:35:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 06:35:43,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:43,884 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:43,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 06:35:43,884 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting is_list_containing_xErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:35:43,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:43,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1133209928, now seen corresponding path program 1 times [2025-02-08 06:35:43,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:43,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755361343] [2025-02-08 06:35:43,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:43,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:43,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 06:35:43,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 06:35:43,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:43,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:35:44,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:44,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755361343] [2025-02-08 06:35:44,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755361343] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:44,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803267124] [2025-02-08 06:35:44,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:44,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:44,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:44,108 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:44,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:35:44,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 06:35:44,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 06:35:44,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:44,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:44,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-02-08 06:35:44,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:44,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:44,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:35:44,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:35:44,287 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:44,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:44,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 06:35:44,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 06:35:44,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 06:35:44,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 06:35:44,373 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 06:35:44,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2025-02-08 06:35:44,391 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 06:35:44,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2025-02-08 06:35:44,505 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:35:44,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 06:35:44,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-02-08 06:35:44,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-02-08 06:35:44,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-02-08 06:35:44,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-02-08 06:35:44,628 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 06:35:44,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 21 [2025-02-08 06:35:44,653 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 06:35:44,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 21 [2025-02-08 06:35:45,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2025-02-08 06:35:45,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-08 06:35:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:45,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:45,339 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((v_ArrVal_1026 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1026))) (store .cse1 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 0)))) (or (forall ((v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1029 Int)) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1025))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 v_ArrVal_1029))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1026 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1026))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3)) 1))))) is different from false [2025-02-08 06:35:45,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:45,614 INFO L378 Elim1Store]: Elim1 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 284 treesize of output 546 [2025-02-08 06:36:06,619 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_35| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1016 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_prenex_30 Int) (v_prenex_32 Int) (v_ArrVal_1019 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1016))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse0 (select (select (store (store .cse2 |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse3 .cse4 v_ArrVal_1019)) |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |v_ULTIMATE.start_main_~n~0#1.base_35|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (.cse1 (select (select (store (store .cse2 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse3 .cse4 v_prenex_30)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~tail~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_30) (= .cse0 v_prenex_30) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse3 .cse4 v_prenex_32)) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 0) (= v_prenex_30 .cse1)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_35| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_prenex_30 Int) (v_prenex_32 Int) (v_ArrVal_1018 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1016))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse9 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse6 (select (select (store (store .cse10 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse11 .cse9 v_prenex_32)) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse9 v_prenex_30)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (.cse7 (select (select (store (store .cse10 |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse11 .cse9 |v_ULTIMATE.start_main_~n~0#1.base_35|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_35| .cse6) (= .cse7 .cse6) (= |v_ULTIMATE.start_main_~n~0#1.base_35| v_prenex_30) (= (select (select (store (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1017))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse9 v_ArrVal_1018))) |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1025) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 0) (= .cse7 v_prenex_30) (= .cse7 |v_ULTIMATE.start_main_~n~0#1.base_35|) (= |v_ULTIMATE.start_main_~n~0#1.base_35| |c_ULTIMATE.start_main_~tail~0#1.base|) (= .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_35| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1019 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1016))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse16 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse12 (select (select (store (store .cse14 |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse15 .cse16 v_ArrVal_1019)) |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse16 |v_ULTIMATE.start_main_~n~0#1.base_35|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) (forall ((v_prenex_30 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_30) (forall ((v_prenex_31 (Array Int Int)) (v_prenex_32 Int)) (let ((.cse13 (select (select (store (store .cse14 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse15 .cse16 v_prenex_30)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= .cse12 .cse13) (= |c_ULTIMATE.start_main_~tail~0#1.base| .cse13) (= (select (select (store (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse15 .cse16 v_prenex_32)) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 0) (= v_prenex_30 .cse13))))))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_35| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1016 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_prenex_30 Int) (v_prenex_32 Int) (v_ArrVal_1019 Int)) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1016))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse21 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse18 (select (select (store (store .cse19 |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse20 .cse21 v_ArrVal_1019)) |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse21 |v_ULTIMATE.start_main_~n~0#1.base_35|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (.cse17 (select (select (store (store .cse19 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse20 .cse21 v_prenex_30)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| .cse17) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_30) (= .cse18 v_prenex_30) (= .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (store (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse20 .cse21 v_prenex_32)) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 0) (= v_prenex_30 .cse17)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_35| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1018 Int)) (let ((.cse26 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1016))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse23 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse25 (select (select (store (store .cse26 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse27 .cse23 v_prenex_30)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (.cse24 (select (select (store (store .cse26 |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse27 .cse23 |v_ULTIMATE.start_main_~n~0#1.base_35|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_30) (= (select (select (store (let ((.cse22 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1017))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse23 v_ArrVal_1018))) |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1025) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 0) (= .cse24 .cse25) (= |v_ULTIMATE.start_main_~n~0#1.base_35| .cse25) (= .cse24 |v_ULTIMATE.start_main_~n~0#1.base_35|) (= |v_ULTIMATE.start_main_~n~0#1.base_35| |c_ULTIMATE.start_main_~tail~0#1.base|) (= .cse24 |c_ULTIMATE.start_main_~tail~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_35| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1018 Int)) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1016))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse30 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse32 (select (select (store (store .cse28 |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse29 .cse30 |v_ULTIMATE.start_main_~n~0#1.base_35|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| (select (select (store (store .cse28 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse29 .cse30 v_prenex_30)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_30) (= (select (select (store (let ((.cse31 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1017))) (store .cse31 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse30 v_ArrVal_1018))) |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1025) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 0) (= .cse32 |v_ULTIMATE.start_main_~n~0#1.base_35|) (= |v_ULTIMATE.start_main_~n~0#1.base_35| |c_ULTIMATE.start_main_~tail~0#1.base|) (= .cse32 |c_ULTIMATE.start_main_~tail~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_35| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_prenex_30 Int) (v_prenex_32 Int) (v_ArrVal_1018 Int)) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1016))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse34 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse37 (select (select (store (store .cse35 |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse36 .cse34 |v_ULTIMATE.start_main_~n~0#1.base_35|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_35| v_prenex_30) (= (select (select (store (let ((.cse33 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1017))) (store .cse33 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse33 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse34 v_ArrVal_1018))) |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1025) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| (select (select (store (store .cse35 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store (store .cse35 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse36 .cse34 v_prenex_32)) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse34 v_prenex_30)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (= .cse37 v_prenex_30) (= .cse37 |v_ULTIMATE.start_main_~n~0#1.base_35|) (= |v_ULTIMATE.start_main_~n~0#1.base_35| |c_ULTIMATE.start_main_~tail~0#1.base|) (= .cse37 |c_ULTIMATE.start_main_~tail~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_35| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1019 Int)) (let ((.cse38 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1016))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse40 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (store (store .cse38 |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store (store .cse38 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse39 .cse40 v_ArrVal_1019)) |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse40 |v_ULTIMATE.start_main_~n~0#1.base_35|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) |c_ULTIMATE.start_main_~tail~0#1.base|) (forall ((v_prenex_30 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_30) (forall ((v_prenex_31 (Array Int Int)) (v_prenex_32 Int)) (let ((.cse41 (select (select (store (store .cse38 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse39 .cse40 v_prenex_30)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| .cse41) (= (select (select (store (store .cse38 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse39 .cse40 v_prenex_32)) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 0) (= v_prenex_30 .cse41)))))))))))) is different from false [2025-02-08 06:36:12,401 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:12,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:12,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-02-08 06:36:12,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:12,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 73 [2025-02-08 06:36:12,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 104 [2025-02-08 06:36:12,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2025-02-08 06:36:12,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2025-02-08 06:36:12,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-02-08 06:36:12,446 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:12,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-02-08 06:36:12,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:36:12,460 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:12,461 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:12,465 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-08 06:36:12,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 1 [2025-02-08 06:36:12,468 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:12,469 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:12,473 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-08 06:36:12,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 1 [2025-02-08 06:36:12,476 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:12,476 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:12,481 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-08 06:36:12,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 1 [2025-02-08 06:36:12,483 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:12,484 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:12,487 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-08 06:36:12,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 1 [2025-02-08 06:36:12,490 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:12,496 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-08 06:36:12,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 1 [2025-02-08 06:36:12,498 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:12,499 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:36:12,503 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-08 06:36:12,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 1 [2025-02-08 06:36:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-02-08 06:36:12,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803267124] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:36:12,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:36:12,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 16] total 38 [2025-02-08 06:36:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81593082] [2025-02-08 06:36:12,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:36:12,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-08 06:36:12,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:36:12,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-08 06:36:12,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1245, Unknown=25, NotChecked=146, Total=1560 [2025-02-08 06:36:12,763 INFO L87 Difference]: Start difference. First operand 432 states and 549 transitions. Second operand has 40 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 34 states have internal predecessors, (90), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:36:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:36:20,464 INFO L93 Difference]: Finished difference Result 473 states and 594 transitions. [2025-02-08 06:36:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 06:36:20,465 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 34 states have internal predecessors, (90), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-08 06:36:20,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:36:20,466 INFO L225 Difference]: With dead ends: 473 [2025-02-08 06:36:20,466 INFO L226 Difference]: Without dead ends: 471 [2025-02-08 06:36:20,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=336, Invalid=2509, Unknown=25, NotChecked=210, Total=3080 [2025-02-08 06:36:20,468 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 685 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 2135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 364 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:36:20,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 1037 Invalid, 2135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1634 Invalid, 0 Unknown, 364 Unchecked, 5.8s Time] [2025-02-08 06:36:20,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-02-08 06:36:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 450. [2025-02-08 06:36:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 350 states have (on average 1.2885714285714285) internal successors, (451), 382 states have internal predecessors, (451), 57 states have call successors, (57), 25 states have call predecessors, (57), 26 states have return successors, (62), 42 states have call predecessors, (62), 57 states have call successors, (62) [2025-02-08 06:36:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 570 transitions. [2025-02-08 06:36:20,479 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 570 transitions. Word has length 34 [2025-02-08 06:36:20,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:36:20,479 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 570 transitions. [2025-02-08 06:36:20,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 34 states have internal predecessors, (90), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:36:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 570 transitions. [2025-02-08 06:36:20,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 06:36:20,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:36:20,480 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:36:20,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 06:36:20,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:36:20,685 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting is_list_containing_xErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:36:20,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:36:20,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1133209929, now seen corresponding path program 1 times [2025-02-08 06:36:20,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:36:20,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830783720] [2025-02-08 06:36:20,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:36:20,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:36:20,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 06:36:20,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 06:36:20,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:36:20,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:36:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:36:21,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:36:21,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830783720] [2025-02-08 06:36:21,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830783720] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:36:21,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225754586] [2025-02-08 06:36:21,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:36:21,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:36:21,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:36:21,017 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:36:21,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:36:21,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 06:36:21,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 06:36:21,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:36:21,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:36:21,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-08 06:36:21,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:36:21,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:36:21,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:36:21,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:36:21,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-08 06:36:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:36:21,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:36:21,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-02-08 06:36:21,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:36:21,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:36:21,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:36:21,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:36:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:36:21,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225754586] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:36:21,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:36:21,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 29 [2025-02-08 06:36:21,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226721562] [2025-02-08 06:36:21,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:36:21,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-08 06:36:21,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:36:21,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-08 06:36:21,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2025-02-08 06:36:21,668 INFO L87 Difference]: Start difference. First operand 450 states and 570 transitions. Second operand has 30 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 24 states have internal predecessors, (90), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:36:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:36:22,454 INFO L93 Difference]: Finished difference Result 468 states and 588 transitions. [2025-02-08 06:36:22,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:36:22,455 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 24 states have internal predecessors, (90), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-08 06:36:22,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:36:22,457 INFO L225 Difference]: With dead ends: 468 [2025-02-08 06:36:22,457 INFO L226 Difference]: Without dead ends: 468 [2025-02-08 06:36:22,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=1097, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 06:36:22,458 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 254 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:36:22,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 976 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 06:36:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-02-08 06:36:22,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 450. [2025-02-08 06:36:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 350 states have (on average 1.2857142857142858) internal successors, (450), 382 states have internal predecessors, (450), 57 states have call successors, (57), 25 states have call predecessors, (57), 26 states have return successors, (62), 42 states have call predecessors, (62), 57 states have call successors, (62) [2025-02-08 06:36:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 569 transitions. [2025-02-08 06:36:22,466 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 569 transitions. Word has length 34 [2025-02-08 06:36:22,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:36:22,467 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 569 transitions. [2025-02-08 06:36:22,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 24 states have internal predecessors, (90), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:36:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 569 transitions. [2025-02-08 06:36:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:36:22,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:36:22,467 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:36:22,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 06:36:22,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-08 06:36:22,672 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:36:22,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:36:22,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1317425305, now seen corresponding path program 1 times [2025-02-08 06:36:22,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:36:22,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414637903] [2025-02-08 06:36:22,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:36:22,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:36:22,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:36:22,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:36:22,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:36:22,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:36:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:36:23,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:36:23,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414637903] [2025-02-08 06:36:23,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414637903] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:36:23,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459852231] [2025-02-08 06:36:23,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:36:23,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:36:23,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:36:23,184 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:36:23,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:36:23,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:36:23,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:36:23,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:36:23,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:36:23,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-08 06:36:23,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:36:23,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:36:23,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:36:23,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:36:23,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:36:23,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:36:23,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:36:23,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:36:23,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:36:23,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:36:23,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:36:23,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:36:23,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:36:23,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:36:23,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:36:23,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:36:23,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:36:23,547 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-02-08 06:36:23,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-02-08 06:36:23,559 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-02-08 06:36:23,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-02-08 06:36:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:36:23,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:36:25,907 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (and (forall ((v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1237 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1233))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_1237))) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1238 Int)) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1234))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_1238))) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) is different from false [2025-02-08 06:36:25,934 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_43| Int)) (or (forall ((v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1237 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_43| v_ArrVal_1233))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_1237))) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_43| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_43| Int)) (or (forall ((v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1238 Int)) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_43| v_ArrVal_1234))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_1238))) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_43| 1)))))) is different from false [2025-02-08 06:36:27,631 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_~tail~0#1.offset_17| |c_ULTIMATE.start_main_~#list~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_43| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_43| 1)) (forall ((v_ArrVal_1234 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_43| v_ArrVal_1234) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)))))) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_~tail~0#1.offset_17| |c_ULTIMATE.start_main_~#list~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_43| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_43| 1)) (forall ((v_ArrVal_1233 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_43| v_ArrVal_1233) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0))))))) is different from false [2025-02-08 06:36:35,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:36:35,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2025-02-08 06:36:35,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-02-08 06:36:35,279 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-02-08 06:36:35,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 06:36:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-08 06:36:36,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459852231] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:36:36,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:36:36,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 26 [2025-02-08 06:36:36,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144447878] [2025-02-08 06:36:36,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:36:36,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-08 06:36:36,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:36:36,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-08 06:36:36,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=413, Unknown=5, NotChecked=132, Total=650 [2025-02-08 06:36:36,446 INFO L87 Difference]: Start difference. First operand 450 states and 569 transitions. Second operand has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:36:37,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:36:37,146 INFO L93 Difference]: Finished difference Result 489 states and 596 transitions. [2025-02-08 06:36:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:36:37,147 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-02-08 06:36:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:36:37,148 INFO L225 Difference]: With dead ends: 489 [2025-02-08 06:36:37,148 INFO L226 Difference]: Without dead ends: 489 [2025-02-08 06:36:37,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=233, Invalid=704, Unknown=5, NotChecked=180, Total=1122 [2025-02-08 06:36:37,149 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 601 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 551 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:36:37,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 734 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 474 Invalid, 0 Unknown, 551 Unchecked, 0.4s Time] [2025-02-08 06:36:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-02-08 06:36:37,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 351. [2025-02-08 06:36:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 268 states have (on average 1.3022388059701493) internal successors, (349), 297 states have internal predecessors, (349), 45 states have call successors, (45), 20 states have call predecessors, (45), 21 states have return successors, (50), 33 states have call predecessors, (50), 45 states have call successors, (50) [2025-02-08 06:36:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 444 transitions. [2025-02-08 06:36:37,156 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 444 transitions. Word has length 33 [2025-02-08 06:36:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:36:37,156 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 444 transitions. [2025-02-08 06:36:37,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:36:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 444 transitions. [2025-02-08 06:36:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 06:36:37,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:36:37,157 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:36:37,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 06:36:37,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:36:37,361 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:36:37,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:36:37,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1219718424, now seen corresponding path program 1 times [2025-02-08 06:36:37,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:36:37,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442497476] [2025-02-08 06:36:37,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:36:37,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:36:37,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:36:37,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:36:37,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:36:37,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:36:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:36:37,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:36:37,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442497476] [2025-02-08 06:36:37,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442497476] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:36:37,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135316491] [2025-02-08 06:36:37,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:36:37,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:36:37,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:36:37,650 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:36:37,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:36:37,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:36:37,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:36:37,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:36:37,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:36:37,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-08 06:36:37,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:36:37,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:36:37,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:36:37,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:36:37,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 06:36:37,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:36:37,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 06:36:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:36:38,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:36:38,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135316491] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:36:38,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:36:38,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 28 [2025-02-08 06:36:38,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599294026] [2025-02-08 06:36:38,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:36:38,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 06:36:38,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:36:38,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 06:36:38,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2025-02-08 06:36:38,394 INFO L87 Difference]: Start difference. First operand 351 states and 444 transitions. Second operand has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:36:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:36:40,266 INFO L93 Difference]: Finished difference Result 477 states and 570 transitions. [2025-02-08 06:36:40,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-08 06:36:40,266 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2025-02-08 06:36:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:36:40,269 INFO L225 Difference]: With dead ends: 477 [2025-02-08 06:36:40,269 INFO L226 Difference]: Without dead ends: 477 [2025-02-08 06:36:40,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=448, Invalid=2858, Unknown=0, NotChecked=0, Total=3306 [2025-02-08 06:36:40,270 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 590 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:36:40,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1156 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 06:36:40,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-02-08 06:36:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 338. [2025-02-08 06:36:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 257 states have (on average 1.264591439688716) internal successors, (325), 283 states have internal predecessors, (325), 42 states have call successors, (42), 23 states have call predecessors, (42), 24 states have return successors, (45), 31 states have call predecessors, (45), 42 states have call successors, (45) [2025-02-08 06:36:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 412 transitions. [2025-02-08 06:36:40,283 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 412 transitions. Word has length 37 [2025-02-08 06:36:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:36:40,283 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 412 transitions. [2025-02-08 06:36:40,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:36:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 412 transitions. [2025-02-08 06:36:40,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 06:36:40,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:36:40,284 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:36:40,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 06:36:40,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:36:40,485 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:36:40,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:36:40,485 INFO L85 PathProgramCache]: Analyzing trace with hash -131099981, now seen corresponding path program 1 times [2025-02-08 06:36:40,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:36:40,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154718367] [2025-02-08 06:36:40,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:36:40,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:36:40,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:36:40,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:36:40,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:36:40,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:36:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:36:40,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:36:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154718367] [2025-02-08 06:36:40,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154718367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:36:40,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:36:40,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:36:40,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994217474] [2025-02-08 06:36:40,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:36:40,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:36:40,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:36:40,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:36:40,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:36:40,559 INFO L87 Difference]: Start difference. First operand 338 states and 412 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:36:40,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:36:40,595 INFO L93 Difference]: Finished difference Result 355 states and 431 transitions. [2025-02-08 06:36:40,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:36:40,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-02-08 06:36:40,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:36:40,596 INFO L225 Difference]: With dead ends: 355 [2025-02-08 06:36:40,596 INFO L226 Difference]: Without dead ends: 355 [2025-02-08 06:36:40,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:36:40,598 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:36:40,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 429 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:36:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-02-08 06:36:40,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 332. [2025-02-08 06:36:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 253 states have (on average 1.2648221343873518) internal successors, (320), 278 states have internal predecessors, (320), 41 states have call successors, (41), 22 states have call predecessors, (41), 23 states have return successors, (44), 31 states have call predecessors, (44), 41 states have call successors, (44) [2025-02-08 06:36:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 405 transitions. [2025-02-08 06:36:40,608 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 405 transitions. Word has length 41 [2025-02-08 06:36:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:36:40,609 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 405 transitions. [2025-02-08 06:36:40,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:36:40,609 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 405 transitions. [2025-02-08 06:36:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 06:36:40,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:36:40,609 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:36:40,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 06:36:40,609 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-08 06:36:40,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:36:40,609 INFO L85 PathProgramCache]: Analyzing trace with hash 396738619, now seen corresponding path program 1 times [2025-02-08 06:36:40,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:36:40,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172556698] [2025-02-08 06:36:40,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:36:40,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:36:40,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 06:36:40,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:36:40,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:36:40,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:36:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:36:40,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:36:40,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172556698] [2025-02-08 06:36:40,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172556698] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:36:40,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881248357] [2025-02-08 06:36:40,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:36:40,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:36:40,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:36:40,843 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:36:40,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 06:36:40,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 06:36:40,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:36:40,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:36:40,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:36:40,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-08 06:36:40,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:36:40,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:36:41,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:36:41,030 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:36:41,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2025-02-08 06:36:41,481 INFO L349 Elim1Store]: treesize reduction 3, result has 92.7 percent of original size [2025-02-08 06:36:41,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 64 [2025-02-08 06:36:41,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:36:41,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:36:41,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881248357] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:36:41,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:36:41,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2025-02-08 06:36:41,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440126863] [2025-02-08 06:36:41,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:36:41,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 06:36:41,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:36:41,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 06:36:41,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:36:41,575 INFO L87 Difference]: Start difference. First operand 332 states and 405 transitions. Second operand has 28 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 27 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:36:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:36:43,369 INFO L93 Difference]: Finished difference Result 414 states and 491 transitions. [2025-02-08 06:36:43,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-08 06:36:43,369 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 27 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 39 [2025-02-08 06:36:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:36:43,370 INFO L225 Difference]: With dead ends: 414 [2025-02-08 06:36:43,370 INFO L226 Difference]: Without dead ends: 414 [2025-02-08 06:36:43,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=361, Invalid=2395, Unknown=0, NotChecked=0, Total=2756 [2025-02-08 06:36:43,371 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 462 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 1563 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:36:43,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1376 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1563 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 06:36:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-02-08 06:36:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 335. [2025-02-08 06:36:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 256 states have (on average 1.265625) internal successors, (324), 281 states have internal predecessors, (324), 41 states have call successors, (41), 22 states have call predecessors, (41), 23 states have return successors, (44), 31 states have call predecessors, (44), 41 states have call successors, (44) [2025-02-08 06:36:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 409 transitions. [2025-02-08 06:36:43,399 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 409 transitions. Word has length 39 [2025-02-08 06:36:43,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:36:43,399 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 409 transitions. [2025-02-08 06:36:43,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 27 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:36:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 409 transitions. [2025-02-08 06:36:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 06:36:43,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:36:43,400 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:36:43,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0