./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.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 3b4637ab5710a1ca22a981e8047278048fbbf856825d3649b2cb9d48de11d175 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:44:48,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:44:48,351 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:44:48,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:44:48,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:44:48,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:44:48,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:44:48,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:44:48,380 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:44:48,380 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:44:48,381 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:44:48,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:44:48,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:44:48,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:44:48,381 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:44:48,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:44:48,381 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:44:48,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:44:48,382 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:44:48,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:44:48,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:44:48,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:44:48,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:44:48,383 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 -> 3b4637ab5710a1ca22a981e8047278048fbbf856825d3649b2cb9d48de11d175 [2025-02-08 06:44:48,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:44:48,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:44:48,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:44:48,617 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:44:48,617 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:44:48,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2025-02-08 06:44:49,714 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef2c12af7/cb6c4ff0a9834f8e866ab815fc4479c3/FLAGeac0a6044 [2025-02-08 06:44:49,999 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:44:50,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2025-02-08 06:44:50,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef2c12af7/cb6c4ff0a9834f8e866ab815fc4479c3/FLAGeac0a6044 [2025-02-08 06:44:50,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef2c12af7/cb6c4ff0a9834f8e866ab815fc4479c3 [2025-02-08 06:44:50,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:44:50,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:44:50,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:44:50,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:44:50,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:44:50,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:44:50" (1/1) ... [2025-02-08 06:44:50,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142f86bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:44:50, skipping insertion in model container [2025-02-08 06:44:50,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:44:50" (1/1) ... [2025-02-08 06:44:50,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:44:50,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:44:50,291 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:44:50,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:44:50,357 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:44:50,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:44:50 WrapperNode [2025-02-08 06:44:50,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:44:50,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:44:50,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:44:50,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:44:50,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:44:50" (1/1) ... [2025-02-08 06:44:50,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:44:50" (1/1) ... [2025-02-08 06:44:50,393 INFO L138 Inliner]: procedures = 122, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 107 [2025-02-08 06:44:50,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:44:50,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:44:50,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:44:50,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:44:50,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:44:50" (1/1) ... [2025-02-08 06:44:50,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:44:50" (1/1) ... [2025-02-08 06:44:50,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:44:50" (1/1) ... [2025-02-08 06:44:50,423 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-02-08 06:44:50,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:44:50" (1/1) ... [2025-02-08 06:44:50,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:44:50" (1/1) ... [2025-02-08 06:44:50,432 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:44:50" (1/1) ... [2025-02-08 06:44:50,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:44:50" (1/1) ... [2025-02-08 06:44:50,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:44:50" (1/1) ... [2025-02-08 06:44:50,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:44:50" (1/1) ... [2025-02-08 06:44:50,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:44:50,445 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:44:50,445 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:44:50,445 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:44:50,446 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:44:50" (1/1) ... [2025-02-08 06:44:50,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:44:50,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:50,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:44:50,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:44:50,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:44:50,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:44:50,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:44:50,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:44:50,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:44:50,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:44:50,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:44:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:44:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:44:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:44:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:44:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:44:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:44:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:44:50,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:44:50,595 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:44:50,596 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:44:50,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2025-02-08 06:44:50,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2025-02-08 06:44:50,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume false; [2025-02-08 06:44:50,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume !false; [2025-02-08 06:44:50,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false;main_#res#1 := 1; [2025-02-08 06:44:50,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615-1: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 06:44:50,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L582: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-08 06:44:50,826 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2025-02-08 06:44:50,826 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:44:50,836 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:44:50,836 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:44:50,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:44:50 BoogieIcfgContainer [2025-02-08 06:44:50,837 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:44:50,839 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:44:50,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:44:50,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:44:50,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:44:50" (1/3) ... [2025-02-08 06:44:50,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6728216f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:44:50, skipping insertion in model container [2025-02-08 06:44:50,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:44:50" (2/3) ... [2025-02-08 06:44:50,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6728216f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:44:50, skipping insertion in model container [2025-02-08 06:44:50,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:44:50" (3/3) ... [2025-02-08 06:44:50,846 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.i [2025-02-08 06:44:50,856 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:44:50,858 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_nullified-2.i that has 1 procedures, 81 locations, 1 initial locations, 3 loop locations, and 35 error locations. [2025-02-08 06:44:50,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:44:50,900 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;@7fc25450, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:44:50,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-02-08 06:44:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 80 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:44:50,909 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:50,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:44:50,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:44:50,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:50,915 INFO L85 PathProgramCache]: Analyzing trace with hash 4000891, now seen corresponding path program 1 times [2025-02-08 06:44:50,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:50,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067480043] [2025-02-08 06:44:50,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:50,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:50,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:44:50,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:44:50,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:50,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:51,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:51,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067480043] [2025-02-08 06:44:51,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067480043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:51,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:51,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:44:51,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25154400] [2025-02-08 06:44:51,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:51,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:44:51,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:51,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:44:51,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:44:51,120 INFO L87 Difference]: Start difference. First operand has 81 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 80 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:51,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:51,205 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2025-02-08 06:44:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:44:51,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-02-08 06:44:51,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:51,211 INFO L225 Difference]: With dead ends: 76 [2025-02-08 06:44:51,212 INFO L226 Difference]: Without dead ends: 72 [2025-02-08 06:44:51,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:44:51,215 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:51,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 110 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:44:51,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-08 06:44:51,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-08 06:44:51,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 71 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:51,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2025-02-08 06:44:51,240 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 4 [2025-02-08 06:44:51,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:51,240 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2025-02-08 06:44:51,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2025-02-08 06:44:51,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:44:51,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:51,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:44:51,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:44:51,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:44:51,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:51,242 INFO L85 PathProgramCache]: Analyzing trace with hash 4000892, now seen corresponding path program 1 times [2025-02-08 06:44:51,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:51,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353921810] [2025-02-08 06:44:51,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:51,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:51,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:44:51,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:44:51,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:51,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:51,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:51,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353921810] [2025-02-08 06:44:51,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353921810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:51,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:51,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:44:51,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252341291] [2025-02-08 06:44:51,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:51,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:44:51,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:51,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:44:51,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:44:51,330 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:51,387 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2025-02-08 06:44:51,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:44:51,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-02-08 06:44:51,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:51,388 INFO L225 Difference]: With dead ends: 67 [2025-02-08 06:44:51,388 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 06:44:51,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:44:51,389 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:51,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 106 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:44:51,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 06:44:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-08 06:44:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 66 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2025-02-08 06:44:51,393 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 4 [2025-02-08 06:44:51,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:51,393 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2025-02-08 06:44:51,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:51,393 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2025-02-08 06:44:51,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:44:51,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:51,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:44:51,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:44:51,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:44:51,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:51,394 INFO L85 PathProgramCache]: Analyzing trace with hash 3975044, now seen corresponding path program 1 times [2025-02-08 06:44:51,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:51,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900326756] [2025-02-08 06:44:51,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:51,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:51,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:44:51,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:44:51,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:51,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:51,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:51,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:51,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900326756] [2025-02-08 06:44:51,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900326756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:51,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:51,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:44:51,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576374204] [2025-02-08 06:44:51,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:51,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:44:51,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:51,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:44:51,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:44:51,450 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:51,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:51,465 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2025-02-08 06:44:51,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:44:51,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-02-08 06:44:51,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:51,466 INFO L225 Difference]: With dead ends: 79 [2025-02-08 06:44:51,466 INFO L226 Difference]: Without dead ends: 79 [2025-02-08 06:44:51,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:44:51,467 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 12 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:51,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 142 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:44:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-08 06:44:51,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2025-02-08 06:44:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 67 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2025-02-08 06:44:51,471 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 4 [2025-02-08 06:44:51,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:51,471 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2025-02-08 06:44:51,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:51,471 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2025-02-08 06:44:51,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:44:51,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:51,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:51,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:44:51,472 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:44:51,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:51,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1145147790, now seen corresponding path program 1 times [2025-02-08 06:44:51,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:51,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469263310] [2025-02-08 06:44:51,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:51,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:51,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:44:51,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:44:51,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:51,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:51,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:51,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469263310] [2025-02-08 06:44:51,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469263310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:51,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:51,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:44:51,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005410799] [2025-02-08 06:44:51,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:51,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:44:51,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:51,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:44:51,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:44:51,561 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:51,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:51,574 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2025-02-08 06:44:51,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:44:51,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 06:44:51,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:51,574 INFO L225 Difference]: With dead ends: 75 [2025-02-08 06:44:51,574 INFO L226 Difference]: Without dead ends: 75 [2025-02-08 06:44:51,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:44:51,575 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:51,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:44:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-08 06:44:51,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-08 06:44:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.607843137254902) internal successors, (82), 74 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:51,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2025-02-08 06:44:51,579 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 10 [2025-02-08 06:44:51,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:51,579 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2025-02-08 06:44:51,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:51,579 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2025-02-08 06:44:51,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:44:51,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:51,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:51,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:44:51,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:44:51,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:51,579 INFO L85 PathProgramCache]: Analyzing trace with hash -171643400, now seen corresponding path program 1 times [2025-02-08 06:44:51,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:51,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038300701] [2025-02-08 06:44:51,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:51,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:51,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:44:51,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:44:51,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:51,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:51,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:51,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038300701] [2025-02-08 06:44:51,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038300701] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:51,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471173802] [2025-02-08 06:44:51,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:51,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:51,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:51,676 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:44:51,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:44:51,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:44:51,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:44:51,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:51,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:51,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:44:51,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:51,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:44:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:51,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471173802] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:44:51,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:44:51,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 06:44:51,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847228609] [2025-02-08 06:44:51,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:44:51,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:44:51,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:51,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:44:51,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:44:51,833 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:51,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:51,859 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2025-02-08 06:44:51,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:44:51,859 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-08 06:44:51,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:51,860 INFO L225 Difference]: With dead ends: 101 [2025-02-08 06:44:51,860 INFO L226 Difference]: Without dead ends: 101 [2025-02-08 06:44:51,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:44:51,860 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 28 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:51,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 282 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:44:51,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-08 06:44:51,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2025-02-08 06:44:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.5068493150684932) internal successors, (110), 96 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2025-02-08 06:44:51,871 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 13 [2025-02-08 06:44:51,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:51,871 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2025-02-08 06:44:51,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2025-02-08 06:44:51,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:44:51,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:51,872 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 06:44:51,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:44:52,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:52,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:44:52,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:52,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1473056230, now seen corresponding path program 1 times [2025-02-08 06:44:52,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:52,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39278184] [2025-02-08 06:44:52,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:52,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:52,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:44:52,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:44:52,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:52,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:52,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:52,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39278184] [2025-02-08 06:44:52,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39278184] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:52,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19422730] [2025-02-08 06:44:52,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:52,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:52,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:52,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:44:52,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:44:52,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:44:52,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:44:52,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:52,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:52,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 06:44:52,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:52,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:44:52,444 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:44:52,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2025-02-08 06:44:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:52,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:44:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:52,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19422730] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:44:52,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:44:52,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2025-02-08 06:44:52,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551176648] [2025-02-08 06:44:52,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:44:52,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:44:52,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:52,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:44:52,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:44:52,508 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:52,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:52,593 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2025-02-08 06:44:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:44:52,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-08 06:44:52,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:52,593 INFO L225 Difference]: With dead ends: 96 [2025-02-08 06:44:52,593 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 06:44:52,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:44:52,594 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 3 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:52,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 176 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:44:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 06:44:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-08 06:44:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 95 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2025-02-08 06:44:52,602 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 19 [2025-02-08 06:44:52,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:52,602 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2025-02-08 06:44:52,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2025-02-08 06:44:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:44:52,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:52,602 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 06:44:52,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:44:52,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:52,803 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:44:52,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:52,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1473056231, now seen corresponding path program 1 times [2025-02-08 06:44:52,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:52,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983976453] [2025-02-08 06:44:52,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:52,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:52,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:44:52,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:44:52,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:52,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:52,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:52,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983976453] [2025-02-08 06:44:52,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983976453] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:52,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886869692] [2025-02-08 06:44:52,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:52,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:52,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:52,991 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:44:52,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:44:53,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:44:53,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:44:53,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:53,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:53,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 06:44:53,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:53,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:44:53,142 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:44:53,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2025-02-08 06:44:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:53,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:44:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:53,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886869692] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:44:53,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:44:53,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 5] total 10 [2025-02-08 06:44:53,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877657223] [2025-02-08 06:44:53,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:44:53,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:44:53,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:53,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:44:53,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:44:53,504 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:53,611 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2025-02-08 06:44:53,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:44:53,611 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-08 06:44:53,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:53,612 INFO L225 Difference]: With dead ends: 95 [2025-02-08 06:44:53,612 INFO L226 Difference]: Without dead ends: 95 [2025-02-08 06:44:53,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:44:53,613 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 8 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:53,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 267 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:44:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-08 06:44:53,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-08 06:44:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 94 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2025-02-08 06:44:53,616 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 19 [2025-02-08 06:44:53,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:53,617 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2025-02-08 06:44:53,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2025-02-08 06:44:53,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:44:53,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:53,617 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-02-08 06:44:53,626 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-08 06:44:53,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:53,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:44:53,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:53,818 INFO L85 PathProgramCache]: Analyzing trace with hash 119344260, now seen corresponding path program 2 times [2025-02-08 06:44:53,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:53,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409732939] [2025-02-08 06:44:53,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:44:53,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:53,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-02-08 06:44:53,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:44:53,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:44:53,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 06:44:53,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:53,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409732939] [2025-02-08 06:44:53,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409732939] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:53,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302500255] [2025-02-08 06:44:53,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:44:53,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:53,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:53,897 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:44:53,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:44:53,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-02-08 06:44:54,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:44:54,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:44:54,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:54,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 06:44:54,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:54,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:44:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:54,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302500255] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:44:54,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:44:54,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 9 [2025-02-08 06:44:54,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733086856] [2025-02-08 06:44:54,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:44:54,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:44:54,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:54,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:44:54,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:44:54,167 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:54,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:54,329 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2025-02-08 06:44:54,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 06:44:54,331 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-02-08 06:44:54,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:54,331 INFO L225 Difference]: With dead ends: 105 [2025-02-08 06:44:54,331 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 06:44:54,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2025-02-08 06:44:54,332 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 31 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:54,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 297 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:44:54,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 06:44:54,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-02-08 06:44:54,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 104 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2025-02-08 06:44:54,338 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 40 [2025-02-08 06:44:54,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:54,339 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2025-02-08 06:44:54,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:54,339 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2025-02-08 06:44:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 06:44:54,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:54,339 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 06:44:54,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 06:44:54,540 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,SelfDestructingSolverStorable7 [2025-02-08 06:44:54,540 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:44:54,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:54,541 INFO L85 PathProgramCache]: Analyzing trace with hash 695779872, now seen corresponding path program 1 times [2025-02-08 06:44:54,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:54,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175748528] [2025-02-08 06:44:54,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:54,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:54,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 06:44:54,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 06:44:54,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:54,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:54,720 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-08 06:44:54,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:54,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175748528] [2025-02-08 06:44:54,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175748528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:54,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:54,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:44:54,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407878643] [2025-02-08 06:44:54,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:54,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:44:54,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:54,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:44:54,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:44:54,722 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:54,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:54,816 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2025-02-08 06:44:54,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:44:54,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-02-08 06:44:54,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:54,817 INFO L225 Difference]: With dead ends: 101 [2025-02-08 06:44:54,817 INFO L226 Difference]: Without dead ends: 101 [2025-02-08 06:44:54,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:44:54,818 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:54,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 83 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:44:54,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-08 06:44:54,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-08 06:44:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.264367816091954) internal successors, (110), 100 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2025-02-08 06:44:54,822 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 53 [2025-02-08 06:44:54,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:54,822 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2025-02-08 06:44:54,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:54,822 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2025-02-08 06:44:54,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 06:44:54,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:54,823 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 06:44:54,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:44:54,823 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:44:54,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:54,824 INFO L85 PathProgramCache]: Analyzing trace with hash 695779873, now seen corresponding path program 1 times [2025-02-08 06:44:54,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:54,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503881528] [2025-02-08 06:44:54,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:54,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:54,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 06:44:54,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 06:44:54,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:54,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-08 06:44:55,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:55,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503881528] [2025-02-08 06:44:55,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503881528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:55,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:55,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:44:55,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338180408] [2025-02-08 06:44:55,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:55,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:44:55,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:55,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:44:55,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:44:55,106 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:55,210 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2025-02-08 06:44:55,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:44:55,211 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-02-08 06:44:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:55,211 INFO L225 Difference]: With dead ends: 127 [2025-02-08 06:44:55,211 INFO L226 Difference]: Without dead ends: 127 [2025-02-08 06:44:55,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:44:55,212 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 38 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:55,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 126 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:44:55,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-08 06:44:55,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-08 06:44:55,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.247787610619469) internal successors, (141), 126 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2025-02-08 06:44:55,220 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 53 [2025-02-08 06:44:55,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:55,220 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2025-02-08 06:44:55,220 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,220 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2025-02-08 06:44:55,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 06:44:55,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:55,221 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:55,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:44:55,221 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:44:55,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:55,221 INFO L85 PathProgramCache]: Analyzing trace with hash 466031163, now seen corresponding path program 1 times [2025-02-08 06:44:55,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:55,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739616697] [2025-02-08 06:44:55,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:55,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:55,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 06:44:55,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 06:44:55,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:55,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-08 06:44:55,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:55,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739616697] [2025-02-08 06:44:55,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739616697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:55,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:55,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:44:55,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841640393] [2025-02-08 06:44:55,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:55,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:44:55,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:55,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:44:55,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:44:55,355 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:55,438 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2025-02-08 06:44:55,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:44:55,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-02-08 06:44:55,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:55,439 INFO L225 Difference]: With dead ends: 129 [2025-02-08 06:44:55,439 INFO L226 Difference]: Without dead ends: 129 [2025-02-08 06:44:55,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:44:55,440 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 39 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:55,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 147 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:44:55,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-08 06:44:55,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2025-02-08 06:44:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.238938053097345) internal successors, (140), 126 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2025-02-08 06:44:55,446 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 56 [2025-02-08 06:44:55,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:55,446 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2025-02-08 06:44:55,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,446 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2025-02-08 06:44:55,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-08 06:44:55,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:55,447 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:55,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:44:55,447 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:44:55,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:55,448 INFO L85 PathProgramCache]: Analyzing trace with hash -966818315, now seen corresponding path program 1 times [2025-02-08 06:44:55,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:55,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993132155] [2025-02-08 06:44:55,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:55,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:55,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 06:44:55,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 06:44:55,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:55,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-02-08 06:44:55,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:55,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993132155] [2025-02-08 06:44:55,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993132155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:55,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:55,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:44:55,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364809386] [2025-02-08 06:44:55,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:55,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:44:55,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:55,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:44:55,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:44:55,533 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:55,542 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2025-02-08 06:44:55,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:44:55,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-08 06:44:55,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:55,543 INFO L225 Difference]: With dead ends: 129 [2025-02-08 06:44:55,543 INFO L226 Difference]: Without dead ends: 127 [2025-02-08 06:44:55,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:44:55,543 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:55,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:44:55,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-08 06:44:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-08 06:44:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.2212389380530972) internal successors, (138), 126 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2025-02-08 06:44:55,547 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 64 [2025-02-08 06:44:55,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:55,547 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2025-02-08 06:44:55,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,547 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2025-02-08 06:44:55,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-08 06:44:55,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:55,548 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:55,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:44:55,548 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:44:55,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:55,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1126347672, now seen corresponding path program 1 times [2025-02-08 06:44:55,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:55,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672347958] [2025-02-08 06:44:55,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:55,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:55,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 06:44:55,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 06:44:55,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:55,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:55,629 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-02-08 06:44:55,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:55,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672347958] [2025-02-08 06:44:55,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672347958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:55,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:55,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:44:55,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176272271] [2025-02-08 06:44:55,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:55,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:44:55,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:55,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:44:55,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:44:55,631 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:55,636 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2025-02-08 06:44:55,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:44:55,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-08 06:44:55,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:55,638 INFO L225 Difference]: With dead ends: 129 [2025-02-08 06:44:55,638 INFO L226 Difference]: Without dead ends: 127 [2025-02-08 06:44:55,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:44:55,639 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:55,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:44:55,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-08 06:44:55,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-08 06:44:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 126 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2025-02-08 06:44:55,642 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 65 [2025-02-08 06:44:55,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:55,643 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2025-02-08 06:44:55,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,643 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2025-02-08 06:44:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 06:44:55,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:55,645 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:55,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:44:55,645 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:44:55,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2000156171, now seen corresponding path program 1 times [2025-02-08 06:44:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:55,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747374319] [2025-02-08 06:44:55,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:55,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:55,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 06:44:55,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:44:55,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:55,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:55,732 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-02-08 06:44:55,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:55,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747374319] [2025-02-08 06:44:55,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747374319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:55,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:55,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:44:55,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725130219] [2025-02-08 06:44:55,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:55,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:44:55,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:55,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:44:55,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:44:55,734 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:55,743 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2025-02-08 06:44:55,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:44:55,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-08 06:44:55,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:55,744 INFO L225 Difference]: With dead ends: 131 [2025-02-08 06:44:55,744 INFO L226 Difference]: Without dead ends: 127 [2025-02-08 06:44:55,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:44:55,744 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:55,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:44:55,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-08 06:44:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-08 06:44:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.1858407079646018) internal successors, (134), 126 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 134 transitions. [2025-02-08 06:44:55,746 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 134 transitions. Word has length 66 [2025-02-08 06:44:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:55,747 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 134 transitions. [2025-02-08 06:44:55,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2025-02-08 06:44:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 06:44:55,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:55,747 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:55,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:44:55,748 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:44:55,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:55,748 INFO L85 PathProgramCache]: Analyzing trace with hash 118984632, now seen corresponding path program 1 times [2025-02-08 06:44:55,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:55,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702122504] [2025-02-08 06:44:55,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:55,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:55,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 06:44:55,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 06:44:55,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:55,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-02-08 06:44:55,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:55,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702122504] [2025-02-08 06:44:55,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702122504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:55,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:55,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:44:55,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118802978] [2025-02-08 06:44:55,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:55,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:44:55,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:55,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:44:55,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:44:55,855 INFO L87 Difference]: Start difference. First operand 127 states and 134 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:55,865 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2025-02-08 06:44:55,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:44:55,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-08 06:44:55,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:55,866 INFO L225 Difference]: With dead ends: 131 [2025-02-08 06:44:55,866 INFO L226 Difference]: Without dead ends: 127 [2025-02-08 06:44:55,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:44:55,867 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:55,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:44:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-08 06:44:55,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-08 06:44:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.168141592920354) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2025-02-08 06:44:55,870 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 67 [2025-02-08 06:44:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:55,870 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2025-02-08 06:44:55,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:55,870 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2025-02-08 06:44:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-08 06:44:55,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:55,873 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:55,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:44:55,873 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:44:55,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:55,873 INFO L85 PathProgramCache]: Analyzing trace with hash -234333803, now seen corresponding path program 1 times [2025-02-08 06:44:55,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:55,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199223510] [2025-02-08 06:44:55,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:55,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:55,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 06:44:55,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 06:44:55,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:55,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:56,592 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 50 proven. 34 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 06:44:56,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:56,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199223510] [2025-02-08 06:44:56,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199223510] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:56,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815407308] [2025-02-08 06:44:56,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:56,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:56,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:56,595 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:44:56,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:44:56,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 06:44:56,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 06:44:56,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:56,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:56,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 06:44:56,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:56,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:44:56,824 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:44:56,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:44:56,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:44:56,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 23 treesize of output 22 [2025-02-08 06:44:56,906 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:44:56,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2025-02-08 06:44:57,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:57,046 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 40 treesize of output 16 [2025-02-08 06:44:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-08 06:44:57,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:44:57,125 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-02-08 06:44:57,126 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 20 [2025-02-08 06:44:57,129 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2276 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2276) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2025-02-08 06:44:57,136 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2276 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2276) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2025-02-08 06:44:57,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:57,148 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 27 treesize of output 33 [2025-02-08 06:44:57,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:57,154 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 46 treesize of output 28 [2025-02-08 06:44:57,158 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 7 treesize of output 3 [2025-02-08 06:44:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 3 not checked. [2025-02-08 06:44:57,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815407308] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:44:57,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:44:57,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-02-08 06:44:57,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980644785] [2025-02-08 06:44:57,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:44:57,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 06:44:57,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:57,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 06:44:57,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=447, Unknown=2, NotChecked=86, Total=600 [2025-02-08 06:44:57,201 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 25 states, 24 states have (on average 4.833333333333333) internal successors, (116), 25 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:57,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:57,806 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2025-02-08 06:44:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:44:57,807 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.833333333333333) internal successors, (116), 25 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-08 06:44:57,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:57,807 INFO L225 Difference]: With dead ends: 130 [2025-02-08 06:44:57,807 INFO L226 Difference]: Without dead ends: 130 [2025-02-08 06:44:57,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=864, Unknown=2, NotChecked=126, Total=1190 [2025-02-08 06:44:57,809 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 115 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:57,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 310 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 680 Invalid, 0 Unknown, 204 Unchecked, 0.4s Time] [2025-02-08 06:44:57,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-08 06:44:57,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-02-08 06:44:57,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 116 states have (on average 1.1724137931034482) internal successors, (136), 129 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:57,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2025-02-08 06:44:57,813 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 68 [2025-02-08 06:44:57,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:57,814 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2025-02-08 06:44:57,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.833333333333333) internal successors, (116), 25 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:44:57,814 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2025-02-08 06:44:57,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-08 06:44:57,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:57,814 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:57,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 06:44:58,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 06:44:58,015 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:44:58,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:58,017 INFO L85 PathProgramCache]: Analyzing trace with hash -234333802, now seen corresponding path program 1 times [2025-02-08 06:44:58,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:58,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049354100] [2025-02-08 06:44:58,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:58,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:58,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 06:44:58,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 06:44:58,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:58,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:59,047 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 06:44:59,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:59,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049354100] [2025-02-08 06:44:59,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049354100] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:59,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028437203] [2025-02-08 06:44:59,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:59,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:59,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:59,049 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:44:59,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:44:59,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 06:44:59,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 06:44:59,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:59,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:59,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-08 06:44:59,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:59,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:44:59,309 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:44:59,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:44:59,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:44:59,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:44:59,375 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 23 treesize of output 22 [2025-02-08 06:44:59,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-08 06:44:59,435 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:44:59,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2025-02-08 06:44:59,439 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 39 treesize of output 20 [2025-02-08 06:44:59,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2025-02-08 06:44:59,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:59,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-02-08 06:44:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-08 06:44:59,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:44:59,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:59,841 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 48 treesize of output 52 [2025-02-08 06:44:59,867 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)))) (forall ((v_ArrVal_2651 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2651) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))) (forall ((v_ArrVal_2650 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2025-02-08 06:44:59,884 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 0))) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2651 (Array Int Int))) (< (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2651) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))) (forall ((v_ArrVal_2650 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 4)))))) is different from false [2025-02-08 06:44:59,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:59,892 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 29 treesize of output 35 [2025-02-08 06:44:59,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:59,896 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 50 treesize of output 32 [2025-02-08 06:44:59,903 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-02-08 06:44:59,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1 [2025-02-08 06:44:59,908 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-02-08 06:44:59,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2025-02-08 06:45:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 3 not checked. [2025-02-08 06:45:00,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028437203] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:45:00,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:45:00,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2025-02-08 06:45:00,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852503080] [2025-02-08 06:45:00,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:45:00,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-08 06:45:00,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:45:00,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-08 06:45:00,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=896, Unknown=2, NotChecked=122, Total=1122 [2025-02-08 06:45:00,071 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand has 34 states, 33 states have (on average 4.090909090909091) internal successors, (135), 34 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:45:00,835 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2025-02-08 06:45:00,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 06:45:00,836 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.090909090909091) internal successors, (135), 34 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-08 06:45:00,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:45:00,837 INFO L225 Difference]: With dead ends: 167 [2025-02-08 06:45:00,837 INFO L226 Difference]: Without dead ends: 167 [2025-02-08 06:45:00,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=262, Invalid=1466, Unknown=2, NotChecked=162, Total=1892 [2025-02-08 06:45:00,838 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 192 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:45:00,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 489 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 827 Invalid, 0 Unknown, 250 Unchecked, 0.4s Time] [2025-02-08 06:45:00,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-08 06:45:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 139. [2025-02-08 06:45:00,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 126 states have (on average 1.1587301587301588) internal successors, (146), 138 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:00,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2025-02-08 06:45:00,841 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 68 [2025-02-08 06:45:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:45:00,841 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2025-02-08 06:45:00,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.090909090909091) internal successors, (135), 34 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2025-02-08 06:45:00,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 06:45:00,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:45:00,842 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:45:00,849 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-08 06:45:01,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 06:45:01,046 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:45:01,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:45:01,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1657989256, now seen corresponding path program 1 times [2025-02-08 06:45:01,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:45:01,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388151116] [2025-02-08 06:45:01,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:45:01,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:45:01,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 06:45:01,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 06:45:01,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:45:01,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:45:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-08 06:45:01,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:45:01,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388151116] [2025-02-08 06:45:01,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388151116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:45:01,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:45:01,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:45:01,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856206833] [2025-02-08 06:45:01,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:45:01,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:45:01,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:45:01,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:45:01,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:45:01,175 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:45:01,236 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2025-02-08 06:45:01,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:45:01,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-08 06:45:01,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:45:01,237 INFO L225 Difference]: With dead ends: 153 [2025-02-08 06:45:01,237 INFO L226 Difference]: Without dead ends: 153 [2025-02-08 06:45:01,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:45:01,238 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 21 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:45:01,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 122 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:45:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-08 06:45:01,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-08 06:45:01,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 140 states have (on average 1.1428571428571428) internal successors, (160), 152 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:01,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2025-02-08 06:45:01,241 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 69 [2025-02-08 06:45:01,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:45:01,241 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2025-02-08 06:45:01,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:01,242 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2025-02-08 06:45:01,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 06:45:01,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:45:01,242 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:45:01,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:45:01,242 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:45:01,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:45:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1716434266, now seen corresponding path program 1 times [2025-02-08 06:45:01,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:45:01,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008225691] [2025-02-08 06:45:01,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:45:01,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:45:01,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 06:45:01,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 06:45:01,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:45:01,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:45:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-02-08 06:45:01,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:45:01,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008225691] [2025-02-08 06:45:01,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008225691] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:45:01,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755504180] [2025-02-08 06:45:01,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:45:01,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:45:01,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:45:01,440 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:45:01,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:45:01,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 06:45:01,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 06:45:01,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:45:01,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:45:01,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 06:45:01,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:45:01,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-02-08 06:45:01,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-02-08 06:45:01,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-02-08 06:45:01,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-02-08 06:45:01,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-02-08 06:45:01,774 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:45:01,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:45:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-02-08 06:45:01,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:45:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-02-08 06:45:01,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755504180] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:45:01,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:45:01,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 5 [2025-02-08 06:45:01,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086975172] [2025-02-08 06:45:01,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:45:01,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:45:01,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:45:01,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:45:01,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:45:01,880 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:45:01,925 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions. [2025-02-08 06:45:01,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:45:01,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-08 06:45:01,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:45:01,926 INFO L225 Difference]: With dead ends: 153 [2025-02-08 06:45:01,926 INFO L226 Difference]: Without dead ends: 153 [2025-02-08 06:45:01,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:45:01,926 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 59 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 35 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.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:45:01,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 35 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:45:01,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-08 06:45:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-08 06:45:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 140 states have (on average 1.1285714285714286) internal successors, (158), 152 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:01,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 158 transitions. [2025-02-08 06:45:01,928 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 158 transitions. Word has length 71 [2025-02-08 06:45:01,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:45:01,928 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 158 transitions. [2025-02-08 06:45:01,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 158 transitions. [2025-02-08 06:45:01,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-08 06:45:01,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:45:01,929 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:45:01,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 06:45:02,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:45:02,129 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:45:02,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:45:02,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1034039406, now seen corresponding path program 1 times [2025-02-08 06:45:02,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:45:02,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914890524] [2025-02-08 06:45:02,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:45:02,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:45:02,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 06:45:02,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 06:45:02,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:45:02,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:45:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 51 proven. 33 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 06:45:02,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:45:02,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914890524] [2025-02-08 06:45:02,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914890524] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:45:02,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262183042] [2025-02-08 06:45:02,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:45:02,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:45:02,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:45:02,794 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:45:02,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:45:02,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 06:45:03,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 06:45:03,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:45:03,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:45:03,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 06:45:03,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:45:03,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:45:03,077 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:45:03,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:45:03,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:45:03,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:45:03,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:45:03,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:45:03,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:03,171 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 17 treesize of output 15 [2025-02-08 06:45:03,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:03,175 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 17 treesize of output 15 [2025-02-08 06:45:03,282 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 61 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-08 06:45:03,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:45:03,371 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3582 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3582) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) 0)) (forall ((v_ArrVal_3583 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3583) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) 0))) is different from false [2025-02-08 06:45:03,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:03,380 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 20 treesize of output 21 [2025-02-08 06:45:03,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:03,384 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 32 treesize of output 30 [2025-02-08 06:45:03,389 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 06:45:03,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2025-02-08 06:45:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 61 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 2 not checked. [2025-02-08 06:45:03,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262183042] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:45:03,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:45:03,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 25 [2025-02-08 06:45:03,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755418169] [2025-02-08 06:45:03,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:45:03,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 06:45:03,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:45:03,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 06:45:03,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=485, Unknown=1, NotChecked=44, Total=600 [2025-02-08 06:45:03,424 INFO L87 Difference]: Start difference. First operand 153 states and 158 transitions. Second operand has 25 states, 25 states have (on average 4.44) internal successors, (111), 25 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:45:03,746 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2025-02-08 06:45:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:45:03,746 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.44) internal successors, (111), 25 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-08 06:45:03,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:45:03,747 INFO L225 Difference]: With dead ends: 155 [2025-02-08 06:45:03,747 INFO L226 Difference]: Without dead ends: 155 [2025-02-08 06:45:03,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=854, Unknown=1, NotChecked=60, Total=1056 [2025-02-08 06:45:03,747 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 41 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:45:03,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 483 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 550 Invalid, 0 Unknown, 53 Unchecked, 0.2s Time] [2025-02-08 06:45:03,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-08 06:45:03,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-02-08 06:45:03,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 142 states have (on average 1.1267605633802817) internal successors, (160), 154 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:03,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 160 transitions. [2025-02-08 06:45:03,750 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 160 transitions. Word has length 72 [2025-02-08 06:45:03,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:45:03,750 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 160 transitions. [2025-02-08 06:45:03,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.44) internal successors, (111), 25 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 160 transitions. [2025-02-08 06:45:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-08 06:45:03,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:45:03,751 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:45:03,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 06:45:03,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:45:03,952 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:45:03,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:45:03,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1034040405, now seen corresponding path program 1 times [2025-02-08 06:45:03,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:45:03,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254656482] [2025-02-08 06:45:03,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:45:03,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:45:03,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 06:45:03,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 06:45:03,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:45:03,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:45:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 52 proven. 34 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 06:45:04,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:45:04,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254656482] [2025-02-08 06:45:04,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254656482] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:45:04,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863927348] [2025-02-08 06:45:04,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:45:04,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:45:04,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:45:04,425 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:45:04,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:45:04,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 06:45:04,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 06:45:04,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:45:04,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:45:04,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 06:45:04,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:45:04,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:45:04,706 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:45:04,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:45:04,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:45:04,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-08 06:45:04,786 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:45:04,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2025-02-08 06:45:04,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:04,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-02-08 06:45:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 61 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-08 06:45:04,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:45:05,019 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3957 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3957) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) is different from false [2025-02-08 06:45:05,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:05,082 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 26 treesize of output 32 [2025-02-08 06:45:05,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:05,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 47 [2025-02-08 06:45:05,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-02-08 06:45:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 61 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 1 not checked. [2025-02-08 06:45:05,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863927348] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:45:05,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:45:05,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 34 [2025-02-08 06:45:05,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699510098] [2025-02-08 06:45:05,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:45:05,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-08 06:45:05,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:45:05,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-08 06:45:05,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=956, Unknown=1, NotChecked=62, Total=1122 [2025-02-08 06:45:05,305 INFO L87 Difference]: Start difference. First operand 155 states and 160 transitions. Second operand has 34 states, 34 states have (on average 3.676470588235294) internal successors, (125), 34 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:05,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:45:05,842 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2025-02-08 06:45:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 06:45:05,843 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.676470588235294) internal successors, (125), 34 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-08 06:45:05,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:45:05,843 INFO L225 Difference]: With dead ends: 138 [2025-02-08 06:45:05,843 INFO L226 Difference]: Without dead ends: 138 [2025-02-08 06:45:05,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=339, Invalid=1920, Unknown=1, NotChecked=92, Total=2352 [2025-02-08 06:45:05,844 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 75 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:45:05,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 694 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 517 Invalid, 3 Unknown, 45 Unchecked, 0.2s Time] [2025-02-08 06:45:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-08 06:45:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-02-08 06:45:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 125 states have (on average 1.136) internal successors, (142), 137 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 142 transitions. [2025-02-08 06:45:05,847 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 142 transitions. Word has length 72 [2025-02-08 06:45:05,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:45:05,847 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 142 transitions. [2025-02-08 06:45:05,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.676470588235294) internal successors, (125), 34 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2025-02-08 06:45:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 06:45:05,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:45:05,847 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 06:45:05,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 06:45:06,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:45:06,048 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:45:06,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:45:06,048 INFO L85 PathProgramCache]: Analyzing trace with hash 992102784, now seen corresponding path program 2 times [2025-02-08 06:45:06,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:45:06,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440646308] [2025-02-08 06:45:06,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:45:06,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:45:06,070 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-02-08 06:45:06,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 06:45:06,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:45:06,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:45:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 64 proven. 51 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 06:45:07,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:45:07,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440646308] [2025-02-08 06:45:07,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440646308] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:45:07,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023021037] [2025-02-08 06:45:07,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:45:07,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:45:07,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:45:07,335 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:45:07,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:45:07,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-02-08 06:45:07,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 06:45:07,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:45:07,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:45:07,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-08 06:45:07,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:45:07,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:45:07,641 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:45:07,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 06:45:07,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:45:07,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-08 06:45:07,763 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:45:07,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2025-02-08 06:45:07,824 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-02-08 06:45:07,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-02-08 06:45:07,870 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 41 treesize of output 30 [2025-02-08 06:45:07,885 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 41 treesize of output 30 [2025-02-08 06:45:07,897 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 41 treesize of output 30 [2025-02-08 06:45:07,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:45:07,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-02-08 06:45:07,956 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 19 treesize of output 18 [2025-02-08 06:45:07,967 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-02-08 06:45:07,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 48 [2025-02-08 06:45:08,038 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-02-08 06:45:08,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 68 [2025-02-08 06:45:08,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:45:08,048 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 31 treesize of output 16 [2025-02-08 06:45:08,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 06:45:08,532 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:45:08,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 32 [2025-02-08 06:45:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 70 proven. 39 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 06:45:08,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:45:08,825 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4339 (Array Int Int)) (v_ArrVal_4341 Int)) (let ((.cse3 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4339) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (or (= (select |c_#valid| (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 0)))) (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4341))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (+ .cse4 4))) 1) (< .cse4 0))))) is different from false [2025-02-08 06:45:08,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:08,834 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 149 treesize of output 139 [2025-02-08 06:45:08,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:08,838 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 259 treesize of output 235 [2025-02-08 06:45:08,842 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 119 treesize of output 111 [2025-02-08 06:45:08,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:08,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 66 [2025-02-08 06:45:08,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:08,997 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 179 treesize of output 115 [2025-02-08 06:45:09,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:09,020 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 66 [2025-02-08 06:45:13,361 INFO L349 Elim1Store]: treesize reduction 22, result has 60.0 percent of original size [2025-02-08 06:45:13,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 88 [2025-02-08 06:45:13,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:13,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 38 [2025-02-08 06:45:14,857 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:45:14,857 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:45:14,883 INFO L349 Elim1Store]: treesize reduction 40, result has 52.4 percent of original size [2025-02-08 06:45:14,883 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 347 treesize of output 307 [2025-02-08 06:45:14,888 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:45:14,890 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:45:14,892 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 290 [2025-02-08 06:45:14,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:14,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 340 treesize of output 326 [2025-02-08 06:45:14,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:14,930 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 356 treesize of output 344 [2025-02-08 06:45:14,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 363 treesize of output 343 [2025-02-08 06:45:15,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:15,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2025-02-08 06:45:15,042 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:45:15,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2025-02-08 06:45:15,047 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 18 treesize of output 14 [2025-02-08 06:45:15,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2025-02-08 06:45:15,076 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 86 [2025-02-08 06:45:15,080 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 24 treesize of output 20 [2025-02-08 06:45:15,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:15,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 62 [2025-02-08 06:45:15,138 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:45:15,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:45:15,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:15,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2025-02-08 06:45:15,165 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:45:15,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:15,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 225 [2025-02-08 06:45:15,176 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:45:15,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2025-02-08 06:45:15,183 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:45:15,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:15,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 152 [2025-02-08 06:45:15,538 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 86 [2025-02-08 06:45:15,542 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 44 treesize of output 40 [2025-02-08 06:45:15,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:15,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 82 [2025-02-08 06:45:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 60 proven. 45 refuted. 2 times theorem prover too weak. 11 trivial. 2 not checked. [2025-02-08 06:45:16,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023021037] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:45:16,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:45:16,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 20] total 51 [2025-02-08 06:45:16,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904363882] [2025-02-08 06:45:16,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:45:16,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-08 06:45:16,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:45:16,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-08 06:45:16,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=2290, Unknown=17, NotChecked=98, Total=2652 [2025-02-08 06:45:16,817 INFO L87 Difference]: Start difference. First operand 138 states and 142 transitions. Second operand has 52 states, 51 states have (on average 3.607843137254902) internal successors, (184), 52 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:19,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:45:19,194 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2025-02-08 06:45:19,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 06:45:19,194 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 3.607843137254902) internal successors, (184), 52 states have internal predecessors, (184), 0 states have call successors, (0), 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 83 [2025-02-08 06:45:19,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:45:19,195 INFO L225 Difference]: With dead ends: 173 [2025-02-08 06:45:19,195 INFO L226 Difference]: Without dead ends: 173 [2025-02-08 06:45:19,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=507, Invalid=3386, Unknown=17, NotChecked=122, Total=4032 [2025-02-08 06:45:19,197 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 156 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 13 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:45:19,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 677 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1479 Invalid, 4 Unknown, 167 Unchecked, 1.5s Time] [2025-02-08 06:45:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-08 06:45:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 144. [2025-02-08 06:45:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 143 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 149 transitions. [2025-02-08 06:45:19,199 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 149 transitions. Word has length 83 [2025-02-08 06:45:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:45:19,200 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 149 transitions. [2025-02-08 06:45:19,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 3.607843137254902) internal successors, (184), 52 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 149 transitions. [2025-02-08 06:45:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 06:45:19,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:45:19,200 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 06:45:19,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 06:45:19,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:45:19,401 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:45:19,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:45:19,401 INFO L85 PathProgramCache]: Analyzing trace with hash 992102785, now seen corresponding path program 2 times [2025-02-08 06:45:19,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:45:19,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121195002] [2025-02-08 06:45:19,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:45:19,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:45:19,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-02-08 06:45:19,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 06:45:19,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:45:19,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:45:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 60 proven. 57 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:45:21,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:45:21,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121195002] [2025-02-08 06:45:21,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121195002] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:45:21,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673509428] [2025-02-08 06:45:21,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:45:21,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:45:21,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:45:21,233 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:45:21,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:45:21,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-02-08 06:45:21,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 06:45:21,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:45:21,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:45:21,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-02-08 06:45:21,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:45:21,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:45:21,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:45:21,649 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:45:21,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 06:45:21,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-02-08 06:45:21,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:45:21,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:45:21,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-08 06:45:21,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-08 06:45:21,857 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:45:21,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2025-02-08 06:45:21,865 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 31 treesize of output 16 [2025-02-08 06:45:21,978 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-08 06:45:21,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-02-08 06:45:21,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 06:45:22,058 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 23 treesize of output 16 [2025-02-08 06:45:22,063 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 41 treesize of output 30 [2025-02-08 06:45:22,078 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 41 treesize of output 30 [2025-02-08 06:45:22,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-02-08 06:45:22,096 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 23 treesize of output 16 [2025-02-08 06:45:22,109 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 41 treesize of output 30 [2025-02-08 06:45:22,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-02-08 06:45:22,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-02-08 06:45:22,212 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-02-08 06:45:22,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 38 [2025-02-08 06:45:22,234 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-02-08 06:45:22,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 48 [2025-02-08 06:45:22,349 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-02-08 06:45:22,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 84 [2025-02-08 06:45:22,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:45:22,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 38 [2025-02-08 06:45:22,961 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:45:22,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 34 [2025-02-08 06:45:22,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 06:45:22,970 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 60 proven. 49 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 06:45:22,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:45:35,708 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse11 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) .cse11 0))) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse11 0)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse9 (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (and (forall ((v_ArrVal_4733 Int) (v_ArrVal_4731 Int)) (let ((.cse0 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse9 .cse7 v_ArrVal_4733))) (.cse3 (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse6 .cse7 v_ArrVal_4731)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse2 (+ 4 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)))) (<= (+ (select (select .cse0 .cse1) .cse2) 8) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (forall ((v_ArrVal_4733 Int) (v_ArrVal_4731 Int)) (<= 0 (+ (let ((.cse10 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse9 .cse7 v_ArrVal_4733)))) (select (select .cse10 (select (select (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse6 .cse7 v_ArrVal_4731)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (+ 4 (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)))) 4))))))) is different from false [2025-02-08 06:45:35,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:35,725 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 108 [2025-02-08 06:45:35,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:35,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 88 [2025-02-08 06:45:35,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:35,768 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 259 treesize of output 216 [2025-02-08 06:45:35,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:35,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 199 treesize of output 156 [2025-02-08 06:45:41,544 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:45:41,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:45:41,673 INFO L349 Elim1Store]: treesize reduction 394, result has 37.9 percent of original size [2025-02-08 06:45:41,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 4190 treesize of output 3748 [2025-02-08 06:45:41,694 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:45:41,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:41,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2067 treesize of output 1607 [2025-02-08 06:45:41,731 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 3439 treesize of output 3363 [2025-02-08 06:45:41,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:41,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2415 treesize of output 2280 [2025-02-08 06:45:41,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:41,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 2097 treesize of output 1945 [2025-02-08 06:45:41,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1875 treesize of output 1793 [2025-02-08 06:45:42,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:42,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1370 treesize of output 1366 [2025-02-08 06:45:43,780 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 9 treesize of output 5 [2025-02-08 06:45:43,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-02-08 06:45:43,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 06:45:43,920 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:45:43,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:45:44,006 INFO L349 Elim1Store]: treesize reduction 496, result has 21.8 percent of original size [2025-02-08 06:45:44,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 3688 treesize of output 3375 [2025-02-08 06:45:44,024 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:45:44,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:45:44,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:45:44,124 INFO L349 Elim1Store]: treesize reduction 143, result has 48.4 percent of original size [2025-02-08 06:45:44,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 34487 treesize of output 23405 [2025-02-08 06:45:44,238 INFO L349 Elim1Store]: treesize reduction 30, result has 67.0 percent of original size [2025-02-08 06:45:44,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 8013 treesize of output 7824 [2025-02-08 06:45:44,356 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:45:44,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:44,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2050 treesize of output 2057 [2025-02-08 06:45:44,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:44,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 5365 treesize of output 5166 [2025-02-08 06:45:44,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:44,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 3589 treesize of output 3345 [2025-02-08 06:45:44,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:44,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 2639 treesize of output 2497 [2025-02-08 06:45:45,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:45,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2281 treesize of output 2265 [2025-02-08 06:45:46,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2025-02-08 06:45:46,488 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-08 06:45:46,491 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-08 06:45:46,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:46,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 57 [2025-02-08 06:45:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 60 proven. 47 refuted. 0 times theorem prover too weak. 11 trivial. 2 not checked. [2025-02-08 06:45:47,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673509428] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:45:47,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:45:47,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 19] total 56 [2025-02-08 06:45:47,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635666071] [2025-02-08 06:45:47,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:45:47,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-02-08 06:45:47,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:45:47,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-02-08 06:45:47,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2824, Unknown=49, NotChecked=108, Total=3192 [2025-02-08 06:45:47,860 INFO L87 Difference]: Start difference. First operand 144 states and 149 transitions. Second operand has 57 states, 56 states have (on average 3.6964285714285716) internal successors, (207), 57 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:45:52,160 INFO L93 Difference]: Finished difference Result 182 states and 191 transitions. [2025-02-08 06:45:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 06:45:52,161 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 3.6964285714285716) internal successors, (207), 57 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-08 06:45:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:45:52,161 INFO L225 Difference]: With dead ends: 182 [2025-02-08 06:45:52,161 INFO L226 Difference]: Without dead ends: 182 [2025-02-08 06:45:52,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1618 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=596, Invalid=4897, Unknown=61, NotChecked=146, Total=5700 [2025-02-08 06:45:52,162 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 208 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 2207 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 2395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-08 06:45:52,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1040 Invalid, 2395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2207 Invalid, 0 Unknown, 157 Unchecked, 2.7s Time] [2025-02-08 06:45:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-08 06:45:52,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 153. [2025-02-08 06:45:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 140 states have (on average 1.1285714285714286) internal successors, (158), 152 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 158 transitions. [2025-02-08 06:45:52,165 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 158 transitions. Word has length 83 [2025-02-08 06:45:52,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:45:52,166 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 158 transitions. [2025-02-08 06:45:52,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 3.6964285714285716) internal successors, (207), 57 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 158 transitions. [2025-02-08 06:45:52,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 06:45:52,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:45:52,166 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:45:52,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 06:45:52,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-08 06:45:52,367 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:45:52,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:45:52,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2001806573, now seen corresponding path program 1 times [2025-02-08 06:45:52,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:45:52,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672155536] [2025-02-08 06:45:52,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:45:52,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:45:52,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 06:45:52,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 06:45:52,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:45:52,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:45:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 52 proven. 37 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 06:45:52,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:45:52,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672155536] [2025-02-08 06:45:52,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672155536] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:45:52,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835871035] [2025-02-08 06:45:52,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:45:52,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:45:52,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:45:52,977 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:45:52,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:45:53,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 06:45:53,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 06:45:53,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:45:53,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:45:53,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 06:45:53,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:45:53,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:45:53,315 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:45:53,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:45:53,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:45:53,367 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 23 treesize of output 22 [2025-02-08 06:45:53,403 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:45:53,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2025-02-08 06:45:53,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:53,517 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 40 treesize of output 16 [2025-02-08 06:45:53,537 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 60 proven. 13 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-08 06:45:53,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:45:53,641 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5106 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_5106) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_#StackHeapBarrier|)) is different from false [2025-02-08 06:45:53,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:53,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2025-02-08 06:45:53,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:53,695 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 46 treesize of output 28 [2025-02-08 06:45:53,698 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 9 treesize of output 5 [2025-02-08 06:45:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 60 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 2 not checked. [2025-02-08 06:45:53,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835871035] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:45:53,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:45:53,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2025-02-08 06:45:53,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465090762] [2025-02-08 06:45:53,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:45:53,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-08 06:45:53,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:45:53,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-08 06:45:53,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=526, Unknown=5, NotChecked=46, Total=650 [2025-02-08 06:45:53,811 INFO L87 Difference]: Start difference. First operand 153 states and 158 transitions. Second operand has 26 states, 25 states have (on average 5.36) internal successors, (134), 26 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:54,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:45:54,431 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2025-02-08 06:45:54,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:45:54,432 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.36) internal successors, (134), 26 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-08 06:45:54,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:45:54,432 INFO L225 Difference]: With dead ends: 168 [2025-02-08 06:45:54,432 INFO L226 Difference]: Without dead ends: 168 [2025-02-08 06:45:54,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 154 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=218, Invalid=971, Unknown=5, NotChecked=66, Total=1260 [2025-02-08 06:45:54,433 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 51 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:45:54,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 475 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 563 Invalid, 0 Unknown, 77 Unchecked, 0.3s Time] [2025-02-08 06:45:54,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-08 06:45:54,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-02-08 06:45:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 155 states have (on average 1.1161290322580646) internal successors, (173), 167 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 173 transitions. [2025-02-08 06:45:54,438 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 173 transitions. Word has length 84 [2025-02-08 06:45:54,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:45:54,439 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 173 transitions. [2025-02-08 06:45:54,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.36) internal successors, (134), 26 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:54,439 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 173 transitions. [2025-02-08 06:45:54,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 06:45:54,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:45:54,440 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:45:54,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 06:45:54,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:45:54,641 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:45:54,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:45:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash 198693373, now seen corresponding path program 1 times [2025-02-08 06:45:54,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:45:54,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054546156] [2025-02-08 06:45:54,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:45:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:45:54,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 06:45:54,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 06:45:54,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:45:54,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:45:55,516 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 67 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 06:45:55,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:45:55,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054546156] [2025-02-08 06:45:55,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054546156] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:45:55,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495440490] [2025-02-08 06:45:55,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:45:55,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:45:55,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:45:55,518 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:45:55,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 06:45:55,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 06:45:55,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 06:45:55,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:45:55,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:45:55,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-08 06:45:55,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:45:55,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:45:55,856 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:45:55,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:45:55,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:45:55,913 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 23 treesize of output 22 [2025-02-08 06:45:55,963 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2025-02-08 06:45:55,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 36 [2025-02-08 06:45:56,306 INFO L349 Elim1Store]: treesize reduction 55, result has 12.7 percent of original size [2025-02-08 06:45:56,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 28 [2025-02-08 06:45:56,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-02-08 06:45:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-08 06:45:56,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:45:56,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:56,676 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 43 treesize of output 47 [2025-02-08 06:45:56,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:45:56,846 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 416 treesize of output 409 [2025-02-08 06:45:56,866 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:45:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-08 06:45:56,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495440490] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:45:56,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:45:56,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 35 [2025-02-08 06:45:56,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230445783] [2025-02-08 06:45:56,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:45:56,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-08 06:45:56,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:45:56,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-08 06:45:56,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 06:45:56,979 INFO L87 Difference]: Start difference. First operand 168 states and 173 transitions. Second operand has 36 states, 35 states have (on average 4.2) internal successors, (147), 36 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:45:57,853 INFO L93 Difference]: Finished difference Result 171 states and 178 transitions. [2025-02-08 06:45:57,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 06:45:57,853 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.2) internal successors, (147), 36 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-02-08 06:45:57,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:45:57,854 INFO L225 Difference]: With dead ends: 171 [2025-02-08 06:45:57,854 INFO L226 Difference]: Without dead ends: 171 [2025-02-08 06:45:57,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=245, Invalid=2011, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 06:45:57,855 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 139 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:45:57,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 548 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 06:45:57,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-08 06:45:57,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2025-02-08 06:45:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 157 states have (on average 1.1210191082802548) internal successors, (176), 169 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 176 transitions. [2025-02-08 06:45:57,857 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 176 transitions. Word has length 87 [2025-02-08 06:45:57,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:45:57,858 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 176 transitions. [2025-02-08 06:45:57,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.2) internal successors, (147), 36 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:45:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 176 transitions. [2025-02-08 06:45:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 06:45:57,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:45:57,858 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:45:57,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 06:45:58,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:45:58,059 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:45:58,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:45:58,060 INFO L85 PathProgramCache]: Analyzing trace with hash 198693374, now seen corresponding path program 1 times [2025-02-08 06:45:58,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:45:58,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794492996] [2025-02-08 06:45:58,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:45:58,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:45:58,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 06:45:58,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 06:45:58,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:45:58,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:45:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 60 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 06:45:59,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:45:59,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794492996] [2025-02-08 06:45:59,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794492996] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:45:59,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475748401] [2025-02-08 06:45:59,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:45:59,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:45:59,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:45:59,255 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:45:59,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 06:45:59,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 06:45:59,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 06:45:59,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:45:59,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:45:59,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-08 06:45:59,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:45:59,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:45:59,613 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:45:59,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 06:45:59,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:45:59,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-08 06:45:59,761 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:45:59,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2025-02-08 06:45:59,840 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-08 06:45:59,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-02-08 06:45:59,883 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 40 treesize of output 29 [2025-02-08 06:45:59,895 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 40 treesize of output 29 [2025-02-08 06:45:59,906 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 40 treesize of output 29 [2025-02-08 06:45:59,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-02-08 06:45:59,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2025-02-08 06:46:00,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:46:00,057 INFO L349 Elim1Store]: treesize reduction 136, result has 18.1 percent of original size [2025-02-08 06:46:00,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 118 treesize of output 77 [2025-02-08 06:46:00,473 INFO L349 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2025-02-08 06:46:00,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 34 [2025-02-08 06:46:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 33 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 06:46:00,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:46:01,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:46:01,160 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 63 [2025-02-08 06:46:01,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_arrayElimArr_24 (Array Int Int)) (v_ArrVal_5863 Int)) (let ((.cse1 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_24 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12)) 0)) (not (= (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_24))) (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_5863))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) 4) 0)) (not (= (select v_arrayElimArr_24 .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2025-02-08 06:46:01,417 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_54| Int) (v_arrayElimArr_24 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.offset_79| Int) (v_ArrVal_5863 Int) (v_ArrVal_5857 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_91| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_79| 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_91|) 0)) (< |v_ULTIMATE.start_dll_create_~head~0#1.offset_54| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_24 .cse0))) (not (= (select v_arrayElimArr_24 (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_79| 12)) 0)) (not (= (select (let ((.cse1 (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_5857) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_91| v_arrayElimArr_24))) (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_54| 12) v_ArrVal_5863))))) (select .cse1 (select (select .cse1 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_91|) .cse0))) 4) 0))))) is different from false [2025-02-08 06:46:01,457 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_54| Int) (v_arrayElimArr_24 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.offset_79| Int) (v_ArrVal_5863 Int) (v_ArrVal_5857 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_91| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_79| 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_91|) 0)) (< |v_ULTIMATE.start_dll_create_~head~0#1.offset_54| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_24 .cse0))) (not (= (select v_arrayElimArr_24 (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_79| 12)) 0)) (not (= (select (let ((.cse1 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_5857) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_91| v_arrayElimArr_24) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_5857) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_91| v_arrayElimArr_24) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_54| 12) v_ArrVal_5863)))) (select .cse1 (select (select .cse1 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_91|) .cse0))) 4) 0))))) is different from false [2025-02-08 06:46:01,536 INFO L349 Elim1Store]: treesize reduction 99, result has 41.1 percent of original size [2025-02-08 06:46:01,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 4212 treesize of output 2956 [2025-02-08 06:46:01,635 INFO L349 Elim1Store]: treesize reduction 38, result has 67.0 percent of original size [2025-02-08 06:46:01,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 9 case distinctions, treesize of input 8657 treesize of output 8456 [2025-02-08 06:46:01,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:46:01,764 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 2529 treesize of output 2507 [2025-02-08 06:46:01,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:46:01,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 3710 treesize of output 3300 [2025-02-08 06:46:03,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:46:03,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 57 [2025-02-08 06:46:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 14 not checked. [2025-02-08 06:46:03,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475748401] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:46:03,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:46:03,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 21] total 51 [2025-02-08 06:46:03,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027386661] [2025-02-08 06:46:03,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:46:03,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-02-08 06:46:03,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:03,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-02-08 06:46:03,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2099, Unknown=4, NotChecked=282, Total=2550 [2025-02-08 06:46:03,776 INFO L87 Difference]: Start difference. First operand 170 states and 176 transitions. Second operand has 51 states, 51 states have (on average 3.7450980392156863) internal successors, (191), 51 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:05,988 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2025-02-08 06:46:05,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 06:46:05,989 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.7450980392156863) internal successors, (191), 51 states have internal predecessors, (191), 0 states have call successors, (0), 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 87 [2025-02-08 06:46:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:05,989 INFO L225 Difference]: With dead ends: 167 [2025-02-08 06:46:05,989 INFO L226 Difference]: Without dead ends: 153 [2025-02-08 06:46:05,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=518, Invalid=4320, Unknown=4, NotChecked=414, Total=5256 [2025-02-08 06:46:05,991 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 94 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:05,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1175 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1664 Invalid, 0 Unknown, 261 Unchecked, 1.0s Time] [2025-02-08 06:46:05,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-08 06:46:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-08 06:46:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 140 states have (on average 1.1214285714285714) internal successors, (157), 152 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2025-02-08 06:46:05,995 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 87 [2025-02-08 06:46:05,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:05,996 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2025-02-08 06:46:05,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.7450980392156863) internal successors, (191), 51 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2025-02-08 06:46:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 06:46:05,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:05,996 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2025-02-08 06:46:06,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-08 06:46:06,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-08 06:46:06,197 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-08 06:46:06,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:06,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1141692875, now seen corresponding path program 3 times [2025-02-08 06:46:06,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:06,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666988503] [2025-02-08 06:46:06,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:46:06,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:06,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 6 equivalence classes. [2025-02-08 06:46:06,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 79 of 98 statements. [2025-02-08 06:46:06,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 06:46:06,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 67 proven. 68 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 06:46:07,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:07,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666988503] [2025-02-08 06:46:07,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666988503] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:46:07,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308208405] [2025-02-08 06:46:07,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:46:07,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:07,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:07,944 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:46:07,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 06:46:08,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 6 equivalence classes. [2025-02-08 06:46:08,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 79 of 98 statements. [2025-02-08 06:46:08,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 06:46:08,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:08,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 110 conjuncts are in the unsatisfiable core [2025-02-08 06:46:08,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:46:08,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:46:08,900 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 23 treesize of output 22 [2025-02-08 06:46:08,962 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-02-08 06:46:08,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 47 [2025-02-08 06:46:09,093 INFO L349 Elim1Store]: treesize reduction 72, result has 30.1 percent of original size [2025-02-08 06:46:09,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 40 [2025-02-08 06:46:09,176 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-08 06:46:09,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 66 [2025-02-08 06:46:09,264 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-08 06:46:09,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 66 [2025-02-08 06:46:09,314 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-08 06:46:09,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 66 [2025-02-08 06:46:09,362 INFO L349 Elim1Store]: treesize reduction 102, result has 15.7 percent of original size [2025-02-08 06:46:09,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 84 treesize of output 71 [2025-02-08 06:46:09,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:46:09,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-08 06:46:09,497 INFO L349 Elim1Store]: treesize reduction 122, result has 13.5 percent of original size [2025-02-08 06:46:09,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 91 treesize of output 81 [2025-02-08 06:46:09,681 INFO L349 Elim1Store]: treesize reduction 304, result has 20.2 percent of original size [2025-02-08 06:46:09,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 18 case distinctions, treesize of input 216 treesize of output 163 [2025-02-08 06:46:09,691 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 264 treesize of output 227 [2025-02-08 06:46:09,904 INFO L349 Elim1Store]: treesize reduction 140, result has 31.4 percent of original size [2025-02-08 06:46:09,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 47 treesize of output 76 [2025-02-08 06:46:10,071 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2025-02-08 06:46:10,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 145 treesize of output 116 [2025-02-08 06:46:10,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 105 [2025-02-08 06:46:10,216 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2025-02-08 06:46:10,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 145 treesize of output 116 [2025-02-08 06:46:10,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 105 [2025-02-08 06:46:10,268 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2025-02-08 06:46:10,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 145 treesize of output 116 [2025-02-08 06:46:10,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 105 [2025-02-08 06:46:10,325 INFO L349 Elim1Store]: treesize reduction 144, result has 13.8 percent of original size [2025-02-08 06:46:10,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 148 treesize of output 86 [2025-02-08 06:46:10,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 109 [2025-02-08 06:46:10,500 INFO L349 Elim1Store]: treesize reduction 194, result has 13.4 percent of original size [2025-02-08 06:46:10,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 155 treesize of output 96 [2025-02-08 06:46:10,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:46:10,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 119 [2025-02-08 06:46:10,730 INFO L349 Elim1Store]: treesize reduction 208, result has 10.3 percent of original size [2025-02-08 06:46:10,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 17 case distinctions, treesize of input 290 treesize of output 133 [2025-02-08 06:46:10,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:46:10,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 151 [2025-02-08 06:46:12,683 INFO L349 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-02-08 06:46:12,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 332 treesize of output 360