./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:53:44,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:53:44,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:53:44,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:53:44,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:53:44,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:53:44,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:53:44,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:53:44,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:53:44,942 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:53:44,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:53:44,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:53:44,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:53:44,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:53:44,945 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:53:44,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:53:44,946 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:53:44,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:53:44,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:53:44,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:53:44,947 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:53:44,951 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:53:44,951 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:53:44,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:53:44,952 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:53:44,952 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:53:44,952 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:53:44,952 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:53:44,953 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:53:44,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:53:44,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:53:44,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:53:44,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:53:44,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:53:44,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:53:44,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:53:44,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:53:44,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:53:44,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:53:44,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:53:44,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:53:44,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:53:44,956 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 [2024-10-13 10:53:45,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:53:45,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:53:45,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:53:45,317 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:53:45,318 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:53:45,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2024-10-13 10:53:46,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:53:47,088 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:53:47,089 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2024-10-13 10:53:47,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98b81dd7/274202e815fc402f9aaef8b6427e3b79/FLAG5ffa94d20 [2024-10-13 10:53:47,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98b81dd7/274202e815fc402f9aaef8b6427e3b79 [2024-10-13 10:53:47,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:53:47,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:53:47,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:53:47,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:53:47,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:53:47,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:53:47" (1/1) ... [2024-10-13 10:53:47,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af16e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:47, skipping insertion in model container [2024-10-13 10:53:47,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:53:47" (1/1) ... [2024-10-13 10:53:47,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:53:47,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:53:47,836 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:53:47,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:53:47,937 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:53:47,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:47 WrapperNode [2024-10-13 10:53:47,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:53:47,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:53:47,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:53:47,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:53:47,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:47" (1/1) ... [2024-10-13 10:53:47,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:47" (1/1) ... [2024-10-13 10:53:47,999 INFO L138 Inliner]: procedures = 140, calls = 95, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 242 [2024-10-13 10:53:47,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:53:48,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:53:48,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:53:48,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:53:48,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:47" (1/1) ... [2024-10-13 10:53:48,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:47" (1/1) ... [2024-10-13 10:53:48,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:47" (1/1) ... [2024-10-13 10:53:48,069 INFO L175 MemorySlicer]: Split 48 memory accesses to 3 slices as follows [2, 40, 6]. 83 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 13 writes are split as follows [0, 11, 2]. [2024-10-13 10:53:48,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:47" (1/1) ... [2024-10-13 10:53:48,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:47" (1/1) ... [2024-10-13 10:53:48,085 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:47" (1/1) ... [2024-10-13 10:53:48,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:47" (1/1) ... [2024-10-13 10:53:48,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:47" (1/1) ... [2024-10-13 10:53:48,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:47" (1/1) ... [2024-10-13 10:53:48,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:53:48,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:53:48,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:53:48,102 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:53:48,103 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:47" (1/1) ... [2024-10-13 10:53:48,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:53:48,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:53:48,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:53:48,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:53:48,198 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-10-13 10:53:48,198 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-10-13 10:53:48,198 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2024-10-13 10:53:48,198 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2024-10-13 10:53:48,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:53:48,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:53:48,199 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2024-10-13 10:53:48,199 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2024-10-13 10:53:48,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:53:48,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:53:48,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:53:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 10:53:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-10-13 10:53:48,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-10-13 10:53:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:53:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:53:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 10:53:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:53:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 10:53:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 10:53:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 10:53:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2024-10-13 10:53:48,207 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2024-10-13 10:53:48,207 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2024-10-13 10:53:48,207 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2024-10-13 10:53:48,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 10:53:48,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 10:53:48,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 10:53:48,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:53:48,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:53:48,399 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:53:48,402 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:53:49,055 INFO L? ?]: Removed 242 outVars from TransFormulas that were not future-live. [2024-10-13 10:53:49,055 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:53:49,139 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:53:49,141 INFO L314 CfgBuilder]: Removed 38 assume(true) statements. [2024-10-13 10:53:49,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:53:49 BoogieIcfgContainer [2024-10-13 10:53:49,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:53:49,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:53:49,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:53:49,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:53:49,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:53:47" (1/3) ... [2024-10-13 10:53:49,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cea706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:53:49, skipping insertion in model container [2024-10-13 10:53:49,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:47" (2/3) ... [2024-10-13 10:53:49,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cea706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:53:49, skipping insertion in model container [2024-10-13 10:53:49,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:53:49" (3/3) ... [2024-10-13 10:53:49,152 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-1.i [2024-10-13 10:53:49,169 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:53:49,170 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2024-10-13 10:53:49,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:53:49,234 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;@5c6920f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:53:49,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2024-10-13 10:53:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 246 states, 117 states have (on average 2.4188034188034186) internal successors, (283), 234 states have internal predecessors, (283), 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) [2024-10-13 10:53:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:53:49,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:49,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:49,248 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)] === [2024-10-13 10:53:49,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:49,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1819839687, now seen corresponding path program 1 times [2024-10-13 10:53:49,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:49,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070375703] [2024-10-13 10:53:49,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:49,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:49,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:49,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070375703] [2024-10-13 10:53:49,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070375703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:49,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:49,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:53:49,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277549280] [2024-10-13 10:53:49,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:49,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:53:49,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:49,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:53:49,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:53:49,564 INFO L87 Difference]: Start difference. First operand has 246 states, 117 states have (on average 2.4188034188034186) internal successors, (283), 234 states have internal predecessors, (283), 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.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2024-10-13 10:53:49,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:49,659 INFO L93 Difference]: Finished difference Result 244 states and 274 transitions. [2024-10-13 10:53:49,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:53:49,663 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 8 [2024-10-13 10:53:49,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:49,675 INFO L225 Difference]: With dead ends: 244 [2024-10-13 10:53:49,677 INFO L226 Difference]: Without dead ends: 243 [2024-10-13 10:53:49,679 INFO L431 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 [2024-10-13 10:53:49,683 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:49,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-13 10:53:49,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2024-10-13 10:53:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 116 states have (on average 2.060344827586207) internal successors, (239), 231 states have internal predecessors, (239), 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) [2024-10-13 10:53:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 273 transitions. [2024-10-13 10:53:49,731 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 273 transitions. Word has length 8 [2024-10-13 10:53:49,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:49,731 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 273 transitions. [2024-10-13 10:53:49,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2024-10-13 10:53:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 273 transitions. [2024-10-13 10:53:49,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:53:49,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:49,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:49,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:53:49,733 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)] === [2024-10-13 10:53:49,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:49,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1819839749, now seen corresponding path program 1 times [2024-10-13 10:53:49,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:49,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664866755] [2024-10-13 10:53:49,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:49,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:49,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:49,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:49,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664866755] [2024-10-13 10:53:49,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664866755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:49,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:49,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:53:49,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295371685] [2024-10-13 10:53:49,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:49,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:53:49,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:49,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:53:49,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:53:49,890 INFO L87 Difference]: Start difference. First operand 243 states and 273 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-10-13 10:53:50,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:50,119 INFO L93 Difference]: Finished difference Result 241 states and 271 transitions. [2024-10-13 10:53:50,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:53:50,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 8 [2024-10-13 10:53:50,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:50,122 INFO L225 Difference]: With dead ends: 241 [2024-10-13 10:53:50,124 INFO L226 Difference]: Without dead ends: 241 [2024-10-13 10:53:50,124 INFO L431 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 [2024-10-13 10:53:50,126 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 1 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:50,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 412 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:53:50,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-13 10:53:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-10-13 10:53:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 116 states have (on average 2.043103448275862) internal successors, (237), 229 states have internal predecessors, (237), 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) [2024-10-13 10:53:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 271 transitions. [2024-10-13 10:53:50,142 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 271 transitions. Word has length 8 [2024-10-13 10:53:50,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:50,142 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 271 transitions. [2024-10-13 10:53:50,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-10-13 10:53:50,143 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 271 transitions. [2024-10-13 10:53:50,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:53:50,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:50,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:50,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:53:50,144 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)] === [2024-10-13 10:53:50,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:50,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1819839750, now seen corresponding path program 1 times [2024-10-13 10:53:50,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:50,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052816761] [2024-10-13 10:53:50,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:50,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:50,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:50,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052816761] [2024-10-13 10:53:50,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052816761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:50,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:50,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:53:50,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420509428] [2024-10-13 10:53:50,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:50,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:53:50,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:50,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:53:50,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:53:50,353 INFO L87 Difference]: Start difference. First operand 241 states and 271 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) [2024-10-13 10:53:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:50,535 INFO L93 Difference]: Finished difference Result 263 states and 301 transitions. [2024-10-13 10:53:50,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:53:50,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 8 [2024-10-13 10:53:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:50,537 INFO L225 Difference]: With dead ends: 263 [2024-10-13 10:53:50,537 INFO L226 Difference]: Without dead ends: 263 [2024-10-13 10:53:50,538 INFO L431 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 [2024-10-13 10:53:50,538 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 15 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:50,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 994 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:50,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-13 10:53:50,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 257. [2024-10-13 10:53:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 125 states have (on average 2.0) internal successors, (250), 238 states have internal predecessors, (250), 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) [2024-10-13 10:53:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 297 transitions. [2024-10-13 10:53:50,570 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 297 transitions. Word has length 8 [2024-10-13 10:53:50,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:50,570 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 297 transitions. [2024-10-13 10:53:50,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) [2024-10-13 10:53:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 297 transitions. [2024-10-13 10:53:50,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:53:50,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:50,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:50,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:53:50,571 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)] === [2024-10-13 10:53:50,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:50,574 INFO L85 PathProgramCache]: Analyzing trace with hash 826853509, now seen corresponding path program 1 times [2024-10-13 10:53:50,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:50,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280072941] [2024-10-13 10:53:50,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:50,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:50,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:50,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:50,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280072941] [2024-10-13 10:53:50,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280072941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:50,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:50,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:53:50,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967214621] [2024-10-13 10:53:50,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:50,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:53:50,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:50,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:53:50,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:53:50,642 INFO L87 Difference]: Start difference. First operand 257 states and 297 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, (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) [2024-10-13 10:53:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:50,796 INFO L93 Difference]: Finished difference Result 254 states and 294 transitions. [2024-10-13 10:53:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:53:50,797 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, (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 10 [2024-10-13 10:53:50,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:50,798 INFO L225 Difference]: With dead ends: 254 [2024-10-13 10:53:50,798 INFO L226 Difference]: Without dead ends: 254 [2024-10-13 10:53:50,798 INFO L431 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 [2024-10-13 10:53:50,799 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 2 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:50,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 406 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:50,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-13 10:53:50,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-10-13 10:53:50,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 125 states have (on average 1.976) internal successors, (247), 235 states have internal predecessors, (247), 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) [2024-10-13 10:53:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 294 transitions. [2024-10-13 10:53:50,819 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 294 transitions. Word has length 10 [2024-10-13 10:53:50,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:50,819 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 294 transitions. [2024-10-13 10:53:50,820 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, (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) [2024-10-13 10:53:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 294 transitions. [2024-10-13 10:53:50,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:53:50,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:50,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:50,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:53:50,821 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)] === [2024-10-13 10:53:50,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:50,824 INFO L85 PathProgramCache]: Analyzing trace with hash 826853510, now seen corresponding path program 1 times [2024-10-13 10:53:50,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:50,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464737066] [2024-10-13 10:53:50,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:50,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:50,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:50,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464737066] [2024-10-13 10:53:50,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464737066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:50,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:50,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:53:50,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788181064] [2024-10-13 10:53:50,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:50,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:53:50,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:50,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:53:50,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:53:50,923 INFO L87 Difference]: Start difference. First operand 254 states and 294 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, (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) [2024-10-13 10:53:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:51,060 INFO L93 Difference]: Finished difference Result 251 states and 291 transitions. [2024-10-13 10:53:51,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:53:51,061 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, (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 10 [2024-10-13 10:53:51,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:51,062 INFO L225 Difference]: With dead ends: 251 [2024-10-13 10:53:51,063 INFO L226 Difference]: Without dead ends: 251 [2024-10-13 10:53:51,063 INFO L431 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 [2024-10-13 10:53:51,064 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 2 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:51,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 409 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-13 10:53:51,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-10-13 10:53:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 125 states have (on average 1.952) internal successors, (244), 232 states have internal predecessors, (244), 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) [2024-10-13 10:53:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 291 transitions. [2024-10-13 10:53:51,075 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 291 transitions. Word has length 10 [2024-10-13 10:53:51,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:51,077 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 291 transitions. [2024-10-13 10:53:51,077 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, (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) [2024-10-13 10:53:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 291 transitions. [2024-10-13 10:53:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:53:51,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:51,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:51,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:53:51,078 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)] === [2024-10-13 10:53:51,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1155446934, now seen corresponding path program 1 times [2024-10-13 10:53:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:51,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693330641] [2024-10-13 10:53:51,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:51,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:51,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:51,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693330641] [2024-10-13 10:53:51,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693330641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:51,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:51,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:53:51,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647688507] [2024-10-13 10:53:51,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:51,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:53:51,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:51,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:53:51,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:53:51,322 INFO L87 Difference]: Start difference. First operand 251 states and 291 transitions. Second operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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) [2024-10-13 10:53:51,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:51,767 INFO L93 Difference]: Finished difference Result 270 states and 314 transitions. [2024-10-13 10:53:51,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:53:51,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 13 [2024-10-13 10:53:51,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:51,770 INFO L225 Difference]: With dead ends: 270 [2024-10-13 10:53:51,770 INFO L226 Difference]: Without dead ends: 270 [2024-10-13 10:53:51,771 INFO L431 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 [2024-10-13 10:53:51,771 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 57 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:51,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1150 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:53:51,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-13 10:53:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 261. [2024-10-13 10:53:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 134 states have (on average 1.9029850746268657) internal successors, (255), 240 states have internal predecessors, (255), 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) [2024-10-13 10:53:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 304 transitions. [2024-10-13 10:53:51,783 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 304 transitions. Word has length 13 [2024-10-13 10:53:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:51,783 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 304 transitions. [2024-10-13 10:53:51,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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) [2024-10-13 10:53:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 304 transitions. [2024-10-13 10:53:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:53:51,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:51,784 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:51,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:53:51,784 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)] === [2024-10-13 10:53:51,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:51,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1155446935, now seen corresponding path program 1 times [2024-10-13 10:53:51,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:51,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688913492] [2024-10-13 10:53:51,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:51,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:52,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:52,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688913492] [2024-10-13 10:53:52,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688913492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:52,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:52,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:53:52,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123823452] [2024-10-13 10:53:52,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:52,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:53:52,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:52,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:53:52,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:53:52,087 INFO L87 Difference]: Start difference. First operand 261 states and 304 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2024-10-13 10:53:52,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:52,621 INFO L93 Difference]: Finished difference Result 269 states and 312 transitions. [2024-10-13 10:53:52,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:53:52,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 13 [2024-10-13 10:53:52,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:52,623 INFO L225 Difference]: With dead ends: 269 [2024-10-13 10:53:52,623 INFO L226 Difference]: Without dead ends: 269 [2024-10-13 10:53:52,624 INFO L431 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 [2024-10-13 10:53:52,624 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 47 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:52,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 841 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:53:52,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-13 10:53:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 261. [2024-10-13 10:53:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 134 states have (on average 1.8880597014925373) internal successors, (253), 240 states have internal predecessors, (253), 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) [2024-10-13 10:53:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 302 transitions. [2024-10-13 10:53:52,641 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 302 transitions. Word has length 13 [2024-10-13 10:53:52,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:52,641 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 302 transitions. [2024-10-13 10:53:52,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2024-10-13 10:53:52,641 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 302 transitions. [2024-10-13 10:53:52,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:53:52,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:52,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:52,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:53:52,643 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)] === [2024-10-13 10:53:52,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:52,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1459136019, now seen corresponding path program 1 times [2024-10-13 10:53:52,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:52,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364683905] [2024-10-13 10:53:52,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:52,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:52,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:52,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364683905] [2024-10-13 10:53:52,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364683905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:52,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:52,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:53:52,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7183015] [2024-10-13 10:53:52,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:52,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:53:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:52,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:53:52,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:53:52,714 INFO L87 Difference]: Start difference. First operand 261 states and 302 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2024-10-13 10:53:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:52,886 INFO L93 Difference]: Finished difference Result 260 states and 301 transitions. [2024-10-13 10:53:52,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:53:52,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 14 [2024-10-13 10:53:52,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:52,889 INFO L225 Difference]: With dead ends: 260 [2024-10-13 10:53:52,889 INFO L226 Difference]: Without dead ends: 260 [2024-10-13 10:53:52,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:53:52,891 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 11 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:52,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 556 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:53:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-13 10:53:52,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2024-10-13 10:53:52,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 134 states have (on average 1.8805970149253732) internal successors, (252), 239 states have internal predecessors, (252), 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) [2024-10-13 10:53:52,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 301 transitions. [2024-10-13 10:53:52,901 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 301 transitions. Word has length 14 [2024-10-13 10:53:52,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:52,902 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 301 transitions. [2024-10-13 10:53:52,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2024-10-13 10:53:52,903 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 301 transitions. [2024-10-13 10:53:52,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:53:52,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:52,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:52,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:53:52,904 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)] === [2024-10-13 10:53:52,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:52,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1459136020, now seen corresponding path program 1 times [2024-10-13 10:53:52,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:52,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951968431] [2024-10-13 10:53:52,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:52,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:53,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:53,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951968431] [2024-10-13 10:53:53,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951968431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:53,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:53,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:53:53,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090846457] [2024-10-13 10:53:53,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:53,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:53:53,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:53,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:53:53,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:53:53,020 INFO L87 Difference]: Start difference. First operand 260 states and 301 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2024-10-13 10:53:53,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:53,153 INFO L93 Difference]: Finished difference Result 259 states and 300 transitions. [2024-10-13 10:53:53,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:53:53,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 14 [2024-10-13 10:53:53,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:53,155 INFO L225 Difference]: With dead ends: 259 [2024-10-13 10:53:53,155 INFO L226 Difference]: Without dead ends: 259 [2024-10-13 10:53:53,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:53:53,156 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 8 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:53,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 626 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:53,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-13 10:53:53,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-10-13 10:53:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 134 states have (on average 1.873134328358209) internal successors, (251), 238 states have internal predecessors, (251), 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) [2024-10-13 10:53:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 300 transitions. [2024-10-13 10:53:53,163 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 300 transitions. Word has length 14 [2024-10-13 10:53:53,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:53,163 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 300 transitions. [2024-10-13 10:53:53,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2024-10-13 10:53:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 300 transitions. [2024-10-13 10:53:53,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:53:53,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:53,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:53,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:53:53,164 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)] === [2024-10-13 10:53:53,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:53,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2070375796, now seen corresponding path program 1 times [2024-10-13 10:53:53,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:53,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863645918] [2024-10-13 10:53:53,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:53,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:53,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:53:53,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:53,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863645918] [2024-10-13 10:53:53,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863645918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:53,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:53,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:53:53,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584720664] [2024-10-13 10:53:53,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:53,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:53:53,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:53,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:53:53,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:53:53,403 INFO L87 Difference]: Start difference. First operand 259 states and 300 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) 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) [2024-10-13 10:53:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:53,623 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2024-10-13 10:53:53,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:53:53,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) 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 [2024-10-13 10:53:53,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:53,625 INFO L225 Difference]: With dead ends: 289 [2024-10-13 10:53:53,625 INFO L226 Difference]: Without dead ends: 289 [2024-10-13 10:53:53,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:53:53,626 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 32 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:53,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1613 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:53:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-13 10:53:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 270. [2024-10-13 10:53:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 144 states have (on average 1.8194444444444444) internal successors, (262), 247 states have internal predecessors, (262), 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) [2024-10-13 10:53:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 313 transitions. [2024-10-13 10:53:53,638 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 313 transitions. Word has length 16 [2024-10-13 10:53:53,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:53,639 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 313 transitions. [2024-10-13 10:53:53,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) 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) [2024-10-13 10:53:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 313 transitions. [2024-10-13 10:53:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 10:53:53,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:53,640 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:53:53,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:53:53,640 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)] === [2024-10-13 10:53:53,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:53,641 INFO L85 PathProgramCache]: Analyzing trace with hash 557315397, now seen corresponding path program 1 times [2024-10-13 10:53:53,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:53,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186809163] [2024-10-13 10:53:53,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:53,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:53:53,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:53,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186809163] [2024-10-13 10:53:53,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186809163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:53,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:53,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:53:53,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094130191] [2024-10-13 10:53:53,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:53,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:53:53,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:53,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:53:53,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:53:53,777 INFO L87 Difference]: Start difference. First operand 270 states and 313 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2024-10-13 10:53:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:53,888 INFO L93 Difference]: Finished difference Result 268 states and 311 transitions. [2024-10-13 10:53:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:53:53,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 23 [2024-10-13 10:53:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:53,891 INFO L225 Difference]: With dead ends: 268 [2024-10-13 10:53:53,891 INFO L226 Difference]: Without dead ends: 268 [2024-10-13 10:53:53,891 INFO L431 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 [2024-10-13 10:53:53,892 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 1 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:53,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 405 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-13 10:53:53,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-10-13 10:53:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 144 states have (on average 1.8055555555555556) internal successors, (260), 245 states have internal predecessors, (260), 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) [2024-10-13 10:53:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 311 transitions. [2024-10-13 10:53:53,899 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 311 transitions. Word has length 23 [2024-10-13 10:53:53,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:53,899 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 311 transitions. [2024-10-13 10:53:53,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2024-10-13 10:53:53,900 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 311 transitions. [2024-10-13 10:53:53,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:53:53,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:53,901 INFO L215 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] [2024-10-13 10:53:53,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:53:53,902 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)] === [2024-10-13 10:53:53,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:53,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1290796966, now seen corresponding path program 1 times [2024-10-13 10:53:53,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:53,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628779004] [2024-10-13 10:53:53,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:53,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:53:54,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:54,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628779004] [2024-10-13 10:53:54,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628779004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:54,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:54,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:53:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415397737] [2024-10-13 10:53:54,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:54,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:53:54,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:54,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:53:54,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:53:54,121 INFO L87 Difference]: Start difference. First operand 268 states and 311 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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) [2024-10-13 10:53:54,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:54,423 INFO L93 Difference]: Finished difference Result 266 states and 309 transitions. [2024-10-13 10:53:54,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:53:54,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 25 [2024-10-13 10:53:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:54,426 INFO L225 Difference]: With dead ends: 266 [2024-10-13 10:53:54,426 INFO L226 Difference]: Without dead ends: 266 [2024-10-13 10:53:54,426 INFO L431 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 [2024-10-13 10:53:54,427 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 41 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:54,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 838 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:53:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-13 10:53:54,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-10-13 10:53:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 144 states have (on average 1.7916666666666667) internal successors, (258), 243 states have internal predecessors, (258), 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) [2024-10-13 10:53:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 309 transitions. [2024-10-13 10:53:54,434 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 309 transitions. Word has length 25 [2024-10-13 10:53:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:54,435 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 309 transitions. [2024-10-13 10:53:54,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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) [2024-10-13 10:53:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 309 transitions. [2024-10-13 10:53:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:53:54,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:54,436 INFO L215 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] [2024-10-13 10:53:54,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:53:54,436 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)] === [2024-10-13 10:53:54,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:54,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1290796965, now seen corresponding path program 1 times [2024-10-13 10:53:54,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:54,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991876981] [2024-10-13 10:53:54,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:54,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:53:54,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:54,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991876981] [2024-10-13 10:53:54,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991876981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:54,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:54,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:53:54,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884083151] [2024-10-13 10:53:54,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:54,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:53:54,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:54,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:53:54,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:53:54,781 INFO L87 Difference]: Start difference. First operand 266 states and 309 transitions. Second operand has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2024-10-13 10:53:55,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:55,180 INFO L93 Difference]: Finished difference Result 264 states and 307 transitions. [2024-10-13 10:53:55,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:53:55,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 25 [2024-10-13 10:53:55,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:55,183 INFO L225 Difference]: With dead ends: 264 [2024-10-13 10:53:55,183 INFO L226 Difference]: Without dead ends: 264 [2024-10-13 10:53:55,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:53:55,184 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 29 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:55,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 733 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:53:55,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-13 10:53:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-10-13 10:53:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 144 states have (on average 1.7777777777777777) internal successors, (256), 241 states have internal predecessors, (256), 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) [2024-10-13 10:53:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 307 transitions. [2024-10-13 10:53:55,192 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 307 transitions. Word has length 25 [2024-10-13 10:53:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:55,193 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 307 transitions. [2024-10-13 10:53:55,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2024-10-13 10:53:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 307 transitions. [2024-10-13 10:53:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:53:55,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:55,195 INFO L215 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] [2024-10-13 10:53:55,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:53:55,195 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)] === [2024-10-13 10:53:55,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:55,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1359982970, now seen corresponding path program 1 times [2024-10-13 10:53:55,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:55,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258558043] [2024-10-13 10:53:55,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:55,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:53:55,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:55,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258558043] [2024-10-13 10:53:55,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258558043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:55,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:55,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:53:55,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462029690] [2024-10-13 10:53:55,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:55,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:53:55,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:55,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:53:55,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:53:55,271 INFO L87 Difference]: Start difference. First operand 264 states and 307 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) [2024-10-13 10:53:55,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:55,422 INFO L93 Difference]: Finished difference Result 263 states and 306 transitions. [2024-10-13 10:53:55,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:53:55,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 26 [2024-10-13 10:53:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:55,423 INFO L225 Difference]: With dead ends: 263 [2024-10-13 10:53:55,423 INFO L226 Difference]: Without dead ends: 263 [2024-10-13 10:53:55,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:53:55,424 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 7 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:55,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 547 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-13 10:53:55,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-10-13 10:53:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 240 states have internal predecessors, (255), 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) [2024-10-13 10:53:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 306 transitions. [2024-10-13 10:53:55,431 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 306 transitions. Word has length 26 [2024-10-13 10:53:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:55,431 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 306 transitions. [2024-10-13 10:53:55,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) [2024-10-13 10:53:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 306 transitions. [2024-10-13 10:53:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:53:55,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:55,432 INFO L215 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] [2024-10-13 10:53:55,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:53:55,433 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)] === [2024-10-13 10:53:55,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:55,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1359982969, now seen corresponding path program 1 times [2024-10-13 10:53:55,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:55,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204536490] [2024-10-13 10:53:55,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:55,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:53:55,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:55,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204536490] [2024-10-13 10:53:55,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204536490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:55,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:55,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:53:55,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814880557] [2024-10-13 10:53:55,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:55,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:53:55,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:55,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:53:55,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:53:55,559 INFO L87 Difference]: Start difference. First operand 263 states and 306 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) [2024-10-13 10:53:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:55,688 INFO L93 Difference]: Finished difference Result 262 states and 305 transitions. [2024-10-13 10:53:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:53:55,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 26 [2024-10-13 10:53:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:55,690 INFO L225 Difference]: With dead ends: 262 [2024-10-13 10:53:55,690 INFO L226 Difference]: Without dead ends: 262 [2024-10-13 10:53:55,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:53:55,692 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 6 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:55,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 615 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:55,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-13 10:53:55,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2024-10-13 10:53:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 144 states have (on average 1.7638888888888888) internal successors, (254), 239 states have internal predecessors, (254), 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) [2024-10-13 10:53:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 305 transitions. [2024-10-13 10:53:55,701 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 305 transitions. Word has length 26 [2024-10-13 10:53:55,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:55,701 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 305 transitions. [2024-10-13 10:53:55,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) [2024-10-13 10:53:55,702 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 305 transitions. [2024-10-13 10:53:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 10:53:55,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:55,704 INFO L215 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] [2024-10-13 10:53:55,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:53:55,705 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)] === [2024-10-13 10:53:55,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:55,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1273573593, now seen corresponding path program 1 times [2024-10-13 10:53:55,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:55,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278225969] [2024-10-13 10:53:55,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:55,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:53:55,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:55,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278225969] [2024-10-13 10:53:55,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278225969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:53:55,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:53:55,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:53:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781835884] [2024-10-13 10:53:55,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:53:55,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:53:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:55,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:53:55,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:53:55,949 INFO L87 Difference]: Start difference. First operand 262 states and 305 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) [2024-10-13 10:53:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:56,122 INFO L93 Difference]: Finished difference Result 269 states and 312 transitions. [2024-10-13 10:53:56,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:53:56,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 28 [2024-10-13 10:53:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:56,125 INFO L225 Difference]: With dead ends: 269 [2024-10-13 10:53:56,125 INFO L226 Difference]: Without dead ends: 269 [2024-10-13 10:53:56,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:53:56,126 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 13 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:56,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1350 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:53:56,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-13 10:53:56,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2024-10-13 10:53:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 150 states have (on average 1.7333333333333334) internal successors, (260), 245 states have internal predecessors, (260), 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) [2024-10-13 10:53:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 311 transitions. [2024-10-13 10:53:56,132 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 311 transitions. Word has length 28 [2024-10-13 10:53:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:56,133 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 311 transitions. [2024-10-13 10:53:56,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) [2024-10-13 10:53:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 311 transitions. [2024-10-13 10:53:56,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 10:53:56,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:56,134 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-13 10:53:56,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 10:53:56,134 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)] === [2024-10-13 10:53:56,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:56,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1710199367, now seen corresponding path program 1 times [2024-10-13 10:53:56,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:56,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964386477] [2024-10-13 10:53:56,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:56,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:56,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 10:53:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:53:56,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:56,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964386477] [2024-10-13 10:53:56,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964386477] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:53:56,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207349170] [2024-10-13 10:53:56,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:56,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:53:56,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:53:56,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:53:56,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 10:53:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:56,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-13 10:53:56,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:53:57,015 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 [2024-10-13 10:53:57,054 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-13 10:53:57,055 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 [2024-10-13 10:53:57,095 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 [2024-10-13 10:53:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:53:57,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:53:57,320 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 [2024-10-13 10:53:57,405 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 10:53:57,406 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 [2024-10-13 10:53:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:53:57,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207349170] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:53:57,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:53:57,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2024-10-13 10:53:57,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136739678] [2024-10-13 10:53:57,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:53:57,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 10:53:57,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:53:57,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 10:53:57,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:53:57,439 INFO L87 Difference]: Start difference. First operand 268 states and 311 transitions. Second operand has 18 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:53:58,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:53:58,813 INFO L93 Difference]: Finished difference Result 268 states and 311 transitions. [2024-10-13 10:53:58,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:53:58,814 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-10-13 10:53:58,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:53:58,815 INFO L225 Difference]: With dead ends: 268 [2024-10-13 10:53:58,815 INFO L226 Difference]: Without dead ends: 268 [2024-10-13 10:53:58,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2024-10-13 10:53:58,816 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 114 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:53:58,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1677 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1928 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 10:53:58,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-13 10:53:58,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 267. [2024-10-13 10:53:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 150 states have (on average 1.7266666666666666) internal successors, (259), 244 states have internal predecessors, (259), 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) [2024-10-13 10:53:58,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 310 transitions. [2024-10-13 10:53:58,823 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 310 transitions. Word has length 40 [2024-10-13 10:53:58,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:53:58,823 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 310 transitions. [2024-10-13 10:53:58,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:53:58,824 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 310 transitions. [2024-10-13 10:53:58,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 10:53:58,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:53:58,825 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-13 10:53:58,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:53:59,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 10:53:59,026 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)] === [2024-10-13 10:53:59,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:53:59,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1710199368, now seen corresponding path program 1 times [2024-10-13 10:53:59,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:53:59,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403205913] [2024-10-13 10:53:59,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:59,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:53:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:59,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 10:53:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:53:59,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:53:59,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403205913] [2024-10-13 10:53:59,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403205913] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:53:59,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657698309] [2024-10-13 10:53:59,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:53:59,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:53:59,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:53:59,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:53:59,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 10:53:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:53:59,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-13 10:54:00,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:54:00,021 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 [2024-10-13 10:54:00,087 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 [2024-10-13 10:54:00,090 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 [2024-10-13 10:54:00,190 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-10-13 10:54:00,190 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 [2024-10-13 10:54:00,251 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 [2024-10-13 10:54:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:54:00,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:54:00,589 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 [2024-10-13 10:54:00,597 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 [2024-10-13 10:54:00,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:54:00,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:54:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:54:00,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657698309] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:54:00,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:54:00,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 22 [2024-10-13 10:54:00,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784311772] [2024-10-13 10:54:00,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:54:00,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 10:54:00,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:54:00,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 10:54:00,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:54:00,783 INFO L87 Difference]: Start difference. First operand 267 states and 310 transitions. Second operand has 23 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:54:02,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:54:02,471 INFO L93 Difference]: Finished difference Result 267 states and 310 transitions. [2024-10-13 10:54:02,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:54:02,472 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-10-13 10:54:02,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:54:02,475 INFO L225 Difference]: With dead ends: 267 [2024-10-13 10:54:02,475 INFO L226 Difference]: Without dead ends: 267 [2024-10-13 10:54:02,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2024-10-13 10:54:02,476 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 99 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1895 SdHoareTripleChecker+Invalid, 2507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:54:02,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1895 Invalid, 2507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 10:54:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-13 10:54:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2024-10-13 10:54:02,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 150 states have (on average 1.72) internal successors, (258), 243 states have internal predecessors, (258), 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) [2024-10-13 10:54:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 309 transitions. [2024-10-13 10:54:02,488 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 309 transitions. Word has length 40 [2024-10-13 10:54:02,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:54:02,489 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 309 transitions. [2024-10-13 10:54:02,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:54:02,490 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 309 transitions. [2024-10-13 10:54:02,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 10:54:02,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:54:02,492 INFO L215 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] [2024-10-13 10:54:02,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 10:54:02,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-13 10:54:02,696 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)] === [2024-10-13 10:54:02,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:54:02,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2098131053, now seen corresponding path program 1 times [2024-10-13 10:54:02,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:54:02,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527140641] [2024-10-13 10:54:02,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:54:02,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:54:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:02,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 10:54:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:54:02,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:54:02,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527140641] [2024-10-13 10:54:02,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527140641] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:54:02,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688043161] [2024-10-13 10:54:02,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:54:02,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:54:02,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:54:02,869 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:54:02,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 10:54:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:03,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:54:03,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:54:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:54:03,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:54:03,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688043161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:54:03,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:54:03,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-10-13 10:54:03,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756749883] [2024-10-13 10:54:03,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:54:03,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:54:03,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:54:03,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:54:03,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:54:03,078 INFO L87 Difference]: Start difference. First operand 266 states and 309 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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) [2024-10-13 10:54:03,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:54:03,175 INFO L93 Difference]: Finished difference Result 254 states and 286 transitions. [2024-10-13 10:54:03,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:54:03,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 43 [2024-10-13 10:54:03,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:54:03,177 INFO L225 Difference]: With dead ends: 254 [2024-10-13 10:54:03,179 INFO L226 Difference]: Without dead ends: 254 [2024-10-13 10:54:03,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:54:03,179 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 20 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:54:03,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 894 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:54:03,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-13 10:54:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-10-13 10:54:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 141 states have (on average 1.7304964539007093) internal successors, (244), 234 states have internal predecessors, (244), 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) [2024-10-13 10:54:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 286 transitions. [2024-10-13 10:54:03,187 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 286 transitions. Word has length 43 [2024-10-13 10:54:03,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:54:03,187 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 286 transitions. [2024-10-13 10:54:03,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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) [2024-10-13 10:54:03,187 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 286 transitions. [2024-10-13 10:54:03,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 10:54:03,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:54:03,189 INFO L215 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] [2024-10-13 10:54:03,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 10:54:03,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:54:03,389 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)] === [2024-10-13 10:54:03,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:54:03,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2106095653, now seen corresponding path program 1 times [2024-10-13 10:54:03,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:54:03,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138084064] [2024-10-13 10:54:03,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:54:03,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:54:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:03,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-13 10:54:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:03,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-13 10:54:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:04,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:54:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:04,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:54:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:54:04,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:54:04,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138084064] [2024-10-13 10:54:04,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138084064] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:54:04,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614322604] [2024-10-13 10:54:04,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:54:04,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:54:04,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:54:04,356 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:54:04,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 10:54:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:04,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-13 10:54:04,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:54:04,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:54:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:54:04,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:54:05,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-10-13 10:54:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:54:05,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614322604] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:54:05,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:54:05,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 19 [2024-10-13 10:54:05,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459208204] [2024-10-13 10:54:05,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:54:05,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 10:54:05,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:54:05,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 10:54:05,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-10-13 10:54:05,125 INFO L87 Difference]: Start difference. First operand 254 states and 286 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 10:54:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:54:05,950 INFO L93 Difference]: Finished difference Result 257 states and 287 transitions. [2024-10-13 10:54:05,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 10:54:05,951 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2024-10-13 10:54:05,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:54:05,952 INFO L225 Difference]: With dead ends: 257 [2024-10-13 10:54:05,952 INFO L226 Difference]: Without dead ends: 257 [2024-10-13 10:54:05,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2024-10-13 10:54:05,953 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 221 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:54:05,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1349 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:54:05,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-13 10:54:05,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2024-10-13 10:54:05,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 237 states have internal predecessors, (245), 28 states have call successors, (28), 11 states have call predecessors, (28), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 10:54:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 287 transitions. [2024-10-13 10:54:05,962 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 287 transitions. Word has length 49 [2024-10-13 10:54:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:54:05,962 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 287 transitions. [2024-10-13 10:54:05,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 10:54:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 287 transitions. [2024-10-13 10:54:05,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-13 10:54:05,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:54:05,963 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-13 10:54:05,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 10:54:06,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:54:06,165 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2024-10-13 10:54:06,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:54:06,166 INFO L85 PathProgramCache]: Analyzing trace with hash 458411580, now seen corresponding path program 1 times [2024-10-13 10:54:06,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:54:06,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978558451] [2024-10-13 10:54:06,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:54:06,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:54:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:06,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-13 10:54:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:07,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-13 10:54:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:09,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:54:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:09,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 10:54:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:54:10,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:54:10,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978558451] [2024-10-13 10:54:10,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978558451] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:54:10,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670743387] [2024-10-13 10:54:10,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:54:10,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:54:10,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:54:10,884 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:54:10,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 10:54:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:54:11,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-13 10:54:11,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:54:11,433 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 [2024-10-13 10:54:23,289 INFO L349 Elim1Store]: treesize reduction 1554, result has 14.4 percent of original size [2024-10-13 10:54:23,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 81 case distinctions, treesize of input 127 treesize of output 591