./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 c00e63dc 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-?-c00e63d-m [2025-02-06 10:31:37,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:31:37,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:31:37,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:31:37,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:31:37,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:31:37,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:31:37,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:31:37,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:31:37,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:31:37,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:31:37,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:31:37,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:31:37,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:31:37,975 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:31:37,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:31:37,975 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:31:37,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:31:37,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:31:37,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:31:37,975 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:31:37,975 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:31:37,976 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:31:37,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:31:37,976 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:31:37,976 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:31:37,976 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:31:37,976 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:31:37,976 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:31:37,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:31:37,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:31:37,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:31:37,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:31:37,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:31:37,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:31:37,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:31:37,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:31:37,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:31:37,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:31:37,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:31:37,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:31:37,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:31:37,977 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-06 10:31:38,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:31:38,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:31:38,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:31:38,209 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:31:38,209 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:31:38,210 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-06 10:31:39,350 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa380faef/628f4cd0a71d42a0980bf1925dbc20fc/FLAG030890ccd [2025-02-06 10:31:39,699 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:31:39,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2025-02-06 10:31:39,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa380faef/628f4cd0a71d42a0980bf1925dbc20fc/FLAG030890ccd [2025-02-06 10:31:39,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa380faef/628f4cd0a71d42a0980bf1925dbc20fc [2025-02-06 10:31:39,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:31:39,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:31:39,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:31:39,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:31:39,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:31:39,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:31:39" (1/1) ... [2025-02-06 10:31:39,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ad8d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:39, skipping insertion in model container [2025-02-06 10:31:39,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:31:39" (1/1) ... [2025-02-06 10:31:39,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:31:40,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:31:40,277 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:31:40,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:31:40,321 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:31:40,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:40 WrapperNode [2025-02-06 10:31:40,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:31:40,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:31:40,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:31:40,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:31:40,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:40" (1/1) ... [2025-02-06 10:31:40,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:40" (1/1) ... [2025-02-06 10:31:40,350 INFO L138 Inliner]: procedures = 124, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 95 [2025-02-06 10:31:40,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:31:40,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:31:40,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:31:40,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:31:40,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:40" (1/1) ... [2025-02-06 10:31:40,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:40" (1/1) ... [2025-02-06 10:31:40,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:40" (1/1) ... [2025-02-06 10:31:40,369 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-06 10:31:40,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:40" (1/1) ... [2025-02-06 10:31:40,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:40" (1/1) ... [2025-02-06 10:31:40,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:40" (1/1) ... [2025-02-06 10:31:40,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:40" (1/1) ... [2025-02-06 10:31:40,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:40" (1/1) ... [2025-02-06 10:31:40,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:40" (1/1) ... [2025-02-06 10:31:40,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:31:40,380 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:31:40,380 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:31:40,380 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:31:40,381 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:40" (1/1) ... [2025-02-06 10:31:40,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:31:40,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:31:40,404 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-06 10:31:40,409 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-06 10:31:40,424 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2025-02-06 10:31:40,424 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2025-02-06 10:31:40,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 10:31:40,424 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 10:31:40,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:31:40,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:31:40,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:31:40,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:31:40,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:31:40,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:31:40,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:31:40,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:31:40,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:31:40,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:31:40,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:31:40,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:31:40,500 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:31:40,501 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:31:40,766 INFO L1309 $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-06 10:31:40,795 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-02-06 10:31:40,795 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:31:40,810 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:31:40,811 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:31:40,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:31:40 BoogieIcfgContainer [2025-02-06 10:31:40,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:31:40,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:31:40,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:31:40,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:31:40,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:31:39" (1/3) ... [2025-02-06 10:31:40,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4128c4e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:31:40, skipping insertion in model container [2025-02-06 10:31:40,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:40" (2/3) ... [2025-02-06 10:31:40,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4128c4e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:31:40, skipping insertion in model container [2025-02-06 10:31:40,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:31:40" (3/3) ... [2025-02-06 10:31:40,826 INFO L128 eAbstractionObserver]: Analyzing ICFG dancing.i [2025-02-06 10:31:40,843 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:31:40,844 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dancing.i that has 3 procedures, 110 locations, 1 initial locations, 1 loop locations, and 44 error locations. [2025-02-06 10:31:40,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:31:40,887 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;@1f4e4558, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:31:40,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-02-06 10:31:40,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 57 states have (on average 2.017543859649123) internal successors, (115), 101 states have internal predecessors, (115), 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-06 10:31:40,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:31:40,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:40,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:31:40,894 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-06 10:31:40,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:40,900 INFO L85 PathProgramCache]: Analyzing trace with hash 143952, now seen corresponding path program 1 times [2025-02-06 10:31:40,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:40,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474917999] [2025-02-06 10:31:40,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:40,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:40,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:31:40,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:31:40,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:40,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:41,060 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-06 10:31:41,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:41,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474917999] [2025-02-06 10:31:41,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474917999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:41,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:41,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:31:41,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025221345] [2025-02-06 10:31:41,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:41,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:31:41,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:41,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:31:41,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:31:41,089 INFO L87 Difference]: Start difference. First operand has 110 states, 57 states have (on average 2.017543859649123) internal successors, (115), 101 states have internal predecessors, (115), 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.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-06 10:31:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:41,196 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2025-02-06 10:31:41,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:31:41,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-02-06 10:31:41,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:41,203 INFO L225 Difference]: With dead ends: 107 [2025-02-06 10:31:41,204 INFO L226 Difference]: Without dead ends: 105 [2025-02-06 10:31:41,205 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-06 10:31:41,207 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 79 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:41,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 97 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:31:41,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-06 10:31:41,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-02-06 10:31:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 55 states have (on average 1.9272727272727272) internal successors, (106), 96 states have internal predecessors, (106), 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-06 10:31:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2025-02-06 10:31:41,242 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 3 [2025-02-06 10:31:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:41,242 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2025-02-06 10:31:41,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-06 10:31:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2025-02-06 10:31:41,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:31:41,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:41,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:31:41,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:31:41,243 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-06 10:31:41,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:41,244 INFO L85 PathProgramCache]: Analyzing trace with hash 143953, now seen corresponding path program 1 times [2025-02-06 10:31:41,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:41,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210904411] [2025-02-06 10:31:41,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:41,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:41,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:31:41,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:31:41,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:41,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:41,299 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-06 10:31:41,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:41,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210904411] [2025-02-06 10:31:41,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210904411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:41,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:41,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:31:41,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426678492] [2025-02-06 10:31:41,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:41,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:31:41,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:41,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:31:41,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:31:41,301 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-06 10:31:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:41,371 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2025-02-06 10:31:41,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:31:41,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-02-06 10:31:41,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:41,372 INFO L225 Difference]: With dead ends: 103 [2025-02-06 10:31:41,373 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 10:31:41,373 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-06 10:31:41,373 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 79 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:41,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 95 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:31:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 10:31:41,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-02-06 10:31:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 55 states have (on average 1.8909090909090909) 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-06 10:31:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2025-02-06 10:31:41,383 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 3 [2025-02-06 10:31:41,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:41,383 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2025-02-06 10:31:41,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-06 10:31:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2025-02-06 10:31:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:31:41,383 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:41,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:41,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:31:41,384 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-06 10:31:41,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:41,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2139193066, now seen corresponding path program 1 times [2025-02-06 10:31:41,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:41,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576004002] [2025-02-06 10:31:41,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:41,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:41,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:31:41,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:31:41,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:41,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:41,519 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-06 10:31:41,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:41,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576004002] [2025-02-06 10:31:41,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576004002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:41,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:41,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:31:41,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450011635] [2025-02-06 10:31:41,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:41,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:31:41,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:41,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:31:41,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:31:41,525 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-06 10:31:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:41,606 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2025-02-06 10:31:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:31:41,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 10:31:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:41,607 INFO L225 Difference]: With dead ends: 102 [2025-02-06 10:31:41,607 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 10:31:41,607 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-06 10:31:41,608 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 7 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:41,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 168 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:31:41,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 10:31:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-02-06 10:31:41,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 55 states have (on average 1.8545454545454545) 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-06 10:31:41,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2025-02-06 10:31:41,613 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 9 [2025-02-06 10:31:41,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:41,613 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2025-02-06 10:31:41,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-06 10:31:41,613 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2025-02-06 10:31:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:31:41,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:41,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:41,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:31:41,614 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-06 10:31:41,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:41,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2139193067, now seen corresponding path program 1 times [2025-02-06 10:31:41,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:41,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486799494] [2025-02-06 10:31:41,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:41,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:41,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:31:41,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:31:41,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:41,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:41,746 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-06 10:31:41,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:41,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486799494] [2025-02-06 10:31:41,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486799494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:41,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:41,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:31:41,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589805952] [2025-02-06 10:31:41,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:41,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:31:41,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:41,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:31:41,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:31:41,747 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-06 10:31:41,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:41,799 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2025-02-06 10:31:41,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:31:41,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 10:31:41,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:41,801 INFO L225 Difference]: With dead ends: 100 [2025-02-06 10:31:41,801 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 10:31:41,801 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-06 10:31:41,802 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:41,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 170 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:31:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 10:31:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-02-06 10:31:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.8181818181818181) 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-06 10:31:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2025-02-06 10:31:41,806 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 9 [2025-02-06 10:31:41,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:41,806 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2025-02-06 10:31:41,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-06 10:31:41,806 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2025-02-06 10:31:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:31:41,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:41,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:41,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:31:41,807 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-06 10:31:41,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:41,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1524698962, now seen corresponding path program 1 times [2025-02-06 10:31:41,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:41,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079382092] [2025-02-06 10:31:41,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:41,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:41,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:31:41,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:31:41,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:41,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:41,900 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-06 10:31:41,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:41,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079382092] [2025-02-06 10:31:41,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079382092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:41,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:41,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:31:41,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963121076] [2025-02-06 10:31:41,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:41,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:31:41,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:41,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:31:41,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:31:41,902 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-06 10:31:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:41,958 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2025-02-06 10:31:41,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:31:41,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 11 [2025-02-06 10:31:41,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:41,959 INFO L225 Difference]: With dead ends: 174 [2025-02-06 10:31:41,959 INFO L226 Difference]: Without dead ends: 174 [2025-02-06 10:31:41,959 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-06 10:31:41,960 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 73 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 403 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:41,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 403 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:31:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-06 10:31:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 142. [2025-02-06 10:31:41,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.89247311827957) internal successors, (176), 129 states have internal predecessors, (176), 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-06 10:31:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 196 transitions. [2025-02-06 10:31:41,968 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 196 transitions. Word has length 11 [2025-02-06 10:31:41,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:41,968 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 196 transitions. [2025-02-06 10:31:41,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-06 10:31:41,968 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 196 transitions. [2025-02-06 10:31:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:31:41,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:41,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:41,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:31:41,969 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-06 10:31:41,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:41,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1524796345, now seen corresponding path program 1 times [2025-02-06 10:31:41,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:41,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759211596] [2025-02-06 10:31:41,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:41,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:41,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:31:41,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:31:41,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:41,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:42,114 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-06 10:31:42,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:42,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759211596] [2025-02-06 10:31:42,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759211596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:42,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:42,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:31:42,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979412328] [2025-02-06 10:31:42,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:42,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:31:42,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:42,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:31:42,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:31:42,116 INFO L87 Difference]: Start difference. First operand 142 states and 196 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:31:42,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:42,191 INFO L93 Difference]: Finished difference Result 141 states and 194 transitions. [2025-02-06 10:31:42,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:31:42,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:31:42,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:42,193 INFO L225 Difference]: With dead ends: 141 [2025-02-06 10:31:42,193 INFO L226 Difference]: Without dead ends: 141 [2025-02-06 10:31:42,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-06 10:31:42,194 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 205 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:42,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 109 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:31:42,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-02-06 10:31:42,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-02-06 10:31:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 93 states have (on average 1.8709677419354838) internal successors, (174), 128 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-06 10:31:42,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 194 transitions. [2025-02-06 10:31:42,218 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 194 transitions. Word has length 11 [2025-02-06 10:31:42,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:42,218 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 194 transitions. [2025-02-06 10:31:42,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:31:42,219 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 194 transitions. [2025-02-06 10:31:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:31:42,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:42,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:42,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:31:42,219 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-06 10:31:42,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:42,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1524796344, now seen corresponding path program 1 times [2025-02-06 10:31:42,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:42,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84157189] [2025-02-06 10:31:42,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:42,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:42,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:31:42,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:31:42,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:42,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:42,416 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-06 10:31:42,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:42,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84157189] [2025-02-06 10:31:42,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84157189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:42,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:42,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:31:42,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704130383] [2025-02-06 10:31:42,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:42,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:31:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:42,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:31:42,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:31:42,418 INFO L87 Difference]: Start difference. First operand 141 states and 194 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:31:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:42,536 INFO L93 Difference]: Finished difference Result 140 states and 192 transitions. [2025-02-06 10:31:42,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:31:42,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:31:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:42,537 INFO L225 Difference]: With dead ends: 140 [2025-02-06 10:31:42,538 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 10:31:42,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:31:42,538 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 212 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:42,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 128 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:31:42,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 10:31:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-02-06 10:31:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 127 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-06 10:31:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2025-02-06 10:31:42,543 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 11 [2025-02-06 10:31:42,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:42,543 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2025-02-06 10:31:42,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:31:42,543 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2025-02-06 10:31:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:31:42,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:42,544 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:42,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:31:42,544 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-06 10:31:42,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:42,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1829005396, now seen corresponding path program 1 times [2025-02-06 10:31:42,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:42,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155893290] [2025-02-06 10:31:42,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:42,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:42,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:31:42,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:31:42,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:42,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:42,680 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-06 10:31:42,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:42,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155893290] [2025-02-06 10:31:42,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155893290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:42,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:42,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:31:42,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433174977] [2025-02-06 10:31:42,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:42,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:31:42,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:42,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:31:42,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:31:42,682 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-06 10:31:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:42,862 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2025-02-06 10:31:42,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:31:42,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 16 [2025-02-06 10:31:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:42,863 INFO L225 Difference]: With dead ends: 167 [2025-02-06 10:31:42,864 INFO L226 Difference]: Without dead ends: 167 [2025-02-06 10:31:42,864 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-06 10:31:42,865 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 271 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:42,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 190 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:31:42,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-06 10:31:42,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 140. [2025-02-06 10:31:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 127 states have internal predecessors, (166), 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-06 10:31:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 186 transitions. [2025-02-06 10:31:42,874 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 186 transitions. Word has length 16 [2025-02-06 10:31:42,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:42,874 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 186 transitions. [2025-02-06 10:31:42,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-06 10:31:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 186 transitions. [2025-02-06 10:31:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:31:42,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:42,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:42,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:31:42,875 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-06 10:31:42,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:42,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1829005395, now seen corresponding path program 1 times [2025-02-06 10:31:42,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:42,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90604531] [2025-02-06 10:31:42,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:42,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:42,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:31:42,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:31:42,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:42,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:42,943 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-06 10:31:42,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:42,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90604531] [2025-02-06 10:31:42,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90604531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:42,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:42,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:31:42,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773787550] [2025-02-06 10:31:42,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:42,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:31:42,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:42,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:31:42,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:31:42,944 INFO L87 Difference]: Start difference. First operand 140 states and 186 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-06 10:31:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:43,101 INFO L93 Difference]: Finished difference Result 155 states and 180 transitions. [2025-02-06 10:31:43,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:31:43,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 16 [2025-02-06 10:31:43,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:43,102 INFO L225 Difference]: With dead ends: 155 [2025-02-06 10:31:43,103 INFO L226 Difference]: Without dead ends: 155 [2025-02-06 10:31:43,103 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-06 10:31:43,103 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 146 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:43,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 225 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:31:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-06 10:31:43,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2025-02-06 10:31:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 93 states have (on average 1.6666666666666667) internal successors, (155), 122 states have internal predecessors, (155), 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-06 10:31:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2025-02-06 10:31:43,108 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 16 [2025-02-06 10:31:43,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:43,108 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2025-02-06 10:31:43,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-06 10:31:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2025-02-06 10:31:43,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:31:43,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:43,109 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] [2025-02-06 10:31:43,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:31:43,109 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-06 10:31:43,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:43,109 INFO L85 PathProgramCache]: Analyzing trace with hash 154637901, now seen corresponding path program 1 times [2025-02-06 10:31:43,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:43,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722434507] [2025-02-06 10:31:43,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:43,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:43,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:31:43,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:31:43,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:43,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:43,348 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-06 10:31:43,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722434507] [2025-02-06 10:31:43,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722434507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:43,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:43,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:31:43,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461517792] [2025-02-06 10:31:43,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:43,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:31:43,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:43,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:31:43,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:31:43,349 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-06 10:31:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:43,565 INFO L93 Difference]: Finished difference Result 184 states and 234 transitions. [2025-02-06 10:31:43,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:31:43,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 20 [2025-02-06 10:31:43,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:43,566 INFO L225 Difference]: With dead ends: 184 [2025-02-06 10:31:43,566 INFO L226 Difference]: Without dead ends: 184 [2025-02-06 10:31:43,566 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-06 10:31:43,566 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 119 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:43,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 460 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:31:43,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-06 10:31:43,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 144. [2025-02-06 10:31:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 101 states have (on average 1.6336633663366336) internal successors, (165), 130 states have internal predecessors, (165), 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-06 10:31:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 187 transitions. [2025-02-06 10:31:43,571 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 187 transitions. Word has length 20 [2025-02-06 10:31:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:43,571 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 187 transitions. [2025-02-06 10:31:43,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-06 10:31:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2025-02-06 10:31:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:31:43,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:43,572 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:43,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:31:43,572 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-06 10:31:43,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:43,573 INFO L85 PathProgramCache]: Analyzing trace with hash 916030610, now seen corresponding path program 1 times [2025-02-06 10:31:43,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:43,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931038207] [2025-02-06 10:31:43,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:43,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:31:43,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:31:43,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:43,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:43,649 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-06 10:31:43,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:43,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931038207] [2025-02-06 10:31:43,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931038207] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:31:43,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380485416] [2025-02-06 10:31:43,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:43,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:31:43,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:31:43,656 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-06 10:31:43,657 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-06 10:31:43,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:31:43,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:31:43,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:43,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:43,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 10:31:43,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:31:43,766 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-06 10:31:43,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:31:43,800 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 10:31:43,801 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-06 10:31:43,821 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-06 10:31:43,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380485416] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:31:43,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:31:43,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-02-06 10:31:43,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886431741] [2025-02-06 10:31:43,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:31:43,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:31:43,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:43,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:31:43,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:31:43,824 INFO L87 Difference]: Start difference. First operand 144 states and 187 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-06 10:31:43,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:43,987 INFO L93 Difference]: Finished difference Result 158 states and 206 transitions. [2025-02-06 10:31:43,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:31:43,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 20 [2025-02-06 10:31:43,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:43,989 INFO L225 Difference]: With dead ends: 158 [2025-02-06 10:31:43,989 INFO L226 Difference]: Without dead ends: 158 [2025-02-06 10:31:43,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 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-06 10:31:43,990 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 141 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:43,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 197 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:31:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-06 10:31:43,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2025-02-06 10:31:43,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 108 states have (on average 1.6203703703703705) internal successors, (175), 136 states have internal predecessors, (175), 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-06 10:31:43,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 199 transitions. [2025-02-06 10:31:43,994 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 199 transitions. Word has length 20 [2025-02-06 10:31:43,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:43,994 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 199 transitions. [2025-02-06 10:31:43,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-06 10:31:43,995 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 199 transitions. [2025-02-06 10:31:43,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:31:43,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:43,995 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:44,002 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-06 10:31:44,196 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-06 10:31:44,196 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-06 10:31:44,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash 916030611, now seen corresponding path program 1 times [2025-02-06 10:31:44,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:44,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38199749] [2025-02-06 10:31:44,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:44,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:44,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:31:44,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:31:44,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:44,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:44,322 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-06 10:31:44,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:44,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38199749] [2025-02-06 10:31:44,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38199749] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:31:44,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604943859] [2025-02-06 10:31:44,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:44,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:31:44,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:31:44,326 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-06 10:31:44,342 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-06 10:31:44,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:31:44,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:31:44,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:44,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:44,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 10:31:44,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:31:44,557 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-06 10:31:44,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:31:44,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:31:44,646 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-06 10:31:44,731 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-06 10:31:44,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604943859] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:31:44,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:31:44,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 16 [2025-02-06 10:31:44,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978734132] [2025-02-06 10:31:44,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:31:44,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 10:31:44,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:44,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 10:31:44,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:31:44,732 INFO L87 Difference]: Start difference. First operand 152 states and 199 transitions. Second operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 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-06 10:31:45,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:45,017 INFO L93 Difference]: Finished difference Result 156 states and 204 transitions. [2025-02-06 10:31:45,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:31:45,017 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 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 20 [2025-02-06 10:31:45,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:45,018 INFO L225 Difference]: With dead ends: 156 [2025-02-06 10:31:45,018 INFO L226 Difference]: Without dead ends: 156 [2025-02-06 10:31:45,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 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-06 10:31:45,019 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 220 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:45,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 355 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:31:45,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-06 10:31:45,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2025-02-06 10:31:45,023 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-06 10:31:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 196 transitions. [2025-02-06 10:31:45,024 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 196 transitions. Word has length 20 [2025-02-06 10:31:45,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:45,024 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 196 transitions. [2025-02-06 10:31:45,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 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-06 10:31:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 196 transitions. [2025-02-06 10:31:45,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:31:45,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:45,025 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] [2025-02-06 10:31:45,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:31:45,225 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-06 10:31:45,226 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-06 10:31:45,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:45,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1696760224, now seen corresponding path program 1 times [2025-02-06 10:31:45,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:45,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900998960] [2025-02-06 10:31:45,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:45,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:45,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:31:45,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:31:45,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:45,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:45,438 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-06 10:31:45,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:45,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900998960] [2025-02-06 10:31:45,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900998960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:45,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:45,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:31:45,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197126008] [2025-02-06 10:31:45,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:45,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:31:45,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:45,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:31:45,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:31:45,440 INFO L87 Difference]: Start difference. First operand 151 states and 196 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-06 10:31:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:45,566 INFO L93 Difference]: Finished difference Result 186 states and 237 transitions. [2025-02-06 10:31:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:31:45,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 22 [2025-02-06 10:31:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:45,567 INFO L225 Difference]: With dead ends: 186 [2025-02-06 10:31:45,567 INFO L226 Difference]: Without dead ends: 186 [2025-02-06 10:31:45,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:31:45,568 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 110 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:45,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 395 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:31:45,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-06 10:31:45,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 153. [2025-02-06 10:31:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 110 states have (on average 1.5818181818181818) internal successors, (174), 137 states have internal predecessors, (174), 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-06 10:31:45,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 198 transitions. [2025-02-06 10:31:45,572 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 198 transitions. Word has length 22 [2025-02-06 10:31:45,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:45,573 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 198 transitions. [2025-02-06 10:31:45,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-06 10:31:45,573 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 198 transitions. [2025-02-06 10:31:45,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:31:45,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:45,574 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] [2025-02-06 10:31:45,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:31:45,574 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-06 10:31:45,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:45,574 INFO L85 PathProgramCache]: Analyzing trace with hash 356426480, now seen corresponding path program 1 times [2025-02-06 10:31:45,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:45,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054692706] [2025-02-06 10:31:45,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:45,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:45,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:31:45,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:31:45,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:45,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:45,657 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-06 10:31:45,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:45,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054692706] [2025-02-06 10:31:45,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054692706] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:31:45,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793232424] [2025-02-06 10:31:45,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:45,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:31:45,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:31:45,662 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-06 10:31:45,664 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-06 10:31:45,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:31:45,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:31:45,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:45,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:45,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 10:31:45,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:31:45,812 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-06 10:31:45,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:31:45,948 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-06 10:31:45,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793232424] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:31:45,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:31:45,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-02-06 10:31:45,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111504192] [2025-02-06 10:31:45,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:31:45,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 10:31:45,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:45,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 10:31:45,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:31:45,949 INFO L87 Difference]: Start difference. First operand 153 states and 198 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 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-06 10:31:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:46,277 INFO L93 Difference]: Finished difference Result 180 states and 213 transitions. [2025-02-06 10:31:46,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:31:46,278 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 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 25 [2025-02-06 10:31:46,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:46,279 INFO L225 Difference]: With dead ends: 180 [2025-02-06 10:31:46,279 INFO L226 Difference]: Without dead ends: 178 [2025-02-06 10:31:46,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 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-06 10:31:46,279 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 349 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:46,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 583 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:31:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-06 10:31:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 153. [2025-02-06 10:31:46,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 110 states have (on average 1.5727272727272728) internal successors, (173), 137 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-06 10:31:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2025-02-06 10:31:46,284 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 197 transitions. Word has length 25 [2025-02-06 10:31:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:46,284 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 197 transitions. [2025-02-06 10:31:46,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 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-06 10:31:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2025-02-06 10:31:46,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:31:46,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:46,284 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] [2025-02-06 10:31:46,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 10:31:46,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:31:46,489 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting is_list_containing_xErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-06 10:31:46,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:46,490 INFO L85 PathProgramCache]: Analyzing trace with hash -680566950, now seen corresponding path program 1 times [2025-02-06 10:31:46,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:46,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386885596] [2025-02-06 10:31:46,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:46,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:46,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:31:46,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:31:46,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:46,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:46,944 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-06 10:31:46,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:46,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386885596] [2025-02-06 10:31:46,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386885596] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:31:46,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615987911] [2025-02-06 10:31:46,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:46,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:31:46,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:31:46,949 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-06 10:31:46,952 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-06 10:31:46,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:31:47,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:31:47,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:47,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:47,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-06 10:31:47,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:31:47,047 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-06 10:31:47,051 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-06 10:31:47,133 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-06 10:31:47,138 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-06 10:31:47,146 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-06 10:31:47,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:31:47,233 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-06 10:31:47,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:47,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:47,259 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-06 10:31:47,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615987911] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:31:47,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:31:47,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2025-02-06 10:31:47,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414839537] [2025-02-06 10:31:47,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:31:47,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 10:31:47,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:47,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 10:31:47,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:31:47,261 INFO L87 Difference]: Start difference. First operand 153 states and 197 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 13 states have internal predecessors, (44), 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-06 10:31:47,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:47,740 INFO L93 Difference]: Finished difference Result 228 states and 286 transitions. [2025-02-06 10:31:47,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:31:47,741 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 13 states have internal predecessors, (44), 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 26 [2025-02-06 10:31:47,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:47,742 INFO L225 Difference]: With dead ends: 228 [2025-02-06 10:31:47,742 INFO L226 Difference]: Without dead ends: 228 [2025-02-06 10:31:47,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-02-06 10:31:47,742 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 149 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:47,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1300 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:31:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-06 10:31:47,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 190. [2025-02-06 10:31:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 140 states have (on average 1.5571428571428572) internal successors, (218), 168 states have internal predecessors, (218), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 10:31:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 252 transitions. [2025-02-06 10:31:47,750 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 252 transitions. Word has length 26 [2025-02-06 10:31:47,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:47,750 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 252 transitions. [2025-02-06 10:31:47,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 13 states have internal predecessors, (44), 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-06 10:31:47,750 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 252 transitions. [2025-02-06 10:31:47,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:31:47,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:47,751 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-06 10:31:47,757 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-06 10:31:47,955 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,SelfDestructingSolverStorable14 [2025-02-06 10:31:47,955 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-02-06 10:31:47,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:47,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1532191949, now seen corresponding path program 1 times [2025-02-06 10:31:47,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:47,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811552088] [2025-02-06 10:31:47,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:47,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:47,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:31:47,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:31:47,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:47,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:47,997 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-06 10:31:47,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:47,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811552088] [2025-02-06 10:31:47,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811552088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:47,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:47,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:31:47,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904069114] [2025-02-06 10:31:47,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:47,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:31:47,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:47,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:31:47,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:31:47,999 INFO L87 Difference]: Start difference. First operand 190 states and 252 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-06 10:31:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:48,015 INFO L93 Difference]: Finished difference Result 200 states and 264 transitions. [2025-02-06 10:31:48,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:31:48,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 27 [2025-02-06 10:31:48,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:48,016 INFO L225 Difference]: With dead ends: 200 [2025-02-06 10:31:48,016 INFO L226 Difference]: Without dead ends: 200 [2025-02-06 10:31:48,016 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-06 10:31:48,017 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 3 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 393 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-06 10:31:48,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 393 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:31:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-06 10:31:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2025-02-06 10:31:48,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 143 states have (on average 1.5454545454545454) internal successors, (221), 174 states have internal predecessors, (221), 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-06 10:31:48,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 261 transitions. [2025-02-06 10:31:48,024 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 261 transitions. Word has length 27 [2025-02-06 10:31:48,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:48,025 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 261 transitions. [2025-02-06 10:31:48,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-06 10:31:48,025 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 261 transitions. [2025-02-06 10:31:48,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:31:48,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:48,026 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] [2025-02-06 10:31:48,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:31:48,026 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-06 10:31:48,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:48,026 INFO L85 PathProgramCache]: Analyzing trace with hash 254363122, now seen corresponding path program 1 times [2025-02-06 10:31:48,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:48,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126930272] [2025-02-06 10:31:48,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:48,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:31:48,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:31:48,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:48,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:48,073 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-06 10:31:48,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:48,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126930272] [2025-02-06 10:31:48,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126930272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:48,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:48,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:31:48,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556581912] [2025-02-06 10:31:48,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:48,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:31:48,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:48,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:31:48,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:31:48,075 INFO L87 Difference]: Start difference. First operand 197 states and 261 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-06 10:31:48,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:48,211 INFO L93 Difference]: Finished difference Result 210 states and 258 transitions. [2025-02-06 10:31:48,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:31:48,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 28 [2025-02-06 10:31:48,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:48,212 INFO L225 Difference]: With dead ends: 210 [2025-02-06 10:31:48,212 INFO L226 Difference]: Without dead ends: 210 [2025-02-06 10:31:48,213 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-06 10:31:48,213 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 134 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:48,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 232 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:31:48,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-06 10:31:48,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 194. [2025-02-06 10:31:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 171 states have internal predecessors, (213), 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-06 10:31:48,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 253 transitions. [2025-02-06 10:31:48,218 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 253 transitions. Word has length 28 [2025-02-06 10:31:48,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:48,218 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 253 transitions. [2025-02-06 10:31:48,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-06 10:31:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 253 transitions. [2025-02-06 10:31:48,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:31:48,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:48,219 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] [2025-02-06 10:31:48,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:31:48,219 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-06 10:31:48,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:48,219 INFO L85 PathProgramCache]: Analyzing trace with hash 254363123, now seen corresponding path program 1 times [2025-02-06 10:31:48,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:48,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242541978] [2025-02-06 10:31:48,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:48,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:48,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:31:48,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:31:48,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:48,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:48,294 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-06 10:31:48,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:48,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242541978] [2025-02-06 10:31:48,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242541978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:48,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:48,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:31:48,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250620807] [2025-02-06 10:31:48,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:48,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:31:48,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:48,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:31:48,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:31:48,295 INFO L87 Difference]: Start difference. First operand 194 states and 253 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-06 10:31:48,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:48,437 INFO L93 Difference]: Finished difference Result 207 states and 254 transitions. [2025-02-06 10:31:48,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:31:48,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 28 [2025-02-06 10:31:48,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:48,438 INFO L225 Difference]: With dead ends: 207 [2025-02-06 10:31:48,438 INFO L226 Difference]: Without dead ends: 207 [2025-02-06 10:31:48,438 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-06 10:31:48,439 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 196 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:48,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 179 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:31:48,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-02-06 10:31:48,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2025-02-06 10:31:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 143 states have (on average 1.4615384615384615) internal successors, (209), 171 states have internal predecessors, (209), 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-06 10:31:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 249 transitions. [2025-02-06 10:31:48,443 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 249 transitions. Word has length 28 [2025-02-06 10:31:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:48,444 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 249 transitions. [2025-02-06 10:31:48,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-06 10:31:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 249 transitions. [2025-02-06 10:31:48,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:31:48,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:48,444 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] [2025-02-06 10:31:48,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:31:48,444 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-06 10:31:48,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:48,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1786835440, now seen corresponding path program 1 times [2025-02-06 10:31:48,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:48,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116895367] [2025-02-06 10:31:48,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:48,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:48,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:31:48,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:31:48,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:48,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:48,540 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-06 10:31:48,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:48,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116895367] [2025-02-06 10:31:48,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116895367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:48,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:48,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:31:48,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528793494] [2025-02-06 10:31:48,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:48,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:31:48,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:48,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:31:48,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:31:48,542 INFO L87 Difference]: Start difference. First operand 194 states and 249 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-06 10:31:48,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:48,688 INFO L93 Difference]: Finished difference Result 201 states and 246 transitions. [2025-02-06 10:31:48,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:31:48,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 27 [2025-02-06 10:31:48,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:48,689 INFO L225 Difference]: With dead ends: 201 [2025-02-06 10:31:48,689 INFO L226 Difference]: Without dead ends: 201 [2025-02-06 10:31:48,690 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-06 10:31:48,691 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 66 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:48,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 306 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:31:48,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-06 10:31:48,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 188. [2025-02-06 10:31:48,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 143 states have (on average 1.4055944055944056) internal successors, (201), 165 states have internal predecessors, (201), 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-06 10:31:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 241 transitions. [2025-02-06 10:31:48,697 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 241 transitions. Word has length 27 [2025-02-06 10:31:48,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:48,697 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 241 transitions. [2025-02-06 10:31:48,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-06 10:31:48,697 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 241 transitions. [2025-02-06 10:31:48,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:31:48,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:48,698 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] [2025-02-06 10:31:48,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:31:48,698 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-06 10:31:48,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:48,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1786835441, now seen corresponding path program 1 times [2025-02-06 10:31:48,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:48,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503551940] [2025-02-06 10:31:48,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:48,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:48,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:31:48,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:31:48,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:48,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:48,739 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-06 10:31:48,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:48,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503551940] [2025-02-06 10:31:48,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503551940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:48,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:48,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:31:48,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984643700] [2025-02-06 10:31:48,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:48,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:31:48,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:48,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:31:48,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:31:48,741 INFO L87 Difference]: Start difference. First operand 188 states and 241 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-06 10:31:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:48,859 INFO L93 Difference]: Finished difference Result 199 states and 244 transitions. [2025-02-06 10:31:48,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:31:48,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 27 [2025-02-06 10:31:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:48,860 INFO L225 Difference]: With dead ends: 199 [2025-02-06 10:31:48,860 INFO L226 Difference]: Without dead ends: 199 [2025-02-06 10:31:48,860 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-06 10:31:48,861 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 71 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:48,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 297 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:31:48,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-06 10:31:48,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2025-02-06 10:31:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 143 states have (on average 1.3916083916083917) internal successors, (199), 164 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-06 10:31:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 239 transitions. [2025-02-06 10:31:48,869 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 239 transitions. Word has length 27 [2025-02-06 10:31:48,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:48,869 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 239 transitions. [2025-02-06 10:31:48,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-06 10:31:48,869 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 239 transitions. [2025-02-06 10:31:48,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:31:48,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:48,870 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] [2025-02-06 10:31:48,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 10:31:48,870 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-06 10:31:48,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:48,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1895497494, now seen corresponding path program 1 times [2025-02-06 10:31:48,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:48,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606987807] [2025-02-06 10:31:48,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:48,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:48,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:31:48,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:31:48,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:48,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:49,046 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-06 10:31:49,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:49,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606987807] [2025-02-06 10:31:49,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606987807] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:31:49,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492123509] [2025-02-06 10:31:49,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:49,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:31:49,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:31:49,048 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-06 10:31:49,052 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-06 10:31:49,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:31:49,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:31:49,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:49,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:49,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 10:31:49,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:31:49,139 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-06 10:31:49,173 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-06 10:31:49,244 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-06 10:31:49,246 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-06 10:31:49,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:31:49,266 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-06 10:31:49,332 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-06 10:31:49,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492123509] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:31:49,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:31:49,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 15 [2025-02-06 10:31:49,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758930009] [2025-02-06 10:31:49,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:31:49,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 10:31:49,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:49,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 10:31:49,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:31:49,333 INFO L87 Difference]: Start difference. First operand 187 states and 239 transitions. Second operand has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 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-06 10:31:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:49,779 INFO L93 Difference]: Finished difference Result 310 states and 373 transitions. [2025-02-06 10:31:49,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:31:49,779 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 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 29 [2025-02-06 10:31:49,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:49,781 INFO L225 Difference]: With dead ends: 310 [2025-02-06 10:31:49,781 INFO L226 Difference]: Without dead ends: 310 [2025-02-06 10:31:49,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 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-06 10:31:49,782 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 289 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:49,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 737 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:31:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-06 10:31:49,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 253. [2025-02-06 10:31:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 193 states have (on average 1.3678756476683938) internal successors, (264), 218 states have internal predecessors, (264), 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-06 10:31:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 326 transitions. [2025-02-06 10:31:49,792 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 326 transitions. Word has length 29 [2025-02-06 10:31:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:49,792 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 326 transitions. [2025-02-06 10:31:49,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 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-06 10:31:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 326 transitions. [2025-02-06 10:31:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:31:49,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:49,794 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] [2025-02-06 10:31:49,800 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-06 10:31:49,994 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-06 10:31:49,994 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-06 10:31:49,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:49,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1895497493, now seen corresponding path program 1 times [2025-02-06 10:31:49,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:49,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274946896] [2025-02-06 10:31:49,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:49,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:50,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:31:50,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:31:50,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:50,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:50,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-06 10:31:50,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:50,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274946896] [2025-02-06 10:31:50,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274946896] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:31:50,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356712199] [2025-02-06 10:31:50,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:50,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:31:50,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:31:50,627 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-06 10:31:50,628 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-06 10:31:50,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:31:50,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:31:50,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:50,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:50,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-06 10:31:50,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:31:50,730 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-06 10:31:50,733 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-06 10:31:50,785 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-06 10:31:50,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:50,830 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-06 10:31:50,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:50,839 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-06 10:31:50,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:50,856 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-06 10:31:50,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:50,863 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-06 10:31:50,889 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-06 10:31:50,890 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-06 10:31:50,902 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2025-02-06 10:31:50,902 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-06 10:31:51,506 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-06 10:31:51,511 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-06 10:31:51,533 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-06 10:31:51,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:31:51,982 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-06 10:31:52,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:31:52,119 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-06 10:31:52,680 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_2))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 5)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int) (v_ArrVal_695 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_695) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_8))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_6 4) |v_ULTIMATE.start_main_~n~0#1.base_30|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_5 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_5) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (< 0 (+ (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_4))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_3 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 1))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (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_30| 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|) .cse1) 5)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_6 Int) (v_prenex_7 (Array Int Int))) (< (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_7))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_6 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 5)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_1 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_30| v_prenex_8) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (or (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_695))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_30|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) .cse7) (= .cse7 0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int)) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_8))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_30| (select (select (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_6 4) |v_ULTIMATE.start_main_~n~0#1.base_30|)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)) (= (select (select .cse8 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_1 Int) (v_ArrVal_695 (Array Int Int))) (= (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_695))) (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) |v_ULTIMATE.start_main_~n~0#1.base_30|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) |v_ULTIMATE.start_main_~n~0#1.base_30|)) (forall ((v_prenex_2 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_2) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int))) (<= 0 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_696))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |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|) .cse1))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (< (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_2))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 5)) (forall ((v_ArrVal_695 (Array Int Int))) (not (= |v_ULTIMATE.start_main_~n~0#1.base_30| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_695) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int) (v_prenex_1 Int) (v_ArrVal_695 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_695))) (or (= (select (select .cse12 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_8))) (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) |v_ULTIMATE.start_main_~n~0#1.base_30|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)) (= (select (select (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_30|)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) |v_ULTIMATE.start_main_~n~0#1.base_30|)))) (forall ((v_prenex_2 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_2) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_6 Int) (v_prenex_7 (Array Int Int))) (< (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_7))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_6 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 5)) (forall ((v_prenex_8 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_8) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int) (v_prenex_1 Int) (v_ArrVal_695 (Array Int Int))) (= (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_695))) (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_30|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) (select (select (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_8))) (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_6 4) |v_ULTIMATE.start_main_~n~0#1.base_30|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (forall ((v_prenex_5 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_5) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (< 0 (+ (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_4))) (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_3 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 1))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int) (v_prenex_1 Int) (v_ArrVal_695 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_8))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (or (= (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_695))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_30|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) .cse19) (= |v_ULTIMATE.start_main_~n~0#1.base_30| (select (select (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_6 4) |v_ULTIMATE.start_main_~n~0#1.base_30|)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)) (= .cse19 0))))))))) is different from false [2025-02-06 10:31:54,259 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_30| Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int) (v_prenex_1 Int) (v_ArrVal_695 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_30|) .cse0) (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_8) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_6 4) |v_ULTIMATE.start_main_~n~0#1.base_30|) .cse0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_5 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_5) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0)) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_4) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_3 4) 0) .cse0) 1))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_696) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0) .cse0))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int)) (let ((.cse1 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_8) |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= (select .cse1 .cse0) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_30| (select (store .cse1 (+ v_prenex_6 4) |v_ULTIMATE.start_main_~n~0#1.base_30|) .cse0))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_1 Int) (v_ArrVal_695 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_8) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (= .cse2 0) (= (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_30|) .cse0) .cse2)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_6 Int) (v_prenex_7 (Array Int Int))) (< (select (store (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_7) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_6 4) 0) .cse0) 5)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (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_30| v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_1 4) 0) .cse0) 5)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int) (v_ArrVal_695 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_8) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_6 4) |v_ULTIMATE.start_main_~n~0#1.base_30|) .cse0) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int) (v_prenex_1 Int) (v_ArrVal_695 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_8) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_6 4) |v_ULTIMATE.start_main_~n~0#1.base_30|) .cse0) (select .cse3 .cse0)) (= (select (store .cse3 (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_30|) .cse0) |v_ULTIMATE.start_main_~n~0#1.base_30|)))) (forall ((v_prenex_2 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_5 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_5) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0)) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_4) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_3 4) 0) .cse0) 1))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int) (v_prenex_1 Int) (v_ArrVal_695 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_8) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse4 (select .cse5 .cse0))) (or (= .cse4 0) (= (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_30|) .cse0) .cse4) (= |v_ULTIMATE.start_main_~n~0#1.base_30| (select (store .cse5 (+ v_prenex_6 4) |v_ULTIMATE.start_main_~n~0#1.base_30|) .cse0)))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_6 Int) (v_prenex_7 (Array Int Int))) (< (select (store (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_7) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_6 4) 0) .cse0) 5)) (forall ((v_prenex_8 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_8) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_2 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0)) (forall ((v_prenex_1 Int) (v_ArrVal_695 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_30|) .cse0) |v_ULTIMATE.start_main_~n~0#1.base_30|)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (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_30| v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_1 4) 0) .cse0) 5)) (forall ((v_ArrVal_695 (Array Int Int))) (not (= |v_ULTIMATE.start_main_~n~0#1.base_30| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (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_30| v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_1 4) 0) .cse0) 5)))))) is different from false [2025-02-06 10:31:54,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:31:54,309 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-06 10:31:54,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:54,314 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 23 treesize of output 17 [2025-02-06 10:31:54,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:31:54,320 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 22 treesize of output 23 [2025-02-06 10:31:54,324 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 36 treesize of output 24 [2025-02-06 10:31:54,327 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 16 treesize of output 12 [2025-02-06 10:31:54,337 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-06 10:31:54,337 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-06 10:31:54,340 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-06 10:31:54,345 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-06 10:31:54,345 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 1 [2025-02-06 10:31:54,351 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-06 10:31:54,351 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 1 [2025-02-06 10:31:54,354 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-06 10:31:54,358 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-06 10:31:54,362 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-06 10:31:54,363 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 1 [2025-02-06 10:31:54,369 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-06 10:31:54,370 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-06 10:31:54,378 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-06 10:31:54,381 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-06 10:31:54,388 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-06 10:31:54,426 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-06 10:31:54,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356712199] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:31:54,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:31:54,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 35 [2025-02-06 10:31:54,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999499495] [2025-02-06 10:31:54,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:31:54,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 10:31:54,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:54,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 10:31:54,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=950, Unknown=3, NotChecked=192, Total=1260 [2025-02-06 10:31:54,427 INFO L87 Difference]: Start difference. First operand 253 states and 326 transitions. Second operand has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 36 states have internal predecessors, (76), 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-06 10:31:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:58,658 INFO L93 Difference]: Finished difference Result 520 states and 641 transitions. [2025-02-06 10:31:58,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-06 10:31:58,659 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 36 states have internal predecessors, (76), 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 29 [2025-02-06 10:31:58,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:58,661 INFO L225 Difference]: With dead ends: 520 [2025-02-06 10:31:58,661 INFO L226 Difference]: Without dead ends: 520 [2025-02-06 10:31:58,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=666, Invalid=3003, Unknown=3, NotChecked=360, Total=4032 [2025-02-06 10:31:58,665 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 1230 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 2779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1206 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:58,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 1053 Invalid, 2779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1372 Invalid, 0 Unknown, 1206 Unchecked, 1.6s Time] [2025-02-06 10:31:58,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-02-06 10:31:58,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 373. [2025-02-06 10:31:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 287 states have (on average 1.3310104529616724) internal successors, (382), 318 states have internal predecessors, (382), 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-06 10:31:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2025-02-06 10:31:58,685 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 29 [2025-02-06 10:31:58,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:58,686 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2025-02-06 10:31:58,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 36 states have internal predecessors, (76), 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-06 10:31:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2025-02-06 10:31:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:31:58,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:58,687 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] [2025-02-06 10:31:58,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 10:31:58,891 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-06 10:31:58,891 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-06 10:31:58,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:58,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1409468182, now seen corresponding path program 1 times [2025-02-06 10:31:58,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:58,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592674079] [2025-02-06 10:31:58,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:58,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:58,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:31:58,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:31:58,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:58,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:59,065 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-06 10:31:59,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:59,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592674079] [2025-02-06 10:31:59,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592674079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:59,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:59,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:31:59,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501378074] [2025-02-06 10:31:59,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:59,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:31:59,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:59,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:31:59,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:31:59,066 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-06 10:31:59,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:59,282 INFO L93 Difference]: Finished difference Result 408 states and 528 transitions. [2025-02-06 10:31:59,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:31:59,282 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 31 [2025-02-06 10:31:59,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:59,284 INFO L225 Difference]: With dead ends: 408 [2025-02-06 10:31:59,284 INFO L226 Difference]: Without dead ends: 408 [2025-02-06 10:31:59,285 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-06 10:31:59,285 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 102 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:59,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 351 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:31:59,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-02-06 10:31:59,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 391. [2025-02-06 10:31:59,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 299 states have (on average 1.3244147157190636) internal successors, (396), 332 states have internal predecessors, (396), 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-06 10:31:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 506 transitions. [2025-02-06 10:31:59,297 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 506 transitions. Word has length 31 [2025-02-06 10:31:59,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:59,297 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 506 transitions. [2025-02-06 10:31:59,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-06 10:31:59,298 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 506 transitions. [2025-02-06 10:31:59,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:31:59,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:59,298 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] [2025-02-06 10:31:59,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 10:31:59,299 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-06 10:31:59,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:59,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2068262432, now seen corresponding path program 1 times [2025-02-06 10:31:59,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:59,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932667918] [2025-02-06 10:31:59,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:59,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:59,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:31:59,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:31:59,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:59,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:59,330 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-06 10:31:59,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:59,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932667918] [2025-02-06 10:31:59,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932667918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:59,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:59,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:31:59,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900399300] [2025-02-06 10:31:59,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:59,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:31:59,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:59,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:31:59,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:31:59,332 INFO L87 Difference]: Start difference. First operand 391 states and 506 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-06 10:31:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:59,357 INFO L93 Difference]: Finished difference Result 387 states and 481 transitions. [2025-02-06 10:31:59,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:31:59,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 33 [2025-02-06 10:31:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:59,359 INFO L225 Difference]: With dead ends: 387 [2025-02-06 10:31:59,359 INFO L226 Difference]: Without dead ends: 387 [2025-02-06 10:31:59,359 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-06 10:31:59,359 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 38 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 259 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-06 10:31:59,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 259 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:31:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-02-06 10:31:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 373. [2025-02-06 10:31:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 293 states have (on average 1.310580204778157) internal successors, (384), 320 states have internal predecessors, (384), 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-06 10:31:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 470 transitions. [2025-02-06 10:31:59,370 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 470 transitions. Word has length 33 [2025-02-06 10:31:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:59,370 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 470 transitions. [2025-02-06 10:31:59,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-06 10:31:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 470 transitions. [2025-02-06 10:31:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:31:59,370 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:59,370 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] [2025-02-06 10:31:59,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 10:31:59,371 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-06 10:31:59,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2077164023, now seen corresponding path program 1 times [2025-02-06 10:31:59,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:59,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476140456] [2025-02-06 10:31:59,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:59,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:59,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:31:59,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:31:59,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:59,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:59,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-06 10:31:59,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:59,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476140456] [2025-02-06 10:31:59,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476140456] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:31:59,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025826138] [2025-02-06 10:31:59,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:59,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:31:59,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:31:59,549 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-06 10:31:59,553 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-06 10:31:59,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:31:59,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:31:59,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:59,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:59,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-06 10:31:59,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:31:59,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 11 treesize of output 7 [2025-02-06 10:31:59,692 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-06 10:31:59,725 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:31:59,725 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-06 10:31:59,739 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:31:59,739 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-06 10:32:00,003 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-06 10:32:00,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:32:00,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:32:00,453 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-06 10:32:00,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:32:00,458 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 63 treesize of output 64 [2025-02-06 10:32:00,464 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-02-06 10:32:00,465 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 107 treesize of output 83 [2025-02-06 10:32:00,468 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 94 treesize of output 82 [2025-02-06 10:32:00,475 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 69 treesize of output 65 [2025-02-06 10:32:00,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:32:00,485 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 65 treesize of output 66 [2025-02-06 10:32:00,491 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 57 treesize of output 53 [2025-02-06 10:32:00,544 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-06 10:32:00,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025826138] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:32:00,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:32:00,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 31 [2025-02-06 10:32:00,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853165067] [2025-02-06 10:32:00,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:32:00,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 10:32:00,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:32:00,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 10:32:00,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=827, Unknown=1, NotChecked=0, Total=930 [2025-02-06 10:32:00,546 INFO L87 Difference]: Start difference. First operand 373 states and 470 transitions. Second operand has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 states have internal predecessors, (70), 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-06 10:32:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:32:01,774 INFO L93 Difference]: Finished difference Result 498 states and 628 transitions. [2025-02-06 10:32:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:32:01,775 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 states have internal predecessors, (70), 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 31 [2025-02-06 10:32:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:32:01,777 INFO L225 Difference]: With dead ends: 498 [2025-02-06 10:32:01,777 INFO L226 Difference]: Without dead ends: 492 [2025-02-06 10:32:01,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=265, Invalid=1714, Unknown=1, NotChecked=0, Total=1980 [2025-02-06 10:32:01,778 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 338 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:32:01,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1359 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 10:32:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-02-06 10:32:01,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 396. [2025-02-06 10:32:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 308 states have (on average 1.3149350649350648) internal successors, (405), 339 states have internal predecessors, (405), 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-06 10:32:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 507 transitions. [2025-02-06 10:32:01,786 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 507 transitions. Word has length 31 [2025-02-06 10:32:01,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:32:01,786 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 507 transitions. [2025-02-06 10:32:01,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 states have internal predecessors, (70), 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-06 10:32:01,786 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 507 transitions. [2025-02-06 10:32:01,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:32:01,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:32:01,787 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] [2025-02-06 10:32:01,796 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-06 10:32:01,987 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-06 10:32:01,989 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-06 10:32:01,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:32:01,990 INFO L85 PathProgramCache]: Analyzing trace with hash -486885955, now seen corresponding path program 1 times [2025-02-06 10:32:01,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:32:01,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286286761] [2025-02-06 10:32:01,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:01,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:32:01,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:32:02,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:32:02,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:02,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:02,320 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-06 10:32:02,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:32:02,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286286761] [2025-02-06 10:32:02,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286286761] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:32:02,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291498083] [2025-02-06 10:32:02,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:02,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:32:02,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:32:02,324 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-06 10:32:02,325 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-06 10:32:02,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:32:02,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:32:02,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:02,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:02,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 10:32:02,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:32:02,438 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-06 10:32:02,441 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-06 10:32:02,458 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-06 10:32:02,462 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-06 10:32:02,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:32:02,533 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-06 10:32:02,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:32:02,539 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-06 10:32:02,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:32:02,551 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-06 10:32:02,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:32:02,555 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-06 10:32:02,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:32:02,596 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-06 10:32:02,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:32:02,600 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-06 10:32:02,676 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-06 10:32:02,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:32:02,756 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (and (forall ((v_ArrVal_885 Int) (v_ArrVal_882 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| 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)) (forall ((v_ArrVal_884 Int) (v_ArrVal_881 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| 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)))) is different from false [2025-02-06 10:32:02,781 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_37| Int)) (or (forall ((v_ArrVal_884 Int) (v_ArrVal_881 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_37| v_ArrVal_881))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |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_37| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_37| Int)) (or (forall ((v_ArrVal_885 Int) (v_ArrVal_882 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_37| v_ArrVal_882))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |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_37| 1)))))) is different from false [2025-02-06 10:32:04,320 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_18| Int)) (or (forall ((|v_ULTIMATE.start_main_~n~0#1.base_37| 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_37| 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_37| 1)))) (< |v_ULTIMATE.start_main_~tail~0#1.offset_18| |c_ULTIMATE.start_main_~#list~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_~tail~0#1.offset_18| |c_ULTIMATE.start_main_~#list~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_37| 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_37| 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_37| 1))))))) is different from false [2025-02-06 10:32:05,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:32:05,598 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-06 10:32:05,601 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-06 10:32:05,609 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-02-06 10:32:05,609 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-06 10:32:06,697 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-06 10:32:06,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291498083] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:32:06,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:32:06,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-02-06 10:32:06,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222636026] [2025-02-06 10:32:06,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:32:06,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 10:32:06,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:32:06,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 10:32:06,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=304, Unknown=5, NotChecked=114, Total=506 [2025-02-06 10:32:06,701 INFO L87 Difference]: Start difference. First operand 396 states and 507 transitions. Second operand has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 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-06 10:32:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:32:07,238 INFO L93 Difference]: Finished difference Result 458 states and 564 transitions. [2025-02-06 10:32:07,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:32:07,241 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 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 31 [2025-02-06 10:32:07,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:32:07,243 INFO L225 Difference]: With dead ends: 458 [2025-02-06 10:32:07,243 INFO L226 Difference]: Without dead ends: 458 [2025-02-06 10:32:07,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=188, Invalid=521, Unknown=5, NotChecked=156, Total=870 [2025-02-06 10:32:07,243 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 484 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 589 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:32:07,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 794 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 508 Invalid, 0 Unknown, 589 Unchecked, 0.3s Time] [2025-02-06 10:32:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-02-06 10:32:07,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 408. [2025-02-06 10:32:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 317 states have (on average 1.3028391167192428) internal successors, (413), 349 states have internal predecessors, (413), 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-06 10:32:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 517 transitions. [2025-02-06 10:32:07,254 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 517 transitions. Word has length 31 [2025-02-06 10:32:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:32:07,254 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 517 transitions. [2025-02-06 10:32:07,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 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-06 10:32:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 517 transitions. [2025-02-06 10:32:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:32:07,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:32:07,255 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, 1] [2025-02-06 10:32:07,262 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-06 10:32:07,459 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-06 10:32:07,459 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-06 10:32:07,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:32:07,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1584964533, now seen corresponding path program 1 times [2025-02-06 10:32:07,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:32:07,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514127651] [2025-02-06 10:32:07,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:07,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:32:07,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:32:07,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:32:07,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:07,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:07,559 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-06 10:32:07,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:32:07,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514127651] [2025-02-06 10:32:07,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514127651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:32:07,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:32:07,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:32:07,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927518774] [2025-02-06 10:32:07,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:32:07,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:32:07,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:32:07,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:32:07,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:32:07,561 INFO L87 Difference]: Start difference. First operand 408 states and 517 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-06 10:32:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:32:07,699 INFO L93 Difference]: Finished difference Result 454 states and 575 transitions. [2025-02-06 10:32:07,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:32:07,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 33 [2025-02-06 10:32:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:32:07,701 INFO L225 Difference]: With dead ends: 454 [2025-02-06 10:32:07,701 INFO L226 Difference]: Without dead ends: 454 [2025-02-06 10:32:07,701 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-06 10:32:07,701 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 34 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 402 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-06 10:32:07,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 402 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:32:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-02-06 10:32:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2025-02-06 10:32:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 338 states have (on average 1.2899408284023668) internal successors, (436), 370 states have internal predecessors, (436), 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-06 10:32:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 551 transitions. [2025-02-06 10:32:07,709 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 551 transitions. Word has length 33 [2025-02-06 10:32:07,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:32:07,710 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 551 transitions. [2025-02-06 10:32:07,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-06 10:32:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 551 transitions. [2025-02-06 10:32:07,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:32:07,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:32:07,710 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, 1] [2025-02-06 10:32:07,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 10:32:07,711 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-06 10:32:07,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:32:07,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1826869397, now seen corresponding path program 1 times [2025-02-06 10:32:07,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:32:07,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214925230] [2025-02-06 10:32:07,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:07,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:32:07,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:32:07,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:32:07,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:07,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:08,347 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-06 10:32:08,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:32:08,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214925230] [2025-02-06 10:32:08,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214925230] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:32:08,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875843029] [2025-02-06 10:32:08,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:08,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:32:08,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:32:08,353 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-06 10:32:08,354 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-06 10:32:08,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:32:08,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:32:08,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:08,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:08,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-02-06 10:32:08,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:32:08,466 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-06 10:32:08,511 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-06 10:32:08,514 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-06 10:32:08,591 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:32:08,591 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-06 10:32:08,629 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-06 10:32:08,637 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-06 10:32:08,654 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-06 10:32:08,657 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-06 10:32:08,692 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-06 10:32:08,692 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-06 10:32:08,707 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-06 10:32:08,708 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-06 10:32:08,855 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:32:08,856 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-06 10:32:08,916 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-06 10:32:08,934 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-06 10:32:08,954 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-06 10:32:08,960 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-06 10:32:08,986 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-06 10:32:08,987 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-06 10:32:08,998 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-06 10:32:08,998 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-06 10:32:09,398 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-06 10:32:09,402 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-06 10:32:09,528 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-06 10:32:09,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:32:09,800 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-06 10:32:10,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:32:10,059 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