./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.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 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:34:21,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:34:21,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:34:21,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:34:21,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:34:21,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:34:21,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:34:21,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:34:21,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:34:21,947 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:34:21,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:34:21,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:34:21,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:34:21,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:34:21,948 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:34:21,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:34:21,948 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:34:21,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:34:21,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:34:21,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:34:21,949 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:34:21,949 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:34:21,949 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:34:21,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:34:21,949 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:34:21,949 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:34:21,949 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:34:21,950 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:34:21,950 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:34:21,950 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:34:21,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:34:21,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:34:21,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:34:21,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:21,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:34:21,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:34:21,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:34:21,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:34:21,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:21,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:34:21,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:34:21,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:34:21,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:34:21,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:34:21,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:34:21,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:34:21,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:34:21,952 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 -> 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 [2025-01-09 22:34:22,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:34:22,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:34:22,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:34:22,215 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:34:22,216 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:34:22,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2025-01-09 22:34:23,477 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b32ebe1d/0d4aa18da86147b4880478d5bb582dc8/FLAG55cf53a28 [2025-01-09 22:34:23,770 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:34:23,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2025-01-09 22:34:23,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b32ebe1d/0d4aa18da86147b4880478d5bb582dc8/FLAG55cf53a28 [2025-01-09 22:34:23,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b32ebe1d/0d4aa18da86147b4880478d5bb582dc8 [2025-01-09 22:34:23,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:34:23,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:34:23,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:34:23,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:34:23,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:34:23,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:34:23" (1/1) ... [2025-01-09 22:34:23,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b75528f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:23, skipping insertion in model container [2025-01-09 22:34:23,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:34:23" (1/1) ... [2025-01-09 22:34:23,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:34:24,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:34:24,140 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:34:24,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:34:24,221 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:34:24,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:24 WrapperNode [2025-01-09 22:34:24,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:34:24,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:34:24,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:34:24,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:34:24,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:24" (1/1) ... [2025-01-09 22:34:24,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:24" (1/1) ... [2025-01-09 22:34:24,261 INFO L138 Inliner]: procedures = 140, calls = 95, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 210 [2025-01-09 22:34:24,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:34:24,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:34:24,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:34:24,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:34:24,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:24" (1/1) ... [2025-01-09 22:34:24,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:24" (1/1) ... [2025-01-09 22:34:24,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:24" (1/1) ... [2025-01-09 22:34:24,316 INFO L175 MemorySlicer]: Split 48 memory accesses to 3 slices as follows [40, 2, 6]. 83 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [0, 2, 1]. The 13 writes are split as follows [11, 0, 2]. [2025-01-09 22:34:24,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:24" (1/1) ... [2025-01-09 22:34:24,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:24" (1/1) ... [2025-01-09 22:34:24,332 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:24" (1/1) ... [2025-01-09 22:34:24,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:24" (1/1) ... [2025-01-09 22:34:24,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:24" (1/1) ... [2025-01-09 22:34:24,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:24" (1/1) ... [2025-01-09 22:34:24,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:24" (1/1) ... [2025-01-09 22:34:24,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:34:24,345 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:34:24,345 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:34:24,345 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:34:24,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:24" (1/1) ... [2025-01-09 22:34:24,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:24,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:24,378 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-01-09 22:34:24,381 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-01-09 22:34:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-01-09 22:34:24,400 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-01-09 22:34:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2025-01-09 22:34:24,400 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2025-01-09 22:34:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:34:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:34:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2025-01-09 22:34:24,401 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2025-01-09 22:34:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:34:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:34:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:34:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:34:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 22:34:24,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 22:34:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:34:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:34:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:34:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:34:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:34:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:34:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:34:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2025-01-09 22:34:24,401 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2025-01-09 22:34:24,402 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2025-01-09 22:34:24,402 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2025-01-09 22:34:24,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:34:24,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:34:24,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:34:24,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:34:24,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:34:24,572 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:34:24,574 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:34:25,258 INFO L? ?]: Removed 240 outVars from TransFormulas that were not future-live. [2025-01-09 22:34:25,258 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:34:25,282 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:34:25,282 INFO L312 CfgBuilder]: Removed 15 assume(true) statements. [2025-01-09 22:34:25,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:34:25 BoogieIcfgContainer [2025-01-09 22:34:25,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:34:25,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:34:25,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:34:25,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:34:25,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:34:23" (1/3) ... [2025-01-09 22:34:25,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c95699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:34:25, skipping insertion in model container [2025-01-09 22:34:25,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:24" (2/3) ... [2025-01-09 22:34:25,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c95699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:34:25, skipping insertion in model container [2025-01-09 22:34:25,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:34:25" (3/3) ... [2025-01-09 22:34:25,294 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_of_dll-1.i [2025-01-09 22:34:25,307 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:34:25,309 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_of_dll-1.i that has 7 procedures, 274 locations, 1 initial locations, 24 loop locations, and 98 error locations. [2025-01-09 22:34:25,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:34:25,367 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;@13e6ba14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:34:25,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2025-01-09 22:34:25,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 274 states, 145 states have (on average 2.0827586206896553) internal successors, (302), 262 states have internal predecessors, (302), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 22:34:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:34:25,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:25,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:25,381 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:25,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:25,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1436347105, now seen corresponding path program 1 times [2025-01-09 22:34:25,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:25,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436346371] [2025-01-09 22:34:25,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:25,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:25,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:34:25,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:34:25,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:25,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:25,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:25,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:25,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436346371] [2025-01-09 22:34:25,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436346371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:25,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:25,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:25,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943028252] [2025-01-09 22:34:25,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:25,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:34:25,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:25,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:34:25,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:34:25,598 INFO L87 Difference]: Start difference. First operand has 274 states, 145 states have (on average 2.0827586206896553) internal successors, (302), 262 states have internal predecessors, (302), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:25,625 INFO L93 Difference]: Finished difference Result 271 states and 301 transitions. [2025-01-09 22:34:25,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:34:25,626 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:34:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:25,634 INFO L225 Difference]: With dead ends: 271 [2025-01-09 22:34:25,634 INFO L226 Difference]: Without dead ends: 269 [2025-01-09 22:34:25,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:34:25,638 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:25,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:25,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-01-09 22:34:25,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-01-09 22:34:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 142 states have (on average 1.8661971830985915) internal successors, (265), 257 states have internal predecessors, (265), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:34:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 299 transitions. [2025-01-09 22:34:25,692 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 299 transitions. Word has length 9 [2025-01-09 22:34:25,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:25,693 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 299 transitions. [2025-01-09 22:34:25,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 299 transitions. [2025-01-09 22:34:25,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:34:25,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:25,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:25,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:34:25,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:25,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:25,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1436347167, now seen corresponding path program 1 times [2025-01-09 22:34:25,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:25,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010517923] [2025-01-09 22:34:25,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:25,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:25,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:34:25,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:34:25,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:25,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:25,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:25,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010517923] [2025-01-09 22:34:25,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010517923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:25,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:25,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:25,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549860923] [2025-01-09 22:34:25,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:25,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:25,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:25,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:25,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:25,828 INFO L87 Difference]: Start difference. First operand 269 states and 299 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:26,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:26,057 INFO L93 Difference]: Finished difference Result 267 states and 297 transitions. [2025-01-09 22:34:26,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:26,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:34:26,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:26,059 INFO L225 Difference]: With dead ends: 267 [2025-01-09 22:34:26,059 INFO L226 Difference]: Without dead ends: 267 [2025-01-09 22:34:26,059 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-01-09 22:34:26,060 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 2 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:26,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 484 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:26,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-09 22:34:26,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-01-09 22:34:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 142 states have (on average 1.852112676056338) internal successors, (263), 255 states have internal predecessors, (263), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:34:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 297 transitions. [2025-01-09 22:34:26,083 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 297 transitions. Word has length 9 [2025-01-09 22:34:26,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:26,083 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 297 transitions. [2025-01-09 22:34:26,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:26,084 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 297 transitions. [2025-01-09 22:34:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:34:26,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:26,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:26,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:34:26,084 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:26,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:26,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1436347168, now seen corresponding path program 1 times [2025-01-09 22:34:26,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:26,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006088574] [2025-01-09 22:34:26,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:26,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:26,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:34:26,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:34:26,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:26,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:26,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:26,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006088574] [2025-01-09 22:34:26,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006088574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:26,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:26,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:34:26,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503253841] [2025-01-09 22:34:26,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:26,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:34:26,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:26,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:34:26,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:34:26,313 INFO L87 Difference]: Start difference. First operand 267 states and 297 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:26,403 INFO L93 Difference]: Finished difference Result 293 states and 331 transitions. [2025-01-09 22:34:26,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:34:26,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:34:26,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:26,405 INFO L225 Difference]: With dead ends: 293 [2025-01-09 22:34:26,405 INFO L226 Difference]: Without dead ends: 293 [2025-01-09 22:34:26,406 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-01-09 22:34:26,406 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 19 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:26,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1210 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-01-09 22:34:26,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 285. [2025-01-09 22:34:26,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 153 states have (on average 1.8169934640522876) internal successors, (278), 266 states have internal predecessors, (278), 29 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2025-01-09 22:34:26,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 325 transitions. [2025-01-09 22:34:26,424 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 325 transitions. Word has length 9 [2025-01-09 22:34:26,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:26,424 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 325 transitions. [2025-01-09 22:34:26,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:26,425 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 325 transitions. [2025-01-09 22:34:26,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:34:26,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:26,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:26,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:34:26,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:26,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:26,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1657193007, now seen corresponding path program 1 times [2025-01-09 22:34:26,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:26,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173747123] [2025-01-09 22:34:26,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:26,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:26,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:34:26,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:34:26,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:26,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:26,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:26,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173747123] [2025-01-09 22:34:26,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173747123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:26,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:26,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:26,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978579285] [2025-01-09 22:34:26,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:26,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:26,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:26,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:26,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:26,490 INFO L87 Difference]: Start difference. First operand 285 states and 325 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:26,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:26,631 INFO L93 Difference]: Finished difference Result 282 states and 322 transitions. [2025-01-09 22:34:26,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:26,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-09 22:34:26,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:26,634 INFO L225 Difference]: With dead ends: 282 [2025-01-09 22:34:26,635 INFO L226 Difference]: Without dead ends: 282 [2025-01-09 22:34:26,635 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-01-09 22:34:26,636 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 3 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:26,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 478 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:26,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-09 22:34:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-01-09 22:34:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 153 states have (on average 1.7973856209150327) internal successors, (275), 263 states have internal predecessors, (275), 29 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2025-01-09 22:34:26,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 322 transitions. [2025-01-09 22:34:26,655 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 322 transitions. Word has length 11 [2025-01-09 22:34:26,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:26,655 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 322 transitions. [2025-01-09 22:34:26,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:26,655 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 322 transitions. [2025-01-09 22:34:26,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:34:26,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:26,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:26,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:34:26,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:26,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:26,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1657193008, now seen corresponding path program 1 times [2025-01-09 22:34:26,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:26,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546442298] [2025-01-09 22:34:26,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:26,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:26,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:34:26,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:34:26,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:26,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:26,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:26,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:26,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546442298] [2025-01-09 22:34:26,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546442298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:26,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:26,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:26,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947834570] [2025-01-09 22:34:26,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:26,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:26,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:26,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:26,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:26,749 INFO L87 Difference]: Start difference. First operand 282 states and 322 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:26,886 INFO L93 Difference]: Finished difference Result 279 states and 319 transitions. [2025-01-09 22:34:26,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:26,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-09 22:34:26,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:26,888 INFO L225 Difference]: With dead ends: 279 [2025-01-09 22:34:26,888 INFO L226 Difference]: Without dead ends: 279 [2025-01-09 22:34:26,888 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-01-09 22:34:26,889 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 3 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:26,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 483 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-01-09 22:34:26,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-01-09 22:34:26,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 153 states have (on average 1.7777777777777777) internal successors, (272), 260 states have internal predecessors, (272), 29 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2025-01-09 22:34:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 319 transitions. [2025-01-09 22:34:26,904 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 319 transitions. Word has length 11 [2025-01-09 22:34:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:26,905 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 319 transitions. [2025-01-09 22:34:26,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:26,934 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 319 transitions. [2025-01-09 22:34:26,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:34:26,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:26,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:26,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:34:26,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting dll_insert_masterErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:26,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:26,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1000330236, now seen corresponding path program 1 times [2025-01-09 22:34:26,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:26,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892229490] [2025-01-09 22:34:26,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:26,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:26,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:34:26,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:34:26,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:26,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:27,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:27,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892229490] [2025-01-09 22:34:27,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892229490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:27,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:27,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:34:27,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510714353] [2025-01-09 22:34:27,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:27,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:34:27,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:27,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:34:27,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:34:27,168 INFO L87 Difference]: Start difference. First operand 279 states and 319 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:27,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:27,632 INFO L93 Difference]: Finished difference Result 301 states and 345 transitions. [2025-01-09 22:34:27,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:34:27,632 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 22:34:27,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:27,634 INFO L225 Difference]: With dead ends: 301 [2025-01-09 22:34:27,635 INFO L226 Difference]: Without dead ends: 301 [2025-01-09 22:34:27,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:34:27,636 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 86 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:27,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1163 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:34:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-09 22:34:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 291. [2025-01-09 22:34:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 164 states have (on average 1.7378048780487805) internal successors, (285), 270 states have internal predecessors, (285), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2025-01-09 22:34:27,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 334 transitions. [2025-01-09 22:34:27,650 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 334 transitions. Word has length 16 [2025-01-09 22:34:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:27,650 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 334 transitions. [2025-01-09 22:34:27,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:27,651 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 334 transitions. [2025-01-09 22:34:27,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:34:27,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:27,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:27,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:34:27,652 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting dll_insert_masterErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:27,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1000330235, now seen corresponding path program 1 times [2025-01-09 22:34:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:27,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561113861] [2025-01-09 22:34:27,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:27,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:34:27,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:34:27,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:27,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:27,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:27,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561113861] [2025-01-09 22:34:27,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561113861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:27,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:27,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:34:27,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690313284] [2025-01-09 22:34:27,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:27,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:34:27,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:27,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:34:27,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:34:27,966 INFO L87 Difference]: Start difference. First operand 291 states and 334 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:28,514 INFO L93 Difference]: Finished difference Result 300 states and 343 transitions. [2025-01-09 22:34:28,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:34:28,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 22:34:28,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:28,518 INFO L225 Difference]: With dead ends: 300 [2025-01-09 22:34:28,518 INFO L226 Difference]: Without dead ends: 300 [2025-01-09 22:34:28,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:28,519 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 55 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:28,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1013 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:34:28,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-01-09 22:34:28,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 291. [2025-01-09 22:34:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 164 states have (on average 1.725609756097561) internal successors, (283), 270 states have internal predecessors, (283), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2025-01-09 22:34:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 332 transitions. [2025-01-09 22:34:28,534 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 332 transitions. Word has length 16 [2025-01-09 22:34:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:28,535 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 332 transitions. [2025-01-09 22:34:28,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 332 transitions. [2025-01-09 22:34:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:34:28,536 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:28,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:28,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:34:28,537 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting dll_insert_masterErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:28,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash 755317349, now seen corresponding path program 1 times [2025-01-09 22:34:28,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:28,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790407827] [2025-01-09 22:34:28,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:28,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:28,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:34:28,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:34:28,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:28,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:28,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:28,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:28,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790407827] [2025-01-09 22:34:28,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790407827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:28,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:28,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:34:28,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391911339] [2025-01-09 22:34:28,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:28,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:34:28,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:28,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:34:28,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:34:28,622 INFO L87 Difference]: Start difference. First operand 291 states and 332 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:28,828 INFO L93 Difference]: Finished difference Result 290 states and 331 transitions. [2025-01-09 22:34:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:34:28,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 22:34:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:28,831 INFO L225 Difference]: With dead ends: 290 [2025-01-09 22:34:28,833 INFO L226 Difference]: Without dead ends: 290 [2025-01-09 22:34:28,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:34:28,833 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 12 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:28,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 837 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:28,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-01-09 22:34:28,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-01-09 22:34:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 164 states have (on average 1.7195121951219512) internal successors, (282), 269 states have internal predecessors, (282), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2025-01-09 22:34:28,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 331 transitions. [2025-01-09 22:34:28,848 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 331 transitions. Word has length 18 [2025-01-09 22:34:28,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:28,849 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 331 transitions. [2025-01-09 22:34:28,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:28,849 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 331 transitions. [2025-01-09 22:34:28,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:34:28,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:28,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:28,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:34:28,850 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting dll_insert_masterErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:28,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:28,851 INFO L85 PathProgramCache]: Analyzing trace with hash 755317350, now seen corresponding path program 1 times [2025-01-09 22:34:28,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:28,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174988631] [2025-01-09 22:34:28,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:28,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:28,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:34:28,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:34:28,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:28,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:28,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:28,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174988631] [2025-01-09 22:34:28,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174988631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:28,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:28,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:34:28,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385005856] [2025-01-09 22:34:28,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:28,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:34:28,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:28,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:34:28,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:28,987 INFO L87 Difference]: Start difference. First operand 290 states and 331 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:29,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:29,192 INFO L93 Difference]: Finished difference Result 289 states and 330 transitions. [2025-01-09 22:34:29,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:34:29,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 22:34:29,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:29,194 INFO L225 Difference]: With dead ends: 289 [2025-01-09 22:34:29,194 INFO L226 Difference]: Without dead ends: 289 [2025-01-09 22:34:29,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:29,194 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 11 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:29,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1133 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:29,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-01-09 22:34:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-01-09 22:34:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 164 states have (on average 1.7134146341463414) internal successors, (281), 268 states have internal predecessors, (281), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2025-01-09 22:34:29,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 330 transitions. [2025-01-09 22:34:29,203 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 330 transitions. Word has length 18 [2025-01-09 22:34:29,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:29,203 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 330 transitions. [2025-01-09 22:34:29,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 330 transitions. [2025-01-09 22:34:29,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:34:29,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:29,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:29,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:34:29,204 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:29,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:29,205 INFO L85 PathProgramCache]: Analyzing trace with hash 10499398, now seen corresponding path program 1 times [2025-01-09 22:34:29,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:29,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496924754] [2025-01-09 22:34:29,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:29,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:29,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:34:29,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:34:29,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:29,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:29,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:29,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496924754] [2025-01-09 22:34:29,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496924754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:29,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:29,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:34:29,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698001769] [2025-01-09 22:34:29,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:29,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:34:29,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:29,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:34:29,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:29,451 INFO L87 Difference]: Start difference. First operand 289 states and 330 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:29,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:29,608 INFO L93 Difference]: Finished difference Result 325 states and 370 transitions. [2025-01-09 22:34:29,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:34:29,609 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 22:34:29,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:29,611 INFO L225 Difference]: With dead ends: 325 [2025-01-09 22:34:29,611 INFO L226 Difference]: Without dead ends: 325 [2025-01-09 22:34:29,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:34:29,612 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 39 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2207 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-01-09 22:34:29,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2207 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-01-09 22:34:29,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 303. [2025-01-09 22:34:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 177 states have (on average 1.6666666666666667) internal successors, (295), 280 states have internal predecessors, (295), 31 states have call successors, (31), 12 states have call predecessors, (31), 7 states have return successors, (20), 13 states have call predecessors, (20), 17 states have call successors, (20) [2025-01-09 22:34:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 346 transitions. [2025-01-09 22:34:29,628 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 346 transitions. Word has length 20 [2025-01-09 22:34:29,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:29,629 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 346 transitions. [2025-01-09 22:34:29,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 346 transitions. [2025-01-09 22:34:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:34:29,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:29,630 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:29,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:34:29,630 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:29,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:29,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1077945123, now seen corresponding path program 1 times [2025-01-09 22:34:29,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:29,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25340862] [2025-01-09 22:34:29,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:29,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:29,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:34:29,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:34:29,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:29,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:34:29,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:29,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25340862] [2025-01-09 22:34:29,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25340862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:29,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:29,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:29,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390942832] [2025-01-09 22:34:29,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:29,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:29,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:29,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:29,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:29,718 INFO L87 Difference]: Start difference. First operand 303 states and 346 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:29,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:29,824 INFO L93 Difference]: Finished difference Result 301 states and 344 transitions. [2025-01-09 22:34:29,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:29,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-09 22:34:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:29,826 INFO L225 Difference]: With dead ends: 301 [2025-01-09 22:34:29,826 INFO L226 Difference]: Without dead ends: 301 [2025-01-09 22:34:29,827 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-01-09 22:34:29,827 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 2 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:29,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 479 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-09 22:34:29,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2025-01-09 22:34:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 177 states have (on average 1.655367231638418) internal successors, (293), 278 states have internal predecessors, (293), 31 states have call successors, (31), 12 states have call predecessors, (31), 7 states have return successors, (20), 13 states have call predecessors, (20), 17 states have call successors, (20) [2025-01-09 22:34:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 344 transitions. [2025-01-09 22:34:29,837 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 344 transitions. Word has length 27 [2025-01-09 22:34:29,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:29,837 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 344 transitions. [2025-01-09 22:34:29,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 344 transitions. [2025-01-09 22:34:29,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:34:29,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:29,839 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:29,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:34:29,839 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~VOIDErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:29,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:29,839 INFO L85 PathProgramCache]: Analyzing trace with hash 259313286, now seen corresponding path program 1 times [2025-01-09 22:34:29,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:29,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206642330] [2025-01-09 22:34:29,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:29,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:29,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:34:29,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:34:29,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:29,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:30,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:30,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206642330] [2025-01-09 22:34:30,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206642330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:30,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:30,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:34:30,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415698538] [2025-01-09 22:34:30,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:30,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:34:30,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:30,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:34:30,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:34:30,032 INFO L87 Difference]: Start difference. First operand 301 states and 344 transitions. Second operand has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:30,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:30,305 INFO L93 Difference]: Finished difference Result 299 states and 342 transitions. [2025-01-09 22:34:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:34:30,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-01-09 22:34:30,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:30,307 INFO L225 Difference]: With dead ends: 299 [2025-01-09 22:34:30,307 INFO L226 Difference]: Without dead ends: 299 [2025-01-09 22:34:30,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:30,307 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 48 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:30,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 979 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:30,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-01-09 22:34:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-01-09 22:34:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 177 states have (on average 1.6440677966101696) internal successors, (291), 276 states have internal predecessors, (291), 31 states have call successors, (31), 12 states have call predecessors, (31), 7 states have return successors, (20), 13 states have call predecessors, (20), 17 states have call successors, (20) [2025-01-09 22:34:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 342 transitions. [2025-01-09 22:34:30,319 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 342 transitions. Word has length 31 [2025-01-09 22:34:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:30,320 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 342 transitions. [2025-01-09 22:34:30,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 342 transitions. [2025-01-09 22:34:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:34:30,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:30,321 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:30,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:34:30,321 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~VOIDErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:30,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:30,324 INFO L85 PathProgramCache]: Analyzing trace with hash 259313287, now seen corresponding path program 1 times [2025-01-09 22:34:30,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:30,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882277496] [2025-01-09 22:34:30,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:30,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:30,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:34:30,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:34:30,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:30,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:30,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:30,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882277496] [2025-01-09 22:34:30,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882277496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:30,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:30,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:34:30,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550018331] [2025-01-09 22:34:30,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:30,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:34:30,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:30,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:34:30,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:30,593 INFO L87 Difference]: Start difference. First operand 299 states and 342 transitions. Second operand has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:30,964 INFO L93 Difference]: Finished difference Result 297 states and 340 transitions. [2025-01-09 22:34:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:34:30,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-01-09 22:34:30,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:30,966 INFO L225 Difference]: With dead ends: 297 [2025-01-09 22:34:30,967 INFO L226 Difference]: Without dead ends: 297 [2025-01-09 22:34:30,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:34:30,967 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 34 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:30,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 877 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:34:30,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-01-09 22:34:30,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2025-01-09 22:34:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 177 states have (on average 1.6327683615819208) internal successors, (289), 274 states have internal predecessors, (289), 31 states have call successors, (31), 12 states have call predecessors, (31), 7 states have return successors, (20), 13 states have call predecessors, (20), 17 states have call successors, (20) [2025-01-09 22:34:30,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 340 transitions. [2025-01-09 22:34:30,976 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 340 transitions. Word has length 31 [2025-01-09 22:34:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:30,976 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 340 transitions. [2025-01-09 22:34:30,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 340 transitions. [2025-01-09 22:34:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:34:30,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:30,979 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:30,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:34:30,979 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~VOIDErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:30,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:30,980 INFO L85 PathProgramCache]: Analyzing trace with hash 91967079, now seen corresponding path program 1 times [2025-01-09 22:34:30,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:30,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233444574] [2025-01-09 22:34:30,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:30,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:30,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:34:31,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:34:31,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:31,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:34:31,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:31,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233444574] [2025-01-09 22:34:31,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233444574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:31,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:31,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:34:31,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4507810] [2025-01-09 22:34:31,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:31,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:34:31,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:31,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:34:31,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:34:31,061 INFO L87 Difference]: Start difference. First operand 297 states and 340 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:31,247 INFO L93 Difference]: Finished difference Result 296 states and 339 transitions. [2025-01-09 22:34:31,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:34:31,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-01-09 22:34:31,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:31,249 INFO L225 Difference]: With dead ends: 296 [2025-01-09 22:34:31,249 INFO L226 Difference]: Without dead ends: 296 [2025-01-09 22:34:31,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:34:31,249 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 7 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:31,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 824 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:31,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-01-09 22:34:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-01-09 22:34:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 177 states have (on average 1.6271186440677967) internal successors, (288), 273 states have internal predecessors, (288), 31 states have call successors, (31), 12 states have call predecessors, (31), 7 states have return successors, (20), 13 states have call predecessors, (20), 17 states have call successors, (20) [2025-01-09 22:34:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 339 transitions. [2025-01-09 22:34:31,260 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 339 transitions. Word has length 33 [2025-01-09 22:34:31,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:31,260 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 339 transitions. [2025-01-09 22:34:31,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 339 transitions. [2025-01-09 22:34:31,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:34:31,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:31,261 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:31,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:34:31,261 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~VOIDErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:31,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:31,261 INFO L85 PathProgramCache]: Analyzing trace with hash 91967080, now seen corresponding path program 1 times [2025-01-09 22:34:31,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:31,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728669154] [2025-01-09 22:34:31,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:31,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:31,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:34:31,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:34:31,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:31,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:34:31,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:31,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728669154] [2025-01-09 22:34:31,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728669154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:31,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:31,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:34:31,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488662842] [2025-01-09 22:34:31,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:31,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:34:31,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:31,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:34:31,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:31,423 INFO L87 Difference]: Start difference. First operand 296 states and 339 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:31,580 INFO L93 Difference]: Finished difference Result 295 states and 338 transitions. [2025-01-09 22:34:31,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:34:31,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-01-09 22:34:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:31,582 INFO L225 Difference]: With dead ends: 295 [2025-01-09 22:34:31,583 INFO L226 Difference]: Without dead ends: 295 [2025-01-09 22:34:31,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:31,585 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 8 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:31,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 922 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:31,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-01-09 22:34:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-01-09 22:34:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 177 states have (on average 1.6214689265536724) internal successors, (287), 272 states have internal predecessors, (287), 31 states have call successors, (31), 12 states have call predecessors, (31), 7 states have return successors, (20), 13 states have call predecessors, (20), 17 states have call successors, (20) [2025-01-09 22:34:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 338 transitions. [2025-01-09 22:34:31,594 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 338 transitions. Word has length 33 [2025-01-09 22:34:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:31,594 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 338 transitions. [2025-01-09 22:34:31,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 338 transitions. [2025-01-09 22:34:31,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:34:31,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:31,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:31,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:34:31,595 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:31,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:31,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1813947704, now seen corresponding path program 1 times [2025-01-09 22:34:31,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:31,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167406220] [2025-01-09 22:34:31,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:31,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:31,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:34:31,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:34:31,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:31,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:31,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:31,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167406220] [2025-01-09 22:34:31,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167406220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:31,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:31,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:34:31,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209862030] [2025-01-09 22:34:31,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:31,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:34:31,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:31,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:34:31,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:34:31,843 INFO L87 Difference]: Start difference. First operand 295 states and 338 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:31,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:31,966 INFO L93 Difference]: Finished difference Result 305 states and 348 transitions. [2025-01-09 22:34:31,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:34:31,967 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-01-09 22:34:31,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:31,968 INFO L225 Difference]: With dead ends: 305 [2025-01-09 22:34:31,969 INFO L226 Difference]: Without dead ends: 305 [2025-01-09 22:34:31,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:34:31,970 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 17 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:31,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1886 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:31,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-01-09 22:34:31,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2025-01-09 22:34:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 186 states have (on average 1.5913978494623655) internal successors, (296), 281 states have internal predecessors, (296), 31 states have call successors, (31), 12 states have call predecessors, (31), 7 states have return successors, (20), 13 states have call predecessors, (20), 17 states have call successors, (20) [2025-01-09 22:34:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 347 transitions. [2025-01-09 22:34:31,980 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 347 transitions. Word has length 35 [2025-01-09 22:34:31,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:31,981 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 347 transitions. [2025-01-09 22:34:31,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:34:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 347 transitions. [2025-01-09 22:34:31,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:34:31,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:31,982 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:31,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:34:31,982 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:31,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:31,982 INFO L85 PathProgramCache]: Analyzing trace with hash -703976550, now seen corresponding path program 1 times [2025-01-09 22:34:31,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:31,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517840198] [2025-01-09 22:34:31,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:31,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:32,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:34:32,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:34:32,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:32,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:34:32,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:32,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517840198] [2025-01-09 22:34:32,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517840198] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:32,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447309635] [2025-01-09 22:34:32,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:32,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:32,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:32,603 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-01-09 22:34:32,605 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-01-09 22:34:32,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:34:32,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:34:32,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:32,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:32,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-01-09 22:34:32,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:32,885 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 15 treesize of output 1 [2025-01-09 22:34:32,924 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 22:34:32,924 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 18 treesize of output 21 [2025-01-09 22:34:32,964 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 25 treesize of output 13 [2025-01-09 22:34:32,993 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:34:32,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:33,239 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 32 treesize of output 28 [2025-01-09 22:34:33,343 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:34:33,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-01-09 22:34:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:34:33,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447309635] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:33,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:33,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 21 [2025-01-09 22:34:33,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801624293] [2025-01-09 22:34:33,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:33,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 22:34:33,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:33,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 22:34:33,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:34:33,385 INFO L87 Difference]: Start difference. First operand 304 states and 347 transitions. Second operand has 22 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:34,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:34,406 INFO L93 Difference]: Finished difference Result 304 states and 347 transitions. [2025-01-09 22:34:34,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:34:34,406 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-01-09 22:34:34,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:34,408 INFO L225 Difference]: With dead ends: 304 [2025-01-09 22:34:34,408 INFO L226 Difference]: Without dead ends: 304 [2025-01-09 22:34:34,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2025-01-09 22:34:34,409 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 80 mSDsluCounter, 2663 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 2931 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:34,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 2931 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 22:34:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-01-09 22:34:34,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 303. [2025-01-09 22:34:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 186 states have (on average 1.586021505376344) internal successors, (295), 280 states have internal predecessors, (295), 31 states have call successors, (31), 12 states have call predecessors, (31), 7 states have return successors, (20), 13 states have call predecessors, (20), 17 states have call successors, (20) [2025-01-09 22:34:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 346 transitions. [2025-01-09 22:34:34,416 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 346 transitions. Word has length 51 [2025-01-09 22:34:34,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:34,417 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 346 transitions. [2025-01-09 22:34:34,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:34,417 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 346 transitions. [2025-01-09 22:34:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:34:34,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:34,418 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:34,427 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-01-09 22:34:34,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 22:34:34,622 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ##fun~$Pointer$~TO~VOIDErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:34,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:34,623 INFO L85 PathProgramCache]: Analyzing trace with hash -703976549, now seen corresponding path program 1 times [2025-01-09 22:34:34,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:34,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302233526] [2025-01-09 22:34:34,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:34,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:34,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:34:34,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:34:34,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:34,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:34:35,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:35,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302233526] [2025-01-09 22:34:35,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302233526] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:35,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288011468] [2025-01-09 22:34:35,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:35,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:35,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:35,382 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-01-09 22:34:35,385 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-01-09 22:34:35,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:34:35,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:34:35,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:35,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:35,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-01-09 22:34:35,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:35,595 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-01-09 22:34:35,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:34:35,729 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 15 treesize of output 1 [2025-01-09 22:34:35,784 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-01-09 22:34:35,784 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 16 treesize of output 18 [2025-01-09 22:34:35,896 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 17 treesize of output 9 [2025-01-09 22:34:35,913 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:34:35,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:36,311 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 66 treesize of output 62 [2025-01-09 22:34:36,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2025-01-09 22:34:36,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:36,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:34:36,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288011468] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:36,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:36,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11] total 22 [2025-01-09 22:34:36,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81633312] [2025-01-09 22:34:36,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:36,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 22:34:36,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:36,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 22:34:36,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:34:36,561 INFO L87 Difference]: Start difference. First operand 303 states and 346 transitions. Second operand has 23 states, 20 states have (on average 3.65) internal successors, (73), 21 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:34:37,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:37,763 INFO L93 Difference]: Finished difference Result 303 states and 346 transitions. [2025-01-09 22:34:37,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:34:37,764 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 3.65) internal successors, (73), 21 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2025-01-09 22:34:37,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:37,766 INFO L225 Difference]: With dead ends: 303 [2025-01-09 22:34:37,766 INFO L226 Difference]: Without dead ends: 303 [2025-01-09 22:34:37,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2025-01-09 22:34:37,767 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 29 mSDsluCounter, 3221 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3489 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:37,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3489 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 22:34:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-01-09 22:34:37,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 302. [2025-01-09 22:34:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 186 states have (on average 1.5806451612903225) internal successors, (294), 279 states have internal predecessors, (294), 31 states have call successors, (31), 12 states have call predecessors, (31), 7 states have return successors, (20), 13 states have call predecessors, (20), 17 states have call successors, (20) [2025-01-09 22:34:37,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 345 transitions. [2025-01-09 22:34:37,774 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 345 transitions. Word has length 51 [2025-01-09 22:34:37,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:37,774 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 345 transitions. [2025-01-09 22:34:37,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 3.65) internal successors, (73), 21 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:34:37,775 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 345 transitions. [2025-01-09 22:34:37,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 22:34:37,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:37,775 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:37,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:34:37,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 22:34:37,976 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:37,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:37,977 INFO L85 PathProgramCache]: Analyzing trace with hash 555979601, now seen corresponding path program 1 times [2025-01-09 22:34:37,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:37,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633984242] [2025-01-09 22:34:37,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:37,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:37,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 22:34:38,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:34:38,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:38,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:34:38,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:38,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633984242] [2025-01-09 22:34:38,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633984242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:38,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:38,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:34:38,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477449475] [2025-01-09 22:34:38,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:38,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:34:38,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:38,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:34:38,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:34:38,102 INFO L87 Difference]: Start difference. First operand 302 states and 345 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:38,141 INFO L93 Difference]: Finished difference Result 288 states and 320 transitions. [2025-01-09 22:34:38,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:34:38,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-01-09 22:34:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:38,143 INFO L225 Difference]: With dead ends: 288 [2025-01-09 22:34:38,145 INFO L226 Difference]: Without dead ends: 288 [2025-01-09 22:34:38,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-01-09 22:34:38,145 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 28 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:38,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1089 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:38,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-01-09 22:34:38,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-01-09 22:34:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 175 states have (on average 1.5885714285714285) internal successors, (278), 268 states have internal predecessors, (278), 28 states have call successors, (28), 11 states have call predecessors, (28), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 22:34:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 320 transitions. [2025-01-09 22:34:38,154 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 320 transitions. Word has length 54 [2025-01-09 22:34:38,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:38,154 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 320 transitions. [2025-01-09 22:34:38,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 320 transitions. [2025-01-09 22:34:38,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 22:34:38,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:38,155 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:38,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:34:38,155 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2025-01-09 22:34:38,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:38,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1691510052, now seen corresponding path program 1 times [2025-01-09 22:34:38,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:38,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700045625] [2025-01-09 22:34:38,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:38,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:38,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 22:34:38,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 22:34:38,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:38,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:34:38,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:38,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700045625] [2025-01-09 22:34:38,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700045625] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:38,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236265461] [2025-01-09 22:34:38,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:38,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:38,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:38,764 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-01-09 22:34:38,767 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-01-09 22:34:38,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 22:34:38,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 22:34:38,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:38,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:38,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 22:34:38,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:39,029 WARN L873 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) is different from true [2025-01-09 22:34:39,177 WARN L873 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| 1))) is different from true [2025-01-09 22:34:40,136 INFO L349 Elim1Store]: treesize reduction 361, result has 33.0 percent of original size [2025-01-09 22:34:40,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 81 treesize of output 323 [2025-01-09 22:35:00,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:00,972 INFO L349 Elim1Store]: treesize reduction 36, result has 28.0 percent of original size [2025-01-09 22:35:00,972 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 5 case distinctions, treesize of input 31 treesize of output 25 [2025-01-09 22:35:01,908 INFO L349 Elim1Store]: treesize reduction 138, result has 5.5 percent of original size [2025-01-09 22:35:01,908 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 6 case distinctions, treesize of input 59 treesize of output 20 [2025-01-09 22:35:04,729 INFO L349 Elim1Store]: treesize reduction 36, result has 28.0 percent of original size [2025-01-09 22:35:04,729 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 5 case distinctions, treesize of input 31 treesize of output 25 [2025-01-09 22:35:15,620 INFO L349 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2025-01-09 22:35:15,620 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 5 case distinctions, treesize of input 31 treesize of output 21 [2025-01-09 22:35:30,975 INFO L349 Elim1Store]: treesize reduction 680, result has 17.4 percent of original size [2025-01-09 22:35:30,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 42 case distinctions, treesize of input 157 treesize of output 345