./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-assert-order-craig-3061b6d-m [2024-11-19 06:54:44,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:54:44,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:54:44,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:54:44,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:54:44,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:54:44,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:54:44,185 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:54:44,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:54:44,185 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:54:44,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:54:44,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:54:44,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:54:44,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:54:44,187 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:54:44,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:54:44,188 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:54:44,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:54:44,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:54:44,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:54:44,189 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:54:44,193 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:54:44,194 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:54:44,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:54:44,194 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:54:44,194 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:54:44,195 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:54:44,195 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:54:44,195 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:54:44,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:54:44,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:54:44,197 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:54:44,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:54:44,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:54:44,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:54:44,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:54:44,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:54:44,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:54:44,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:54:44,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:54:44,199 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:54:44,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:54:44,200 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-11-19 06:54:44,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:54:44,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:54:44,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:54:44,525 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:54:44,526 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:54:44,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2024-11-19 06:54:45,984 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:54:46,255 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:54:46,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2024-11-19 06:54:46,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fd6b19e9/9b45792c157a4e6aa363231b59a863e5/FLAG29e05f7bf [2024-11-19 06:54:46,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fd6b19e9/9b45792c157a4e6aa363231b59a863e5 [2024-11-19 06:54:46,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:54:46,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:54:46,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:54:46,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:54:46,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:54:46,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:54:46" (1/1) ... [2024-11-19 06:54:46,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4528bbd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:46, skipping insertion in model container [2024-11-19 06:54:46,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:54:46" (1/1) ... [2024-11-19 06:54:46,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:54:46,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:54:46,744 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:54:46,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:54:46,850 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:54:46,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:46 WrapperNode [2024-11-19 06:54:46,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:54:46,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:54:46,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:54:46,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:54:46,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:46" (1/1) ... [2024-11-19 06:54:46,882 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:46" (1/1) ... [2024-11-19 06:54:46,913 INFO L138 Inliner]: procedures = 140, calls = 95, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 242 [2024-11-19 06:54:46,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:54:46,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:54:46,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:54:46,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:54:46,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:46" (1/1) ... [2024-11-19 06:54:46,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:46" (1/1) ... [2024-11-19 06:54:46,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:46" (1/1) ... [2024-11-19 06:54:46,974 INFO L175 MemorySlicer]: Split 48 memory accesses to 3 slices as follows [2, 6, 40]. 83 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 13 writes are split as follows [0, 2, 11]. [2024-11-19 06:54:46,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:46" (1/1) ... [2024-11-19 06:54:46,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:46" (1/1) ... [2024-11-19 06:54:46,988 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:46" (1/1) ... [2024-11-19 06:54:46,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:46" (1/1) ... [2024-11-19 06:54:47,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:46" (1/1) ... [2024-11-19 06:54:47,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:46" (1/1) ... [2024-11-19 06:54:47,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:54:47,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:54:47,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:54:47,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:54:47,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:46" (1/1) ... [2024-11-19 06:54:47,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:54:47,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:54:47,051 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-11-19 06:54:47,054 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-11-19 06:54:47,094 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-19 06:54:47,094 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-19 06:54:47,094 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2024-11-19 06:54:47,094 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2024-11-19 06:54:47,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:54:47,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:54:47,095 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2024-11-19 06:54:47,095 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2024-11-19 06:54:47,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:54:47,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:54:47,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:54:47,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:54:47,095 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-11-19 06:54:47,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-11-19 06:54:47,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:54:47,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:54:47,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:54:47,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:54:47,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:54:47,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:54:47,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 06:54:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2024-11-19 06:54:47,097 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2024-11-19 06:54:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2024-11-19 06:54:47,097 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2024-11-19 06:54:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:54:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:54:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 06:54:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:54:47,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:54:47,238 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:54:47,240 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:54:47,879 INFO L? ?]: Removed 242 outVars from TransFormulas that were not future-live. [2024-11-19 06:54:47,879 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:54:47,908 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:54:47,910 INFO L316 CfgBuilder]: Removed 38 assume(true) statements. [2024-11-19 06:54:47,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:54:47 BoogieIcfgContainer [2024-11-19 06:54:47,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:54:47,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:54:47,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:54:47,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:54:47,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:54:46" (1/3) ... [2024-11-19 06:54:47,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e45349c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:54:47, skipping insertion in model container [2024-11-19 06:54:47,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:54:46" (2/3) ... [2024-11-19 06:54:47,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e45349c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:54:47, skipping insertion in model container [2024-11-19 06:54:47,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:54:47" (3/3) ... [2024-11-19 06:54:47,920 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-1.i [2024-11-19 06:54:47,967 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:54:47,968 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2024-11-19 06:54:48,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:54:48,056 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;@25ba5ca4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:54:48,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2024-11-19 06:54:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 275 states, 146 states have (on average 2.136986301369863) internal successors, (312), 263 states have internal predecessors, (312), 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-11-19 06:54:48,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:54:48,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:48,071 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:48,072 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-11-19 06:54:48,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1076177951, now seen corresponding path program 1 times [2024-11-19 06:54:48,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:48,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670514823] [2024-11-19 06:54:48,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:48,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:48,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:48,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670514823] [2024-11-19 06:54:48,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670514823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:48,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:48,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:54:48,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730143226] [2024-11-19 06:54:48,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:48,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:54:48,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:48,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:54:48,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:54:48,324 INFO L87 Difference]: Start difference. First operand has 275 states, 146 states have (on average 2.136986301369863) internal successors, (312), 263 states have internal predecessors, (312), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:48,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:48,369 INFO L93 Difference]: Finished difference Result 272 states and 302 transitions. [2024-11-19 06:54:48,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:54:48,372 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:54:48,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:48,385 INFO L225 Difference]: With dead ends: 272 [2024-11-19 06:54:48,385 INFO L226 Difference]: Without dead ends: 270 [2024-11-19 06:54:48,387 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-11-19 06:54:48,390 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:48,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:54:48,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-19 06:54:48,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2024-11-19 06:54:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 143 states have (on average 1.8601398601398602) internal successors, (266), 258 states have internal predecessors, (266), 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-11-19 06:54:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 300 transitions. [2024-11-19 06:54:48,450 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 300 transitions. Word has length 9 [2024-11-19 06:54:48,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:48,450 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 300 transitions. [2024-11-19 06:54:48,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:48,450 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 300 transitions. [2024-11-19 06:54:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:54:48,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:48,451 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:48,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:54:48,451 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-11-19 06:54:48,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:48,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1076177889, now seen corresponding path program 1 times [2024-11-19 06:54:48,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:48,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224219616] [2024-11-19 06:54:48,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:48,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:48,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:48,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224219616] [2024-11-19 06:54:48,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224219616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:48,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:48,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:54:48,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100342404] [2024-11-19 06:54:48,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:48,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:54:48,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:48,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:54:48,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:54:48,597 INFO L87 Difference]: Start difference. First operand 270 states and 300 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:48,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:48,812 INFO L93 Difference]: Finished difference Result 268 states and 298 transitions. [2024-11-19 06:54:48,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:54:48,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:54:48,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:48,814 INFO L225 Difference]: With dead ends: 268 [2024-11-19 06:54:48,815 INFO L226 Difference]: Without dead ends: 268 [2024-11-19 06:54:48,815 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-11-19 06:54:48,818 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 2 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:48,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 486 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:54:48,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-19 06:54:48,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-11-19 06:54:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 143 states have (on average 1.8461538461538463) internal successors, (264), 256 states have internal predecessors, (264), 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-11-19 06:54:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 298 transitions. [2024-11-19 06:54:48,837 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 298 transitions. Word has length 9 [2024-11-19 06:54:48,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:48,838 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 298 transitions. [2024-11-19 06:54:48,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:48,838 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 298 transitions. [2024-11-19 06:54:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:54:48,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:48,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:48,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:54:48,840 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-11-19 06:54:48,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:48,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1076177888, now seen corresponding path program 1 times [2024-11-19 06:54:48,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:48,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67999784] [2024-11-19 06:54:48,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:48,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:49,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:49,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67999784] [2024-11-19 06:54:49,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67999784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:49,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:49,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:54:49,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221702826] [2024-11-19 06:54:49,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:49,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:54:49,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:49,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:54:49,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:54:49,109 INFO L87 Difference]: Start difference. First operand 268 states and 298 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:49,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:49,206 INFO L93 Difference]: Finished difference Result 294 states and 332 transitions. [2024-11-19 06:54:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:54:49,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:54:49,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:49,208 INFO L225 Difference]: With dead ends: 294 [2024-11-19 06:54:49,209 INFO L226 Difference]: Without dead ends: 294 [2024-11-19 06:54:49,211 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-11-19 06:54:49,213 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 19 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:49,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1214 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:54:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-19 06:54:49,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 286. [2024-11-19 06:54:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 154 states have (on average 1.8116883116883118) internal successors, (279), 267 states have internal predecessors, (279), 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-11-19 06:54:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 326 transitions. [2024-11-19 06:54:49,239 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 326 transitions. Word has length 9 [2024-11-19 06:54:49,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:49,239 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 326 transitions. [2024-11-19 06:54:49,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 326 transitions. [2024-11-19 06:54:49,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:54:49,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:49,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:49,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:54:49,243 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-11-19 06:54:49,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:49,243 INFO L85 PathProgramCache]: Analyzing trace with hash 892711199, now seen corresponding path program 1 times [2024-11-19 06:54:49,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:49,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524715420] [2024-11-19 06:54:49,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:49,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:49,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:49,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:49,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524715420] [2024-11-19 06:54:49,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524715420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:49,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:49,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:54:49,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299876150] [2024-11-19 06:54:49,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:49,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:54:49,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:49,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:54:49,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:54:49,352 INFO L87 Difference]: Start difference. First operand 286 states and 326 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:49,513 INFO L93 Difference]: Finished difference Result 283 states and 323 transitions. [2024-11-19 06:54:49,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:54:49,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-19 06:54:49,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:49,515 INFO L225 Difference]: With dead ends: 283 [2024-11-19 06:54:49,515 INFO L226 Difference]: Without dead ends: 283 [2024-11-19 06:54:49,515 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-11-19 06:54:49,516 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 3 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:49,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 480 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:54:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-19 06:54:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-11-19 06:54:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 154 states have (on average 1.7922077922077921) internal successors, (276), 264 states have internal predecessors, (276), 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-11-19 06:54:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 323 transitions. [2024-11-19 06:54:49,525 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 323 transitions. Word has length 11 [2024-11-19 06:54:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:49,526 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 323 transitions. [2024-11-19 06:54:49,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 323 transitions. [2024-11-19 06:54:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:54:49,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:49,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:49,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:54:49,527 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-11-19 06:54:49,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash 892711200, now seen corresponding path program 1 times [2024-11-19 06:54:49,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:49,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941842762] [2024-11-19 06:54:49,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:49,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:49,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:49,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941842762] [2024-11-19 06:54:49,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941842762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:49,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:49,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:54:49,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532180793] [2024-11-19 06:54:49,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:49,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:54:49,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:49,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:54:49,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:54:49,608 INFO L87 Difference]: Start difference. First operand 283 states and 323 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:49,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:49,736 INFO L93 Difference]: Finished difference Result 280 states and 320 transitions. [2024-11-19 06:54:49,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:54:49,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-19 06:54:49,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:49,739 INFO L225 Difference]: With dead ends: 280 [2024-11-19 06:54:49,739 INFO L226 Difference]: Without dead ends: 280 [2024-11-19 06:54:49,739 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-11-19 06:54:49,740 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 3 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:49,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 485 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:54:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-19 06:54:49,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2024-11-19 06:54:49,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 154 states have (on average 1.7727272727272727) internal successors, (273), 261 states have internal predecessors, (273), 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-11-19 06:54:49,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 320 transitions. [2024-11-19 06:54:49,755 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 320 transitions. Word has length 11 [2024-11-19 06:54:49,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:49,756 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 320 transitions. [2024-11-19 06:54:49,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:49,756 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 320 transitions. [2024-11-19 06:54:49,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:54:49,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:49,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:49,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:54:49,758 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-11-19 06:54:49,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:49,760 INFO L85 PathProgramCache]: Analyzing trace with hash 27333396, now seen corresponding path program 1 times [2024-11-19 06:54:49,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:49,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479254739] [2024-11-19 06:54:49,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:49,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:49,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:49,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479254739] [2024-11-19 06:54:49,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479254739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:49,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:49,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:54:49,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649851633] [2024-11-19 06:54:49,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:49,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:54:49,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:49,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:54:49,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:54:49,998 INFO L87 Difference]: Start difference. First operand 280 states and 320 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:50,486 INFO L93 Difference]: Finished difference Result 302 states and 346 transitions. [2024-11-19 06:54:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:54:50,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 06:54:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:50,490 INFO L225 Difference]: With dead ends: 302 [2024-11-19 06:54:50,490 INFO L226 Difference]: Without dead ends: 302 [2024-11-19 06:54:50,491 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-11-19 06:54:50,493 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 67 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:50,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1348 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:54:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-19 06:54:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 292. [2024-11-19 06:54:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 165 states have (on average 1.7333333333333334) internal successors, (286), 271 states have internal predecessors, (286), 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-11-19 06:54:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 335 transitions. [2024-11-19 06:54:50,506 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 335 transitions. Word has length 16 [2024-11-19 06:54:50,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:50,506 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 335 transitions. [2024-11-19 06:54:50,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 335 transitions. [2024-11-19 06:54:50,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:54:50,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:50,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:50,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:54:50,510 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-11-19 06:54:50,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:50,510 INFO L85 PathProgramCache]: Analyzing trace with hash 27333397, now seen corresponding path program 1 times [2024-11-19 06:54:50,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:50,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918323924] [2024-11-19 06:54:50,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:50,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:50,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:50,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918323924] [2024-11-19 06:54:50,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918323924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:50,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:50,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:54:50,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566577291] [2024-11-19 06:54:50,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:50,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:54:50,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:50,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:54:50,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:54:50,816 INFO L87 Difference]: Start difference. First operand 292 states and 335 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:51,368 INFO L93 Difference]: Finished difference Result 301 states and 344 transitions. [2024-11-19 06:54:51,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:54:51,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 06:54:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:51,371 INFO L225 Difference]: With dead ends: 301 [2024-11-19 06:54:51,371 INFO L226 Difference]: Without dead ends: 301 [2024-11-19 06:54:51,371 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-11-19 06:54:51,372 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 55 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:51,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1019 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:54:51,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-19 06:54:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 292. [2024-11-19 06:54:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 165 states have (on average 1.7212121212121212) internal successors, (284), 271 states have internal predecessors, (284), 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-11-19 06:54:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 333 transitions. [2024-11-19 06:54:51,384 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 333 transitions. Word has length 16 [2024-11-19 06:54:51,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:51,384 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 333 transitions. [2024-11-19 06:54:51,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:51,384 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 333 transitions. [2024-11-19 06:54:51,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:54:51,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:51,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:51,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:54:51,386 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-11-19 06:54:51,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:51,387 INFO L85 PathProgramCache]: Analyzing trace with hash 497589621, now seen corresponding path program 1 times [2024-11-19 06:54:51,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:51,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115953541] [2024-11-19 06:54:51,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:51,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:51,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:51,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115953541] [2024-11-19 06:54:51,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115953541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:51,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:51,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:54:51,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697482485] [2024-11-19 06:54:51,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:51,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:54:51,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:51,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:54:51,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:54:51,464 INFO L87 Difference]: Start difference. First operand 292 states and 333 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:51,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:51,677 INFO L93 Difference]: Finished difference Result 291 states and 332 transitions. [2024-11-19 06:54:51,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:54:51,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 06:54:51,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:51,680 INFO L225 Difference]: With dead ends: 291 [2024-11-19 06:54:51,680 INFO L226 Difference]: Without dead ends: 291 [2024-11-19 06:54:51,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:54:51,681 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 12 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:51,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 841 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:54:51,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-19 06:54:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-11-19 06:54:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 165 states have (on average 1.715151515151515) internal successors, (283), 270 states have internal predecessors, (283), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2024-11-19 06:54:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 332 transitions. [2024-11-19 06:54:51,689 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 332 transitions. Word has length 18 [2024-11-19 06:54:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:51,689 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 332 transitions. [2024-11-19 06:54:51,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 332 transitions. [2024-11-19 06:54:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:54:51,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:51,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:51,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:54:51,690 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-11-19 06:54:51,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:51,691 INFO L85 PathProgramCache]: Analyzing trace with hash 497589622, now seen corresponding path program 1 times [2024-11-19 06:54:51,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:51,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105322095] [2024-11-19 06:54:51,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:51,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:51,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:51,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105322095] [2024-11-19 06:54:51,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105322095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:51,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:51,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:54:51,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237782638] [2024-11-19 06:54:51,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:51,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:54:51,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:51,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:54:51,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:54:51,823 INFO L87 Difference]: Start difference. First operand 291 states and 332 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:52,007 INFO L93 Difference]: Finished difference Result 290 states and 331 transitions. [2024-11-19 06:54:52,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:54:52,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 06:54:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:52,009 INFO L225 Difference]: With dead ends: 290 [2024-11-19 06:54:52,009 INFO L226 Difference]: Without dead ends: 290 [2024-11-19 06:54:52,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:54:52,012 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 11 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:52,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 942 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:54:52,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-19 06:54:52,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2024-11-19 06:54:52,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 165 states have (on average 1.709090909090909) internal successors, (282), 269 states have internal predecessors, (282), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2024-11-19 06:54:52,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 331 transitions. [2024-11-19 06:54:52,022 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 331 transitions. Word has length 18 [2024-11-19 06:54:52,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:52,023 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 331 transitions. [2024-11-19 06:54:52,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 331 transitions. [2024-11-19 06:54:52,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:54:52,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:52,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:52,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:54:52,024 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-11-19 06:54:52,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1442255958, now seen corresponding path program 1 times [2024-11-19 06:54:52,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:52,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849183140] [2024-11-19 06:54:52,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:52,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:52,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:52,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849183140] [2024-11-19 06:54:52,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849183140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:52,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:52,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:54:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972071300] [2024-11-19 06:54:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:52,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:54:52,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:52,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:54:52,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:54:52,294 INFO L87 Difference]: Start difference. First operand 290 states and 331 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:52,456 INFO L93 Difference]: Finished difference Result 326 states and 371 transitions. [2024-11-19 06:54:52,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:54:52,457 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-19 06:54:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:52,458 INFO L225 Difference]: With dead ends: 326 [2024-11-19 06:54:52,458 INFO L226 Difference]: Without dead ends: 326 [2024-11-19 06:54:52,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:54:52,459 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 39 mSDsluCounter, 1940 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:52,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2223 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:54:52,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-19 06:54:52,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 304. [2024-11-19 06:54:52,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 178 states have (on average 1.6629213483146068) internal successors, (296), 281 states have internal predecessors, (296), 31 states have call successors, (31), 12 states have call predecessors, (31), 7 states have return successors, (20), 13 states have call predecessors, (20), 17 states have call successors, (20) [2024-11-19 06:54:52,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 347 transitions. [2024-11-19 06:54:52,468 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 347 transitions. Word has length 20 [2024-11-19 06:54:52,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:52,468 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 347 transitions. [2024-11-19 06:54:52,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:52,469 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 347 transitions. [2024-11-19 06:54:52,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:54:52,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:52,470 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] [2024-11-19 06:54:52,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:54:52,470 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-11-19 06:54:52,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:52,471 INFO L85 PathProgramCache]: Analyzing trace with hash -810865629, now seen corresponding path program 1 times [2024-11-19 06:54:52,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:52,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680285975] [2024-11-19 06:54:52,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:52,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:54:52,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:52,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680285975] [2024-11-19 06:54:52,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680285975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:52,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:52,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:54:52,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848455080] [2024-11-19 06:54:52,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:52,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:54:52,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:52,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:54:52,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:54:52,588 INFO L87 Difference]: Start difference. First operand 304 states and 347 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:52,698 INFO L93 Difference]: Finished difference Result 302 states and 345 transitions. [2024-11-19 06:54:52,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:54:52,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-19 06:54:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:52,701 INFO L225 Difference]: With dead ends: 302 [2024-11-19 06:54:52,701 INFO L226 Difference]: Without dead ends: 302 [2024-11-19 06:54:52,701 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-11-19 06:54:52,701 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 2 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:52,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 481 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:54:52,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-19 06:54:52,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2024-11-19 06:54:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 178 states have (on average 1.651685393258427) internal successors, (294), 279 states have internal predecessors, (294), 31 states have call successors, (31), 12 states have call predecessors, (31), 7 states have return successors, (20), 13 states have call predecessors, (20), 17 states have call successors, (20) [2024-11-19 06:54:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 345 transitions. [2024-11-19 06:54:52,709 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 345 transitions. Word has length 27 [2024-11-19 06:54:52,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:52,710 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 345 transitions. [2024-11-19 06:54:52,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 345 transitions. [2024-11-19 06:54:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:54:52,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:52,711 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, 1, 1, 1] [2024-11-19 06:54:52,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:54:52,711 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-11-19 06:54:52,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:52,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1882412934, now seen corresponding path program 1 times [2024-11-19 06:54:52,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:52,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190832785] [2024-11-19 06:54:52,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:52,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:54:52,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:52,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190832785] [2024-11-19 06:54:52,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190832785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:52,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:52,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:54:52,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600408142] [2024-11-19 06:54:52,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:52,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:54:52,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:52,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:54:52,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:54:52,898 INFO L87 Difference]: Start difference. First operand 302 states and 345 transitions. Second operand has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:53,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:53,177 INFO L93 Difference]: Finished difference Result 300 states and 343 transitions. [2024-11-19 06:54:53,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:54:53,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-19 06:54:53,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:53,179 INFO L225 Difference]: With dead ends: 300 [2024-11-19 06:54:53,179 INFO L226 Difference]: Without dead ends: 300 [2024-11-19 06:54:53,180 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-11-19 06:54:53,180 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 48 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:53,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 984 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:54:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-19 06:54:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2024-11-19 06:54:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 178 states have (on average 1.6404494382022472) internal successors, (292), 277 states have internal predecessors, (292), 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-11-19 06:54:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 343 transitions. [2024-11-19 06:54:53,188 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 343 transitions. Word has length 31 [2024-11-19 06:54:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:53,188 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 343 transitions. [2024-11-19 06:54:53,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 343 transitions. [2024-11-19 06:54:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:54:53,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:53,190 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, 1, 1, 1] [2024-11-19 06:54:53,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:54:53,190 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-11-19 06:54:53,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:53,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1882412935, now seen corresponding path program 1 times [2024-11-19 06:54:53,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:53,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765516527] [2024-11-19 06:54:53,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:53,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:53,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:54:53,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:53,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765516527] [2024-11-19 06:54:53,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765516527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:53,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:53,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:54:53,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069682575] [2024-11-19 06:54:53,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:53,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:54:53,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:53,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:54:53,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:54:53,469 INFO L87 Difference]: Start difference. First operand 300 states and 343 transitions. Second operand has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:53,846 INFO L93 Difference]: Finished difference Result 298 states and 341 transitions. [2024-11-19 06:54:53,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:54:53,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-19 06:54:53,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:53,848 INFO L225 Difference]: With dead ends: 298 [2024-11-19 06:54:53,848 INFO L226 Difference]: Without dead ends: 298 [2024-11-19 06:54:53,848 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-11-19 06:54:53,849 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 34 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:53,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 882 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:54:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-19 06:54:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-11-19 06:54:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 178 states have (on average 1.6292134831460674) internal successors, (290), 275 states have internal predecessors, (290), 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-11-19 06:54:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 341 transitions. [2024-11-19 06:54:53,856 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 341 transitions. Word has length 31 [2024-11-19 06:54:53,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:53,856 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 341 transitions. [2024-11-19 06:54:53,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 341 transitions. [2024-11-19 06:54:53,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:54:53,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:53,859 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, 1, 1, 1, 1, 1] [2024-11-19 06:54:53,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:54:53,860 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-11-19 06:54:53,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:53,860 INFO L85 PathProgramCache]: Analyzing trace with hash 817600359, now seen corresponding path program 1 times [2024-11-19 06:54:53,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:53,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641090984] [2024-11-19 06:54:53,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:53,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:53,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:54:53,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:53,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641090984] [2024-11-19 06:54:53,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641090984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:53,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:53,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:54:53,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745722849] [2024-11-19 06:54:53,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:53,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:54:53,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:53,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:54:53,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:54:53,958 INFO L87 Difference]: Start difference. First operand 298 states and 341 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:54,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:54,148 INFO L93 Difference]: Finished difference Result 297 states and 340 transitions. [2024-11-19 06:54:54,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:54:54,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-19 06:54:54,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:54,150 INFO L225 Difference]: With dead ends: 297 [2024-11-19 06:54:54,150 INFO L226 Difference]: Without dead ends: 297 [2024-11-19 06:54:54,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:54:54,151 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 7 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:54,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 828 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:54:54,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-19 06:54:54,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-11-19 06:54:54,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 178 states have (on average 1.6235955056179776) internal successors, (289), 274 states have internal predecessors, (289), 31 states have call successors, (31), 12 states have call predecessors, (31), 7 states have return successors, (20), 13 states have call predecessors, (20), 17 states have call successors, (20) [2024-11-19 06:54:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 340 transitions. [2024-11-19 06:54:54,158 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 340 transitions. Word has length 33 [2024-11-19 06:54:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:54,158 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 340 transitions. [2024-11-19 06:54:54,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 340 transitions. [2024-11-19 06:54:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:54:54,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:54,160 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, 1, 1, 1, 1, 1] [2024-11-19 06:54:54,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:54:54,160 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-11-19 06:54:54,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:54,161 INFO L85 PathProgramCache]: Analyzing trace with hash 817600360, now seen corresponding path program 1 times [2024-11-19 06:54:54,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:54,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292192881] [2024-11-19 06:54:54,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:54,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:54:54,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:54,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292192881] [2024-11-19 06:54:54,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292192881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:54,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:54,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:54:54,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723523601] [2024-11-19 06:54:54,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:54,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:54:54,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:54,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:54:54,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:54:54,304 INFO L87 Difference]: Start difference. First operand 297 states and 340 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:54,496 INFO L93 Difference]: Finished difference Result 296 states and 339 transitions. [2024-11-19 06:54:54,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:54:54,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-19 06:54:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:54,500 INFO L225 Difference]: With dead ends: 296 [2024-11-19 06:54:54,500 INFO L226 Difference]: Without dead ends: 296 [2024-11-19 06:54:54,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:54:54,503 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 8 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:54,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1120 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:54:54,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-19 06:54:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2024-11-19 06:54:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 178 states have (on average 1.6179775280898876) internal successors, (288), 273 states have internal predecessors, (288), 31 states have call successors, (31), 12 states have call predecessors, (31), 7 states have return successors, (20), 13 states have call predecessors, (20), 17 states have call successors, (20) [2024-11-19 06:54:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 339 transitions. [2024-11-19 06:54:54,510 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 339 transitions. Word has length 33 [2024-11-19 06:54:54,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:54,510 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 339 transitions. [2024-11-19 06:54:54,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:54,511 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 339 transitions. [2024-11-19 06:54:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:54:54,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:54,512 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:54,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:54:54,512 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-11-19 06:54:54,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash -265067576, now seen corresponding path program 1 times [2024-11-19 06:54:54,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:54,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135639450] [2024-11-19 06:54:54,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:54,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:54,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:54:54,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:54,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135639450] [2024-11-19 06:54:54,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135639450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:54:54,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:54:54,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:54:54,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805032447] [2024-11-19 06:54:54,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:54:54,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:54:54,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:54,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:54:54,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:54:54,813 INFO L87 Difference]: Start difference. First operand 296 states and 339 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:54,939 INFO L93 Difference]: Finished difference Result 306 states and 349 transitions. [2024-11-19 06:54:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:54:54,939 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-19 06:54:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:54,941 INFO L225 Difference]: With dead ends: 306 [2024-11-19 06:54:54,941 INFO L226 Difference]: Without dead ends: 306 [2024-11-19 06:54:54,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:54:54,942 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 17 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:54,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1893 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:54:54,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-19 06:54:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2024-11-19 06:54:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 187 states have (on average 1.588235294117647) internal successors, (297), 282 states have internal predecessors, (297), 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-11-19 06:54:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 348 transitions. [2024-11-19 06:54:54,950 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 348 transitions. Word has length 35 [2024-11-19 06:54:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:54,951 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 348 transitions. [2024-11-19 06:54:54,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:54:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 348 transitions. [2024-11-19 06:54:54,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 06:54:54,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:54,952 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, 1, 1] [2024-11-19 06:54:54,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:54:54,952 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-11-19 06:54:54,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:54,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1295464090, now seen corresponding path program 1 times [2024-11-19 06:54:54,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:54,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527524285] [2024-11-19 06:54:54,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:54,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:54:55,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:55,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527524285] [2024-11-19 06:54:55,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527524285] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:54:55,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939042998] [2024-11-19 06:54:55,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:55,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:54:55,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:54:55,676 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-11-19 06:54:55,678 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-11-19 06:54:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:55,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-19 06:54:55,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:54:55,974 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-11-19 06:54:56,024 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-19 06:54:56,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-19 06:54:56,112 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-11-19 06:54:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:54:56,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:54:56,414 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 38 treesize of output 34 [2024-11-19 06:54:56,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:56,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 339 [2024-11-19 06:54:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:54:57,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939042998] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:54:57,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:54:57,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 23 [2024-11-19 06:54:57,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362584178] [2024-11-19 06:54:57,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:54:57,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 06:54:57,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:57,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 06:54:57,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-19 06:54:57,317 INFO L87 Difference]: Start difference. First operand 305 states and 348 transitions. Second operand has 24 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:54:58,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:58,522 INFO L93 Difference]: Finished difference Result 305 states and 348 transitions. [2024-11-19 06:54:58,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:54:58,523 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2024-11-19 06:54:58,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:58,524 INFO L225 Difference]: With dead ends: 305 [2024-11-19 06:54:58,525 INFO L226 Difference]: Without dead ends: 305 [2024-11-19 06:54:58,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2024-11-19 06:54:58,526 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 49 mSDsluCounter, 3033 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3302 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:58,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3302 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1686 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 06:54:58,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-19 06:54:58,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2024-11-19 06:54:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 187 states have (on average 1.5828877005347595) internal successors, (296), 281 states have internal predecessors, (296), 31 states have call successors, (31), 12 states have call predecessors, (31), 7 states have return successors, (20), 13 states have call predecessors, (20), 17 states have call successors, (20) [2024-11-19 06:54:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 347 transitions. [2024-11-19 06:54:58,534 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 347 transitions. Word has length 51 [2024-11-19 06:54:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:58,534 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 347 transitions. [2024-11-19 06:54:58,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:54:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 347 transitions. [2024-11-19 06:54:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 06:54:58,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:58,536 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, 1, 1] [2024-11-19 06:54:58,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 06:54:58,740 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-11-19 06:54:58,741 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-11-19 06:54:58,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:58,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1295464091, now seen corresponding path program 1 times [2024-11-19 06:54:58,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:58,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573138200] [2024-11-19 06:54:58,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:58,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:59,602 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:54:59,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:59,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573138200] [2024-11-19 06:54:59,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573138200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:54:59,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106713187] [2024-11-19 06:54:59,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:54:59,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:54:59,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:54:59,605 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-11-19 06:54:59,606 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-11-19 06:54:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:54:59,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-19 06:54:59,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:54:59,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:55:00,042 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-11-19 06:55:00,049 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-11-19 06:55:00,168 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 06:55:00,169 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-11-19 06:55:00,185 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 06:55:00,186 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 15 treesize of output 15 [2024-11-19 06:55:00,293 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-11-19 06:55:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:55:00,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:00,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-19 06:55:00,855 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-11-19 06:55:00,858 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-11-19 06:55:01,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:55:01,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2024-11-19 06:55:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:55:01,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106713187] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:55:01,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:55:01,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 34 [2024-11-19 06:55:01,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904768859] [2024-11-19 06:55:01,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:01,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-19 06:55:01,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:01,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-19 06:55:01,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1084, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 06:55:01,276 INFO L87 Difference]: Start difference. First operand 304 states and 347 transitions. Second operand has 35 states, 31 states have (on average 2.967741935483871) internal successors, (92), 32 states have internal predecessors, (92), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:55:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:03,006 INFO L93 Difference]: Finished difference Result 304 states and 347 transitions. [2024-11-19 06:55:03,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:55:03,007 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 2.967741935483871) internal successors, (92), 32 states have internal predecessors, (92), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2024-11-19 06:55:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:03,008 INFO L225 Difference]: With dead ends: 304 [2024-11-19 06:55:03,008 INFO L226 Difference]: Without dead ends: 304 [2024-11-19 06:55:03,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=187, Invalid=1453, Unknown=0, NotChecked=0, Total=1640 [2024-11-19 06:55:03,009 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 44 mSDsluCounter, 3835 mSDsCounter, 0 mSdLazyCounter, 2624 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4104 SdHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:03,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4104 Invalid, 2631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2624 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 06:55:03,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-19 06:55:03,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 303. [2024-11-19 06:55:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 187 states have (on average 1.5775401069518717) internal successors, (295), 280 states have internal predecessors, (295), 31 states have call successors, (31), 12 states have call predecessors, (31), 7 states have return successors, (20), 13 states have call predecessors, (20), 17 states have call successors, (20) [2024-11-19 06:55:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 346 transitions. [2024-11-19 06:55:03,016 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 346 transitions. Word has length 51 [2024-11-19 06:55:03,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:03,017 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 346 transitions. [2024-11-19 06:55:03,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 2.967741935483871) internal successors, (92), 32 states have internal predecessors, (92), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:55:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 346 transitions. [2024-11-19 06:55:03,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 06:55:03,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:03,018 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:03,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 06:55:03,218 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-11-19 06:55:03,219 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-11-19 06:55:03,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:03,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1408823199, now seen corresponding path program 1 times [2024-11-19 06:55:03,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:03,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828766061] [2024-11-19 06:55:03,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:03,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:55:03,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:03,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828766061] [2024-11-19 06:55:03,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828766061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:55:03,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:55:03,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:55:03,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218332494] [2024-11-19 06:55:03,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:55:03,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:55:03,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:03,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:55:03,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:55:03,384 INFO L87 Difference]: Start difference. First operand 303 states and 346 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:55:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:03,419 INFO L93 Difference]: Finished difference Result 289 states and 321 transitions. [2024-11-19 06:55:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:55:03,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2024-11-19 06:55:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:03,421 INFO L225 Difference]: With dead ends: 289 [2024-11-19 06:55:03,421 INFO L226 Difference]: Without dead ends: 289 [2024-11-19 06:55:03,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:55:03,422 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 28 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:03,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1093 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:55:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-19 06:55:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2024-11-19 06:55:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 176 states have (on average 1.5852272727272727) internal successors, (279), 269 states have internal predecessors, (279), 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-11-19 06:55:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 321 transitions. [2024-11-19 06:55:03,429 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 321 transitions. Word has length 54 [2024-11-19 06:55:03,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:03,430 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 321 transitions. [2024-11-19 06:55:03,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:55:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 321 transitions. [2024-11-19 06:55:03,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 06:55:03,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:03,431 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:03,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 06:55:03,431 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-11-19 06:55:03,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:03,432 INFO L85 PathProgramCache]: Analyzing trace with hash 737941514, now seen corresponding path program 1 times [2024-11-19 06:55:03,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:03,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990550167] [2024-11-19 06:55:03,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:03,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:55:04,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:04,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990550167] [2024-11-19 06:55:04,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990550167] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:04,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654146784] [2024-11-19 06:55:04,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:04,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:04,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:04,030 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-11-19 06:55:04,031 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-11-19 06:55:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:04,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-19 06:55:04,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:04,323 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-11-19 06:55:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:55:04,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:04,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654146784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:04,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:55:04,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2024-11-19 06:55:04,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419268811] [2024-11-19 06:55:04,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:04,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 06:55:04,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:04,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 06:55:04,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:55:04,849 INFO L87 Difference]: Start difference. First operand 289 states and 321 transitions. Second operand has 22 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 06:55:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:05,993 INFO L93 Difference]: Finished difference Result 293 states and 323 transitions. [2024-11-19 06:55:05,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 06:55:05,994 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 64 [2024-11-19 06:55:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:05,995 INFO L225 Difference]: With dead ends: 293 [2024-11-19 06:55:05,996 INFO L226 Difference]: Without dead ends: 293 [2024-11-19 06:55:05,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 06:55:05,998 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 112 mSDsluCounter, 2246 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 2447 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:05,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 2447 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 06:55:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-19 06:55:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2024-11-19 06:55:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 179 states have (on average 1.5698324022346368) internal successors, (281), 273 states have internal predecessors, (281), 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-11-19 06:55:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 323 transitions. [2024-11-19 06:55:06,012 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 323 transitions. Word has length 64 [2024-11-19 06:55:06,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:06,013 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 323 transitions. [2024-11-19 06:55:06,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 06:55:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 323 transitions. [2024-11-19 06:55:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 06:55:06,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:06,014 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:06,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 06:55:06,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:06,215 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-11-19 06:55:06,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:06,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1358928089, now seen corresponding path program 1 times [2024-11-19 06:55:06,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:06,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203258863] [2024-11-19 06:55:06,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:06,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:55:07,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:07,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203258863] [2024-11-19 06:55:07,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203258863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:07,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030954246] [2024-11-19 06:55:07,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:07,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:07,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:07,893 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-11-19 06:55:07,895 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-11-19 06:55:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:08,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-19 06:55:08,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:08,292 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-11-19 06:55:08,349 WARN L851 $PredicateComparison]: unable to prove that (and (<= |c_dll_create_generic_~#dll~0.offset| 0) (= (select |c_old(#valid)| |c_dll_create_generic_~#dll~0.base|) 0) (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse0 (select (select |c_#memory_$Pointer$#1.base| |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (select |v_#valid_BEFORE_CALL_6| |c_dll_create_generic_~#dll~0.base|)) |v_#valid_BEFORE_CALL_6|)))) (= |c_#valid| (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (select |c_#valid| |c_dll_create_generic_~#dll~0.base|))))) is different from false [2024-11-19 06:55:08,351 WARN L873 $PredicateComparison]: unable to prove that (and (<= |c_dll_create_generic_~#dll~0.offset| 0) (= (select |c_old(#valid)| |c_dll_create_generic_~#dll~0.base|) 0) (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse0 (select (select |c_#memory_$Pointer$#1.base| |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (select |v_#valid_BEFORE_CALL_6| |c_dll_create_generic_~#dll~0.base|)) |v_#valid_BEFORE_CALL_6|)))) (= |c_#valid| (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (select |c_#valid| |c_dll_create_generic_~#dll~0.base|))))) is different from true [2024-11-19 06:55:08,364 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 39 treesize of output 35 [2024-11-19 06:55:08,514 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset| Int)) (and (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_#t~mem6#1.base| (select (select |c_old(#memory_$Pointer$#1.base)| |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|)) (<= |##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset| |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) (<= 0 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|))) (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1)))) is different from true [2024-11-19 06:55:08,529 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset| Int)) (and (<= |##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset| |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) (<= 0 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|) (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~next~0#1.base| (select (select |c_old(#memory_$Pointer$#1.base)| |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|)))) (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1)))) is different from true [2024-11-19 06:55:08,639 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:08,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2024-11-19 06:55:08,699 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 (exists ((v_arrayElimCell_26 Int)) (= 1 (select |c_#valid| v_arrayElimCell_26))))) (or (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_20|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_20| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (select |v_#valid_BEFORE_CALL_6| |c_dll_create_generic_~#dll~0.base|)) |v_#valid_BEFORE_CALL_6|) (= (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0)) |v_old(#valid)_AFTER_CALL_20|)))) (and .cse1 (= |c_#valid| (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| 1))) (and (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (select |c_#valid| |c_dll_create_generic_~#dll~0.base|)) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) .cse1))) (= (select |c_old(#valid)| |c_dll_create_generic_~#dll~0.base|) 0)) is different from false [2024-11-19 06:55:08,701 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 (exists ((v_arrayElimCell_26 Int)) (= 1 (select |c_#valid| v_arrayElimCell_26))))) (or (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_20|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_20| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (select |v_#valid_BEFORE_CALL_6| |c_dll_create_generic_~#dll~0.base|)) |v_#valid_BEFORE_CALL_6|) (= (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0)) |v_old(#valid)_AFTER_CALL_20|)))) (and .cse1 (= |c_#valid| (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| 1))) (and (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (select |c_#valid| |c_dll_create_generic_~#dll~0.base|)) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) .cse1))) (= (select |c_old(#valid)| |c_dll_create_generic_~#dll~0.base|) 0)) is different from true [2024-11-19 06:55:08,840 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_arrayElimCell_26 Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33| v_DerPreprocessor_2) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) (and (= (select .cse0 |v_dll_create_generic_~#dll~0.base_33|) v_DerPreprocessor_2) (= |c_#valid| (store (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|))) (= (select .cse0 v_arrayElimCell_26) 1)))) (= (select |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33|) 0))) (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (let ((.cse1 (store |v_old(#valid)_AFTER_CALL_20| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1)) (.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_20|))) (and (= (select .cse1 .cse2) 1) (= (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33| (select |v_#valid_BEFORE_CALL_6| |v_dll_create_generic_~#dll~0.base_33|)) |v_#valid_BEFORE_CALL_6|) (= |c_#valid| (store .cse1 |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|))) (= (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2)) |v_old(#valid)_AFTER_CALL_20|)))) (= (select |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33|) 0))) (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (= |c_#valid| (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|))) (exists ((v_arrayElimCell_26 Int)) (= (select (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33| 1) v_arrayElimCell_26) 1)) (= (select |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33|) 0)))) is different from false [2024-11-19 06:55:08,842 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_arrayElimCell_26 Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33| v_DerPreprocessor_2) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) (and (= (select .cse0 |v_dll_create_generic_~#dll~0.base_33|) v_DerPreprocessor_2) (= |c_#valid| (store (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|))) (= (select .cse0 v_arrayElimCell_26) 1)))) (= (select |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33|) 0))) (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (let ((.cse1 (store |v_old(#valid)_AFTER_CALL_20| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1)) (.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_20|))) (and (= (select .cse1 .cse2) 1) (= (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33| (select |v_#valid_BEFORE_CALL_6| |v_dll_create_generic_~#dll~0.base_33|)) |v_#valid_BEFORE_CALL_6|) (= |c_#valid| (store .cse1 |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|))) (= (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2)) |v_old(#valid)_AFTER_CALL_20|)))) (= (select |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33|) 0))) (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (= |c_#valid| (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|))) (exists ((v_arrayElimCell_26 Int)) (= (select (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33| 1) v_arrayElimCell_26) 1)) (= (select |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33|) 0)))) is different from true [2024-11-19 06:55:09,251 INFO L349 Elim1Store]: treesize reduction 425, result has 20.9 percent of original size [2024-11-19 06:55:09,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 31 case distinctions, treesize of input 147 treesize of output 298 [2024-11-19 06:55:10,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 06:55:11,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 06:55:11,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 06:55:11,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 06:55:11,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 06:55:11,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 06:55:11,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 06:55:11,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 06:55:11,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 06:55:11,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 06:55:11,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 06:55:11,476 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-19 06:55:14,236 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:14,239 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2024-11-19 06:55:14,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 18 [2024-11-19 06:55:14,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:14,978 INFO L349 Elim1Store]: treesize reduction 55, result has 14.1 percent of original size [2024-11-19 06:55:14,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 57 [2024-11-19 06:55:15,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:15,072 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 06:55:15,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 22 [2024-11-19 06:55:15,497 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 06:55:15,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 13 [2024-11-19 06:55:15,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:15,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:15,512 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 06:55:15,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2024-11-19 06:55:15,955 INFO L349 Elim1Store]: treesize reduction 239, result has 17.0 percent of original size [2024-11-19 06:55:15,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 111 treesize of output 197 [2024-11-19 06:55:16,368 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2024-11-19 06:55:16,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 17 [2024-11-19 06:55:16,828 INFO L349 Elim1Store]: treesize reduction 267, result has 0.4 percent of original size [2024-11-19 06:55:16,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 532 treesize of output 1 [2024-11-19 06:55:17,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:17,164 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:17,168 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:17,172 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 06:55:17,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 22 [2024-11-19 06:55:17,273 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:17,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:17,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:17,280 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:55:17,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:17,288 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2024-11-19 06:55:17,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 1 [2024-11-19 06:55:17,516 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 06:55:17,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 13 [2024-11-19 06:55:17,683 INFO L349 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2024-11-19 06:55:17,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 1 [2024-11-19 06:55:26,724 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_281 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_280 Int)) (let ((.cse1 (store v_prenex_281 v_prenex_280 1)) (.cse0 (@diff v_arrayElimArr_1 v_prenex_281))) (and (= v_prenex_281 (store v_arrayElimArr_1 .cse0 (select v_prenex_281 .cse0))) (= |c_#valid| (store .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 0)) (= (select v_arrayElimArr_1 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse1 .cse0) 1) (= (select (store (store v_arrayElimArr_1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 1) (not (= |c_dll_insert_master_~item~1#1.base| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|))))) (exists ((v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|v_dll_create_generic_~#dll~0.base_33| Int)) (let ((.cse2 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1)) (.cse3 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|))) (and (= |c_#valid| (store .cse2 |v_dll_create_generic_~#dll~0.base_33| 0)) (= (store v_arrayElimArr_1 .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3)) |v_old(#valid)_AFTER_CALL_20|) (= (select v_arrayElimArr_1 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse2 .cse3) 1) (not (= |v_dll_create_generic_~#dll~0.base_33| |c_dll_insert_master_~item~1#1.base|))))) (exists ((v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse5 (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) (.cse4 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse6 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1))) (and (= (store v_arrayElimArr_1 .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4)) |v_old(#valid)_AFTER_CALL_20|) (= .cse5 (select v_arrayElimArr_1 |v_dll_create_generic_~#dll~0.base_33|)) (= (select (store (store v_arrayElimArr_1 v_prenex_19 0) |v_dll_create_generic_~#dll~0.base_33| .cse5) |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse6 .cse4) 1) (= |c_#valid| (store .cse6 v_prenex_19 (select |c_#valid| v_prenex_19))) (not (= |v_dll_create_generic_~#dll~0.base_33| |c_dll_insert_master_~item~1#1.base|)) (not (= |v_dll_create_generic_~#dll~0.base_33| v_prenex_19))))) (= (select |c_#valid| |c_dll_insert_master_~item~1#1.base|) 1) (exists ((v_DerPreprocessor_56 Int) (v_prenex_281 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_280 Int) (v_prenex_19 Int)) (let ((.cse8 (store v_prenex_281 v_prenex_280 1)) (.cse7 (@diff v_arrayElimArr_1 v_prenex_281)) (.cse9 (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_56) |v_dll_create_generic_~#dll~0.base_33| 0) v_prenex_19)) |v_dll_create_generic_~#dll~0.base_33| 0))) (and (= v_prenex_281 (store v_arrayElimArr_1 .cse7 (select v_prenex_281 .cse7))) (= |c_#valid| (store .cse8 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (select .cse8 .cse7) 1) (= (select .cse9 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse9 v_prenex_19) 0) (= (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|) 0) (not (= |v_dll_create_generic_~#dll~0.base_33| v_prenex_19))))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_DerPreprocessor_64 Int) (v_prenex_19 Int)) (let ((.cse13 (store v_arrayElimArr_1 v_prenex_19 0))) (let ((.cse10 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse11 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1)) (.cse12 (select (store (store (store .cse13 v_prenex_16 v_DerPreprocessor_64) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) v_prenex_16))) (and (not (= v_prenex_16 |c_dll_insert_master_~item~1#1.base|)) (= (store v_arrayElimArr_1 .cse10 (select |v_old(#valid)_AFTER_CALL_20| .cse10)) |v_old(#valid)_AFTER_CALL_20|) (= (select .cse11 .cse10) 1) (= (select v_arrayElimArr_1 v_prenex_16) .cse12) (= (select (store .cse13 v_prenex_16 (select |c_#valid| v_prenex_16)) |c_dll_insert_master_~item~1#1.base|) 1) (= |c_#valid| (store .cse11 v_prenex_19 (select |c_#valid| v_prenex_19))) (not (= v_prenex_16 v_prenex_19)) (= v_DerPreprocessor_64 .cse12))))) (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (exists ((v_DerPreprocessor_58 Int) (v_arrayElimArr_1 (Array Int Int)) (v_prenex_253 (Array Int Int)) (v_prenex_252 Int) (v_prenex_19 Int)) (let ((.cse15 (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_58) |v_dll_create_generic_~#dll~0.base_33| 1) v_prenex_19)) |v_dll_create_generic_~#dll~0.base_33| 1)) (.cse14 (store v_prenex_253 v_prenex_252 1)) (.cse16 (@diff v_arrayElimArr_1 v_prenex_253))) (and (= (select v_arrayElimArr_1 |v_dll_create_generic_~#dll~0.base_33|) 1) (= |c_#valid| (store .cse14 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (select .cse15 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse15 v_prenex_19) 0) (= (store v_arrayElimArr_1 .cse16 (select v_prenex_253 .cse16)) v_prenex_253) (= (select .cse14 .cse16) 1)))) (= (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|) 1))) (exists ((v_arrayElimArr_1 (Array Int Int)) (v_prenex_286 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_287 (Array Int Int)) (v_prenex_19 Int) (v_DerPreprocessor_52 Int)) (let ((.cse17 (store v_prenex_287 v_prenex_286 1)) (.cse18 (@diff v_arrayElimArr_1 v_prenex_287)) (.cse19 (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_52) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) v_prenex_19)) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| (select |c_#valid| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|)))) (and (not (= |v_dll_create_generic_~#dll~0.base_33| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|)) (not (= v_prenex_19 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|)) (= (select .cse17 .cse18) 1) (= |c_#valid| (store .cse17 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (select v_arrayElimArr_1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 1) (= (select .cse19 |c_dll_insert_master_~item~1#1.base|) 1) (= v_prenex_287 (store v_arrayElimArr_1 .cse18 (select v_prenex_287 .cse18))) (= (select .cse19 v_prenex_19) 0) (not (= |v_dll_create_generic_~#dll~0.base_33| v_prenex_19))))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse22 (store v_arrayElimArr_1 v_prenex_19 0))) (let ((.cse20 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse21 (store .cse22 v_prenex_16 (select |c_#valid| v_prenex_16))) (.cse23 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1))) (and (not (= v_prenex_16 |c_dll_insert_master_~item~1#1.base|)) (= (store v_arrayElimArr_1 .cse20 (select |v_old(#valid)_AFTER_CALL_20| .cse20)) |v_old(#valid)_AFTER_CALL_20|) (= (select .cse21 v_prenex_19) 0) (= (select v_arrayElimArr_1 v_prenex_16) 0) (= (select (store (store (store .cse22 v_prenex_16 0) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) v_prenex_16) 0) (= (select .cse23 .cse20) 1) (= (select .cse21 |c_dll_insert_master_~item~1#1.base|) 1) (= |c_#valid| (store .cse23 v_prenex_19 (select |c_#valid| v_prenex_19))))))) (exists ((v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_DerPreprocessor_61 Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse24 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse25 (let ((.cse27 (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|))) (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_61) |v_dll_create_generic_~#dll~0.base_33| .cse27) v_prenex_19)) |v_dll_create_generic_~#dll~0.base_33| .cse27))) (.cse26 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1))) (and (= (store v_arrayElimArr_1 .cse24 (select |v_old(#valid)_AFTER_CALL_20| .cse24)) |v_old(#valid)_AFTER_CALL_20|) (= (select .cse25 v_prenex_19) 0) (= (select .cse26 .cse24) 1) (= (select .cse25 |c_dll_insert_master_~item~1#1.base|) 1) (= |c_#valid| (store .cse26 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (select v_arrayElimArr_1 |v_dll_create_generic_~#dll~0.base_33|) 0) (not (= |v_dll_create_generic_~#dll~0.base_33| |c_dll_insert_master_~item~1#1.base|)) (not (= |v_dll_create_generic_~#dll~0.base_33| v_prenex_19))))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse28 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse29 (store v_arrayElimArr_1 v_prenex_19 0)) (.cse30 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1))) (and (= (store v_arrayElimArr_1 .cse28 (select |v_old(#valid)_AFTER_CALL_20| .cse28)) |v_old(#valid)_AFTER_CALL_20|) (= (select v_arrayElimArr_1 v_prenex_16) 1) (= (select (store (store (store .cse29 v_prenex_16 1) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 1) (= (select .cse30 .cse28) 1) (= (select (store .cse29 v_prenex_16 (select |c_#valid| v_prenex_16)) |c_dll_insert_master_~item~1#1.base|) 1) (= |c_#valid| (store .cse30 v_prenex_19 (select |c_#valid| v_prenex_19))) (not (= v_prenex_16 v_prenex_19))))) (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (= (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|) 1) (exists ((v_arrayElimArr_1 (Array Int Int)) (v_DerPreprocessor_59 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_prenex_253 (Array Int Int)) (v_prenex_252 Int) (v_prenex_19 Int)) (let ((.cse31 (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_59) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| 1) v_prenex_19)) |v_dll_create_generic_~#dll~0.base_33| 1)) (.cse32 (store v_prenex_253 v_prenex_252 1)) (.cse33 (@diff v_arrayElimArr_1 v_prenex_253))) (and (= (select .cse31 v_prenex_19) 0) (= (select .cse31 |c_dll_insert_master_~item~1#1.base|) 1) (= (select v_arrayElimArr_1 |v_dll_create_generic_~#dll~0.base_33|) 1) (= |c_#valid| (store .cse32 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (store v_arrayElimArr_1 .cse33 (select v_prenex_253 .cse33)) v_prenex_253) (= (select .cse32 .cse33) 1)))))) (exists ((v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse34 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1)) (.cse35 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse36 (store v_arrayElimArr_1 v_prenex_19 0))) (and (= |c_#valid| (store .cse34 v_prenex_19 0)) (= (store v_arrayElimArr_1 .cse35 (select |v_old(#valid)_AFTER_CALL_20| .cse35)) |v_old(#valid)_AFTER_CALL_20|) (= (select .cse36 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse34 .cse35) 1) (= (select (store (store .cse36 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) v_prenex_19) 0))))) is different from false [2024-11-19 06:55:26,739 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_281 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_280 Int)) (let ((.cse1 (store v_prenex_281 v_prenex_280 1)) (.cse0 (@diff v_arrayElimArr_1 v_prenex_281))) (and (= v_prenex_281 (store v_arrayElimArr_1 .cse0 (select v_prenex_281 .cse0))) (= |c_#valid| (store .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 0)) (= (select v_arrayElimArr_1 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse1 .cse0) 1) (= (select (store (store v_arrayElimArr_1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 1) (not (= |c_dll_insert_master_~item~1#1.base| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|))))) (exists ((v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|v_dll_create_generic_~#dll~0.base_33| Int)) (let ((.cse2 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1)) (.cse3 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|))) (and (= |c_#valid| (store .cse2 |v_dll_create_generic_~#dll~0.base_33| 0)) (= (store v_arrayElimArr_1 .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3)) |v_old(#valid)_AFTER_CALL_20|) (= (select v_arrayElimArr_1 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse2 .cse3) 1) (not (= |v_dll_create_generic_~#dll~0.base_33| |c_dll_insert_master_~item~1#1.base|))))) (exists ((v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse5 (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) (.cse4 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse6 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1))) (and (= (store v_arrayElimArr_1 .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4)) |v_old(#valid)_AFTER_CALL_20|) (= .cse5 (select v_arrayElimArr_1 |v_dll_create_generic_~#dll~0.base_33|)) (= (select (store (store v_arrayElimArr_1 v_prenex_19 0) |v_dll_create_generic_~#dll~0.base_33| .cse5) |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse6 .cse4) 1) (= |c_#valid| (store .cse6 v_prenex_19 (select |c_#valid| v_prenex_19))) (not (= |v_dll_create_generic_~#dll~0.base_33| |c_dll_insert_master_~item~1#1.base|)) (not (= |v_dll_create_generic_~#dll~0.base_33| v_prenex_19))))) (= (select |c_#valid| |c_dll_insert_master_~item~1#1.base|) 1) (exists ((v_DerPreprocessor_56 Int) (v_prenex_281 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_280 Int) (v_prenex_19 Int)) (let ((.cse8 (store v_prenex_281 v_prenex_280 1)) (.cse7 (@diff v_arrayElimArr_1 v_prenex_281)) (.cse9 (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_56) |v_dll_create_generic_~#dll~0.base_33| 0) v_prenex_19)) |v_dll_create_generic_~#dll~0.base_33| 0))) (and (= v_prenex_281 (store v_arrayElimArr_1 .cse7 (select v_prenex_281 .cse7))) (= |c_#valid| (store .cse8 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (select .cse8 .cse7) 1) (= (select .cse9 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse9 v_prenex_19) 0) (= (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|) 0) (not (= |v_dll_create_generic_~#dll~0.base_33| v_prenex_19))))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_DerPreprocessor_64 Int) (v_prenex_19 Int)) (let ((.cse13 (store v_arrayElimArr_1 v_prenex_19 0))) (let ((.cse10 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse11 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1)) (.cse12 (select (store (store (store .cse13 v_prenex_16 v_DerPreprocessor_64) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) v_prenex_16))) (and (not (= v_prenex_16 |c_dll_insert_master_~item~1#1.base|)) (= (store v_arrayElimArr_1 .cse10 (select |v_old(#valid)_AFTER_CALL_20| .cse10)) |v_old(#valid)_AFTER_CALL_20|) (= (select .cse11 .cse10) 1) (= (select v_arrayElimArr_1 v_prenex_16) .cse12) (= (select (store .cse13 v_prenex_16 (select |c_#valid| v_prenex_16)) |c_dll_insert_master_~item~1#1.base|) 1) (= |c_#valid| (store .cse11 v_prenex_19 (select |c_#valid| v_prenex_19))) (not (= v_prenex_16 v_prenex_19)) (= v_DerPreprocessor_64 .cse12))))) (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (exists ((v_DerPreprocessor_58 Int) (v_arrayElimArr_1 (Array Int Int)) (v_prenex_253 (Array Int Int)) (v_prenex_252 Int) (v_prenex_19 Int)) (let ((.cse15 (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_58) |v_dll_create_generic_~#dll~0.base_33| 1) v_prenex_19)) |v_dll_create_generic_~#dll~0.base_33| 1)) (.cse14 (store v_prenex_253 v_prenex_252 1)) (.cse16 (@diff v_arrayElimArr_1 v_prenex_253))) (and (= (select v_arrayElimArr_1 |v_dll_create_generic_~#dll~0.base_33|) 1) (= |c_#valid| (store .cse14 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (select .cse15 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse15 v_prenex_19) 0) (= (store v_arrayElimArr_1 .cse16 (select v_prenex_253 .cse16)) v_prenex_253) (= (select .cse14 .cse16) 1)))) (= (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|) 1))) (exists ((v_arrayElimArr_1 (Array Int Int)) (v_prenex_286 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_287 (Array Int Int)) (v_prenex_19 Int) (v_DerPreprocessor_52 Int)) (let ((.cse17 (store v_prenex_287 v_prenex_286 1)) (.cse18 (@diff v_arrayElimArr_1 v_prenex_287)) (.cse19 (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_52) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) v_prenex_19)) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| (select |c_#valid| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|)))) (and (not (= |v_dll_create_generic_~#dll~0.base_33| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|)) (not (= v_prenex_19 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|)) (= (select .cse17 .cse18) 1) (= |c_#valid| (store .cse17 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (select v_arrayElimArr_1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 1) (= (select .cse19 |c_dll_insert_master_~item~1#1.base|) 1) (= v_prenex_287 (store v_arrayElimArr_1 .cse18 (select v_prenex_287 .cse18))) (= (select .cse19 v_prenex_19) 0) (not (= |v_dll_create_generic_~#dll~0.base_33| v_prenex_19))))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse22 (store v_arrayElimArr_1 v_prenex_19 0))) (let ((.cse20 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse21 (store .cse22 v_prenex_16 (select |c_#valid| v_prenex_16))) (.cse23 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1))) (and (not (= v_prenex_16 |c_dll_insert_master_~item~1#1.base|)) (= (store v_arrayElimArr_1 .cse20 (select |v_old(#valid)_AFTER_CALL_20| .cse20)) |v_old(#valid)_AFTER_CALL_20|) (= (select .cse21 v_prenex_19) 0) (= (select v_arrayElimArr_1 v_prenex_16) 0) (= (select (store (store (store .cse22 v_prenex_16 0) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) v_prenex_16) 0) (= (select .cse23 .cse20) 1) (= (select .cse21 |c_dll_insert_master_~item~1#1.base|) 1) (= |c_#valid| (store .cse23 v_prenex_19 (select |c_#valid| v_prenex_19))))))) (exists ((v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_DerPreprocessor_61 Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse24 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse25 (let ((.cse27 (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|))) (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_61) |v_dll_create_generic_~#dll~0.base_33| .cse27) v_prenex_19)) |v_dll_create_generic_~#dll~0.base_33| .cse27))) (.cse26 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1))) (and (= (store v_arrayElimArr_1 .cse24 (select |v_old(#valid)_AFTER_CALL_20| .cse24)) |v_old(#valid)_AFTER_CALL_20|) (= (select .cse25 v_prenex_19) 0) (= (select .cse26 .cse24) 1) (= (select .cse25 |c_dll_insert_master_~item~1#1.base|) 1) (= |c_#valid| (store .cse26 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (select v_arrayElimArr_1 |v_dll_create_generic_~#dll~0.base_33|) 0) (not (= |v_dll_create_generic_~#dll~0.base_33| |c_dll_insert_master_~item~1#1.base|)) (not (= |v_dll_create_generic_~#dll~0.base_33| v_prenex_19))))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse28 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse29 (store v_arrayElimArr_1 v_prenex_19 0)) (.cse30 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1))) (and (= (store v_arrayElimArr_1 .cse28 (select |v_old(#valid)_AFTER_CALL_20| .cse28)) |v_old(#valid)_AFTER_CALL_20|) (= (select v_arrayElimArr_1 v_prenex_16) 1) (= (select (store (store (store .cse29 v_prenex_16 1) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 1) (= (select .cse30 .cse28) 1) (= (select (store .cse29 v_prenex_16 (select |c_#valid| v_prenex_16)) |c_dll_insert_master_~item~1#1.base|) 1) (= |c_#valid| (store .cse30 v_prenex_19 (select |c_#valid| v_prenex_19))) (not (= v_prenex_16 v_prenex_19))))) (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (= (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|) 1) (exists ((v_arrayElimArr_1 (Array Int Int)) (v_DerPreprocessor_59 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_prenex_253 (Array Int Int)) (v_prenex_252 Int) (v_prenex_19 Int)) (let ((.cse31 (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_59) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| 1) v_prenex_19)) |v_dll_create_generic_~#dll~0.base_33| 1)) (.cse32 (store v_prenex_253 v_prenex_252 1)) (.cse33 (@diff v_arrayElimArr_1 v_prenex_253))) (and (= (select .cse31 v_prenex_19) 0) (= (select .cse31 |c_dll_insert_master_~item~1#1.base|) 1) (= (select v_arrayElimArr_1 |v_dll_create_generic_~#dll~0.base_33|) 1) (= |c_#valid| (store .cse32 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (store v_arrayElimArr_1 .cse33 (select v_prenex_253 .cse33)) v_prenex_253) (= (select .cse32 .cse33) 1)))))) (exists ((v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse34 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1)) (.cse35 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse36 (store v_arrayElimArr_1 v_prenex_19 0))) (and (= |c_#valid| (store .cse34 v_prenex_19 0)) (= (store v_arrayElimArr_1 .cse35 (select |v_old(#valid)_AFTER_CALL_20| .cse35)) |v_old(#valid)_AFTER_CALL_20|) (= (select .cse36 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse34 .cse35) 1) (= (select (store (store .cse36 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) v_prenex_19) 0))))) is different from true [2024-11-19 06:55:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-19 06:55:26,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:27,077 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 22 treesize of output 20 [2024-11-19 06:55:27,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:55:27,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030954246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:27,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:55:27,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 34 [2024-11-19 06:55:27,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559407733] [2024-11-19 06:55:27,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:27,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-19 06:55:27,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:27,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-19 06:55:27,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=757, Unknown=13, NotChecked=366, Total=1260 [2024-11-19 06:55:27,129 INFO L87 Difference]: Start difference. First operand 293 states and 323 transitions. Second operand has 35 states, 30 states have (on average 3.1) internal successors, (93), 30 states have internal predecessors, (93), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-19 06:55:27,920 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse7))) (let ((.cse11 (store |c_old(#valid)| .cse7 .cse8))) (let ((.cse10 (@diff .cse11 |c_#valid|))) (let ((.cse9 (select |c_#valid| .cse10))) (let ((.cse14 (store .cse11 .cse10 .cse9))) (let ((.cse13 (@diff .cse14 |c_#valid|))) (let ((.cse12 (select |c_#valid| .cse13))) (let ((.cse4 (store .cse14 .cse13 .cse12))) (let ((.cse5 (@diff .cse4 |c_#valid|)) (.cse3 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (select |c_#valid| |c_dll_create_generic_~#dll~0.base|)))) (let ((.cse2 (@diff .cse3 |c_#valid|)) (.cse6 (select |c_#valid| .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|)) (.cse0 (= |c_#valid| .cse3))) (and (or .cse0 (= .cse1 .cse2)) (= |c_#valid| (store .cse3 .cse2 (select |c_#valid| .cse2))) (or (= |c_#valid| .cse4) (= (select |c_old(#valid)| .cse5) 0) (= 1 .cse6)) (<= |c_dll_create_generic_~#dll~0.offset| 0) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse7) 0) (= .cse8 1)) (or (= .cse9 1) (= (select |c_old(#valid)| .cse10) 0) (= |c_#valid| .cse11)) (or (= .cse12 1) (= (select |c_old(#valid)| .cse13) 0) (= |c_#valid| .cse14)) (= (select |c_old(#valid)| |c_dll_create_generic_~#dll~0.base|) 0) (= |c_#valid| (store .cse4 .cse5 .cse6)) (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse15 .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse15 (select |c_#valid| .cse15))) (= (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (select |v_#valid_BEFORE_CALL_6| |c_dll_create_generic_~#dll~0.base|)) |v_#valid_BEFORE_CALL_6|)))) .cse0))))))))))))) is different from false [2024-11-19 06:55:27,978 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse7))) (let ((.cse11 (store |c_old(#valid)| .cse7 .cse8))) (let ((.cse10 (@diff .cse11 |c_#valid|))) (let ((.cse9 (select |c_#valid| .cse10))) (let ((.cse14 (store .cse11 .cse10 .cse9))) (let ((.cse13 (@diff .cse14 |c_#valid|))) (let ((.cse12 (select |c_#valid| .cse13))) (let ((.cse4 (store .cse14 .cse13 .cse12))) (let ((.cse5 (@diff .cse4 |c_#valid|)) (.cse3 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (select |c_#valid| |c_dll_create_generic_~#dll~0.base|)))) (let ((.cse2 (@diff .cse3 |c_#valid|)) (.cse6 (select |c_#valid| .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|)) (.cse0 (= |c_#valid| .cse3))) (and (or .cse0 (= .cse1 .cse2)) (= |c_#valid| (store .cse3 .cse2 (select |c_#valid| .cse2))) (or (= |c_#valid| .cse4) (= (select |c_old(#valid)| .cse5) 0) (= 1 .cse6)) (<= |c_dll_create_generic_~#dll~0.offset| 0) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse7) 0) (= .cse8 1)) (or (= .cse9 1) (= (select |c_old(#valid)| .cse10) 0) (= |c_#valid| .cse11)) (or (= .cse12 1) (= (select |c_old(#valid)| .cse13) 0) (= |c_#valid| .cse14)) (= (select |c_old(#valid)| |c_dll_create_generic_~#dll~0.base|) 0) (= |c_#valid| (store .cse4 .cse5 .cse6)) (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse15 .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse15 (select |c_#valid| .cse15))) (= (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (select |v_#valid_BEFORE_CALL_6| |c_dll_create_generic_~#dll~0.base|)) |v_#valid_BEFORE_CALL_6|)))) .cse0))))))))))))) is different from true [2024-11-19 06:55:28,141 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (select |c_#valid| |c_dll_create_generic_~#dll~0.base|)))) (let ((.cse7 (@diff .cse2 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse7))) (let ((.cse4 (store .cse2 .cse7 .cse3))) (let ((.cse6 (@diff .cse4 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (and (let ((.cse1 (exists ((v_arrayElimCell_26 Int)) (= 1 (select |c_#valid| v_arrayElimCell_26))))) (or (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_20|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_20| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (select |v_#valid_BEFORE_CALL_6| |c_dll_create_generic_~#dll~0.base|)) |v_#valid_BEFORE_CALL_6|) (= (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0)) |v_old(#valid)_AFTER_CALL_20|)))) (and .cse1 (= |c_#valid| (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| 1))) (and (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store .cse2 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) .cse1))) (or (= |c_#valid| .cse2) (= .cse3 1)) (or (= |c_#valid| .cse4) (= .cse5 1)) (= (select |c_old(#valid)| |c_dll_create_generic_~#dll~0.base|) 0) (= |c_#valid| (store .cse4 .cse6 .cse5))))))))) is different from false [2024-11-19 06:55:28,145 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (select |c_#valid| |c_dll_create_generic_~#dll~0.base|)))) (let ((.cse7 (@diff .cse2 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse7))) (let ((.cse4 (store .cse2 .cse7 .cse3))) (let ((.cse6 (@diff .cse4 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (and (let ((.cse1 (exists ((v_arrayElimCell_26 Int)) (= 1 (select |c_#valid| v_arrayElimCell_26))))) (or (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_20|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_20| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (select |v_#valid_BEFORE_CALL_6| |c_dll_create_generic_~#dll~0.base|)) |v_#valid_BEFORE_CALL_6|) (= (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0)) |v_old(#valid)_AFTER_CALL_20|)))) (and .cse1 (= |c_#valid| (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| 1))) (and (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store .cse2 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) .cse1))) (or (= |c_#valid| .cse2) (= .cse3 1)) (or (= |c_#valid| .cse4) (= .cse5 1)) (= (select |c_old(#valid)| |c_dll_create_generic_~#dll~0.base|) 0) (= |c_#valid| (store .cse4 .cse6 .cse5))))))))) is different from true [2024-11-19 06:55:28,169 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse10 (store .cse7 .cse6 .cse5))) (let ((.cse9 (@diff .cse10 |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse9))) (let ((.cse0 (store .cse10 .cse9 .cse8))) (let ((.cse1 (@diff .cse0 |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse1))) (and (or (= |c_#valid| .cse0) (= (select |c_old(#valid)| .cse1) 0) (= 1 .cse2)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1)) (or (= .cse5 1) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) (= |c_#valid| .cse10)) (= |c_#valid| (store .cse0 .cse1 .cse2)) (or (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_arrayElimCell_26 Int) (v_DerPreprocessor_2 Int)) (let ((.cse11 (store (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33| v_DerPreprocessor_2) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) (and (= (select .cse11 |v_dll_create_generic_~#dll~0.base_33|) v_DerPreprocessor_2) (= |c_#valid| (store (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|))) (= (select .cse11 v_arrayElimCell_26) 1)))) (= (select |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33|) 0))) (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (let ((.cse12 (store |v_old(#valid)_AFTER_CALL_20| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1)) (.cse13 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_20|))) (and (= (select .cse12 .cse13) 1) (= (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33| (select |v_#valid_BEFORE_CALL_6| |v_dll_create_generic_~#dll~0.base_33|)) |v_#valid_BEFORE_CALL_6|) (= |c_#valid| (store .cse12 |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|))) (= (store |v_#valid_BEFORE_CALL_6| .cse13 (select |v_old(#valid)_AFTER_CALL_20| .cse13)) |v_old(#valid)_AFTER_CALL_20|)))) (= (select |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33|) 0))) (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (= |c_#valid| (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|))) (exists ((v_arrayElimCell_26 Int)) (= (select (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33| 1) v_arrayElimCell_26) 1)) (= (select |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33|) 0)))))))))))))))) is different from false [2024-11-19 06:55:28,182 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse10 (store .cse7 .cse6 .cse5))) (let ((.cse9 (@diff .cse10 |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse9))) (let ((.cse0 (store .cse10 .cse9 .cse8))) (let ((.cse1 (@diff .cse0 |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse1))) (and (or (= |c_#valid| .cse0) (= (select |c_old(#valid)| .cse1) 0) (= 1 .cse2)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1)) (or (= .cse5 1) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) (= |c_#valid| .cse10)) (= |c_#valid| (store .cse0 .cse1 .cse2)) (or (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_arrayElimCell_26 Int) (v_DerPreprocessor_2 Int)) (let ((.cse11 (store (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33| v_DerPreprocessor_2) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) (and (= (select .cse11 |v_dll_create_generic_~#dll~0.base_33|) v_DerPreprocessor_2) (= |c_#valid| (store (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|))) (= (select .cse11 v_arrayElimCell_26) 1)))) (= (select |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33|) 0))) (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (let ((.cse12 (store |v_old(#valid)_AFTER_CALL_20| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1)) (.cse13 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_20|))) (and (= (select .cse12 .cse13) 1) (= (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33| (select |v_#valid_BEFORE_CALL_6| |v_dll_create_generic_~#dll~0.base_33|)) |v_#valid_BEFORE_CALL_6|) (= |c_#valid| (store .cse12 |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|))) (= (store |v_#valid_BEFORE_CALL_6| .cse13 (select |v_old(#valid)_AFTER_CALL_20| .cse13)) |v_old(#valid)_AFTER_CALL_20|)))) (= (select |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33|) 0))) (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (= |c_#valid| (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|))) (exists ((v_arrayElimCell_26 Int)) (= (select (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33| 1) v_arrayElimCell_26) 1)) (= (select |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_33|) 0)))))))))))))))) is different from true [2024-11-19 06:55:28,190 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_dll_insert_master_~item~1#1.base|) 1))) (and .cse0 (or (exists ((v_prenex_281 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_280 Int)) (let ((.cse2 (store v_prenex_281 v_prenex_280 1)) (.cse1 (@diff v_arrayElimArr_1 v_prenex_281))) (and (= v_prenex_281 (store v_arrayElimArr_1 .cse1 (select v_prenex_281 .cse1))) (= |c_#valid| (store .cse2 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 0)) (= (select v_arrayElimArr_1 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse2 .cse1) 1) (= (select (store (store v_arrayElimArr_1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 1) (not (= |c_dll_insert_master_~item~1#1.base| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|))))) (exists ((v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|v_dll_create_generic_~#dll~0.base_33| Int)) (let ((.cse3 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1)) (.cse4 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|))) (and (= |c_#valid| (store .cse3 |v_dll_create_generic_~#dll~0.base_33| 0)) (= (store v_arrayElimArr_1 .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4)) |v_old(#valid)_AFTER_CALL_20|) (= (select v_arrayElimArr_1 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse3 .cse4) 1) (not (= |v_dll_create_generic_~#dll~0.base_33| |c_dll_insert_master_~item~1#1.base|))))) (exists ((v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse6 (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) (.cse5 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse7 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1))) (and (= (store v_arrayElimArr_1 .cse5 (select |v_old(#valid)_AFTER_CALL_20| .cse5)) |v_old(#valid)_AFTER_CALL_20|) (= .cse6 (select v_arrayElimArr_1 |v_dll_create_generic_~#dll~0.base_33|)) (= (select (store (store v_arrayElimArr_1 v_prenex_19 0) |v_dll_create_generic_~#dll~0.base_33| .cse6) |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse7 .cse5) 1) (= |c_#valid| (store .cse7 v_prenex_19 (select |c_#valid| v_prenex_19))) (not (= |v_dll_create_generic_~#dll~0.base_33| |c_dll_insert_master_~item~1#1.base|)) (not (= |v_dll_create_generic_~#dll~0.base_33| v_prenex_19))))) .cse0 (exists ((v_DerPreprocessor_56 Int) (v_prenex_281 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_280 Int) (v_prenex_19 Int)) (let ((.cse9 (store v_prenex_281 v_prenex_280 1)) (.cse8 (@diff v_arrayElimArr_1 v_prenex_281)) (.cse10 (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_56) |v_dll_create_generic_~#dll~0.base_33| 0) v_prenex_19)) |v_dll_create_generic_~#dll~0.base_33| 0))) (and (= v_prenex_281 (store v_arrayElimArr_1 .cse8 (select v_prenex_281 .cse8))) (= |c_#valid| (store .cse9 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (select .cse9 .cse8) 1) (= (select .cse10 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse10 v_prenex_19) 0) (= (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|) 0) (not (= |v_dll_create_generic_~#dll~0.base_33| v_prenex_19))))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_DerPreprocessor_64 Int) (v_prenex_19 Int)) (let ((.cse14 (store v_arrayElimArr_1 v_prenex_19 0))) (let ((.cse11 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse12 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1)) (.cse13 (select (store (store (store .cse14 v_prenex_16 v_DerPreprocessor_64) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) v_prenex_16))) (and (not (= v_prenex_16 |c_dll_insert_master_~item~1#1.base|)) (= (store v_arrayElimArr_1 .cse11 (select |v_old(#valid)_AFTER_CALL_20| .cse11)) |v_old(#valid)_AFTER_CALL_20|) (= (select .cse12 .cse11) 1) (= (select v_arrayElimArr_1 v_prenex_16) .cse13) (= (select (store .cse14 v_prenex_16 (select |c_#valid| v_prenex_16)) |c_dll_insert_master_~item~1#1.base|) 1) (= |c_#valid| (store .cse12 v_prenex_19 (select |c_#valid| v_prenex_19))) (not (= v_prenex_16 v_prenex_19)) (= v_DerPreprocessor_64 .cse13))))) (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (exists ((v_DerPreprocessor_58 Int) (v_arrayElimArr_1 (Array Int Int)) (v_prenex_253 (Array Int Int)) (v_prenex_252 Int) (v_prenex_19 Int)) (let ((.cse16 (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_58) |v_dll_create_generic_~#dll~0.base_33| 1) v_prenex_19)) |v_dll_create_generic_~#dll~0.base_33| 1)) (.cse15 (store v_prenex_253 v_prenex_252 1)) (.cse17 (@diff v_arrayElimArr_1 v_prenex_253))) (and (= (select v_arrayElimArr_1 |v_dll_create_generic_~#dll~0.base_33|) 1) (= |c_#valid| (store .cse15 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (select .cse16 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse16 v_prenex_19) 0) (= (store v_arrayElimArr_1 .cse17 (select v_prenex_253 .cse17)) v_prenex_253) (= (select .cse15 .cse17) 1)))) (= (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|) 1))) (exists ((v_arrayElimArr_1 (Array Int Int)) (v_prenex_286 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_287 (Array Int Int)) (v_prenex_19 Int) (v_DerPreprocessor_52 Int)) (let ((.cse18 (store v_prenex_287 v_prenex_286 1)) (.cse19 (@diff v_arrayElimArr_1 v_prenex_287)) (.cse20 (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_52) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) v_prenex_19)) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| (select |c_#valid| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|)))) (and (not (= |v_dll_create_generic_~#dll~0.base_33| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|)) (not (= v_prenex_19 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|)) (= (select .cse18 .cse19) 1) (= |c_#valid| (store .cse18 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (select v_arrayElimArr_1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 1) (= (select .cse20 |c_dll_insert_master_~item~1#1.base|) 1) (= v_prenex_287 (store v_arrayElimArr_1 .cse19 (select v_prenex_287 .cse19))) (= (select .cse20 v_prenex_19) 0) (not (= |v_dll_create_generic_~#dll~0.base_33| v_prenex_19))))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse23 (store v_arrayElimArr_1 v_prenex_19 0))) (let ((.cse21 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse22 (store .cse23 v_prenex_16 (select |c_#valid| v_prenex_16))) (.cse24 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1))) (and (not (= v_prenex_16 |c_dll_insert_master_~item~1#1.base|)) (= (store v_arrayElimArr_1 .cse21 (select |v_old(#valid)_AFTER_CALL_20| .cse21)) |v_old(#valid)_AFTER_CALL_20|) (= (select .cse22 v_prenex_19) 0) (= (select v_arrayElimArr_1 v_prenex_16) 0) (= (select (store (store (store .cse23 v_prenex_16 0) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) v_prenex_16) 0) (= (select .cse24 .cse21) 1) (= (select .cse22 |c_dll_insert_master_~item~1#1.base|) 1) (= |c_#valid| (store .cse24 v_prenex_19 (select |c_#valid| v_prenex_19))))))) (exists ((v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_DerPreprocessor_61 Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse25 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse26 (let ((.cse28 (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|))) (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_61) |v_dll_create_generic_~#dll~0.base_33| .cse28) v_prenex_19)) |v_dll_create_generic_~#dll~0.base_33| .cse28))) (.cse27 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1))) (and (= (store v_arrayElimArr_1 .cse25 (select |v_old(#valid)_AFTER_CALL_20| .cse25)) |v_old(#valid)_AFTER_CALL_20|) (= (select .cse26 v_prenex_19) 0) (= (select .cse27 .cse25) 1) (= (select .cse26 |c_dll_insert_master_~item~1#1.base|) 1) (= |c_#valid| (store .cse27 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (select v_arrayElimArr_1 |v_dll_create_generic_~#dll~0.base_33|) 0) (not (= |v_dll_create_generic_~#dll~0.base_33| |c_dll_insert_master_~item~1#1.base|)) (not (= |v_dll_create_generic_~#dll~0.base_33| v_prenex_19))))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse29 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse30 (store v_arrayElimArr_1 v_prenex_19 0)) (.cse31 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1))) (and (= (store v_arrayElimArr_1 .cse29 (select |v_old(#valid)_AFTER_CALL_20| .cse29)) |v_old(#valid)_AFTER_CALL_20|) (= (select v_arrayElimArr_1 v_prenex_16) 1) (= (select (store (store (store .cse30 v_prenex_16 1) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 1) (= (select .cse31 .cse29) 1) (= (select (store .cse30 v_prenex_16 (select |c_#valid| v_prenex_16)) |c_dll_insert_master_~item~1#1.base|) 1) (= |c_#valid| (store .cse31 v_prenex_19 (select |c_#valid| v_prenex_19))) (not (= v_prenex_16 v_prenex_19))))) (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (= (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|) 1) (exists ((v_arrayElimArr_1 (Array Int Int)) (v_DerPreprocessor_59 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_prenex_253 (Array Int Int)) (v_prenex_252 Int) (v_prenex_19 Int)) (let ((.cse32 (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_59) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| 1) v_prenex_19)) |v_dll_create_generic_~#dll~0.base_33| 1)) (.cse33 (store v_prenex_253 v_prenex_252 1)) (.cse34 (@diff v_arrayElimArr_1 v_prenex_253))) (and (= (select .cse32 v_prenex_19) 0) (= (select .cse32 |c_dll_insert_master_~item~1#1.base|) 1) (= (select v_arrayElimArr_1 |v_dll_create_generic_~#dll~0.base_33|) 1) (= |c_#valid| (store .cse33 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (store v_arrayElimArr_1 .cse34 (select v_prenex_253 .cse34)) v_prenex_253) (= (select .cse33 .cse34) 1)))))) (exists ((v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse35 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1)) (.cse36 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse37 (store v_arrayElimArr_1 v_prenex_19 0))) (and (= |c_#valid| (store .cse35 v_prenex_19 0)) (= (store v_arrayElimArr_1 .cse36 (select |v_old(#valid)_AFTER_CALL_20| .cse36)) |v_old(#valid)_AFTER_CALL_20|) (= (select .cse37 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse35 .cse36) 1) (= (select (store (store .cse37 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) v_prenex_19) 0))))))) is different from false [2024-11-19 06:55:28,197 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_dll_insert_master_~item~1#1.base|) 1))) (and .cse0 (or (exists ((v_prenex_281 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_280 Int)) (let ((.cse2 (store v_prenex_281 v_prenex_280 1)) (.cse1 (@diff v_arrayElimArr_1 v_prenex_281))) (and (= v_prenex_281 (store v_arrayElimArr_1 .cse1 (select v_prenex_281 .cse1))) (= |c_#valid| (store .cse2 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 0)) (= (select v_arrayElimArr_1 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse2 .cse1) 1) (= (select (store (store v_arrayElimArr_1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 1) (not (= |c_dll_insert_master_~item~1#1.base| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|))))) (exists ((v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|v_dll_create_generic_~#dll~0.base_33| Int)) (let ((.cse3 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1)) (.cse4 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|))) (and (= |c_#valid| (store .cse3 |v_dll_create_generic_~#dll~0.base_33| 0)) (= (store v_arrayElimArr_1 .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4)) |v_old(#valid)_AFTER_CALL_20|) (= (select v_arrayElimArr_1 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse3 .cse4) 1) (not (= |v_dll_create_generic_~#dll~0.base_33| |c_dll_insert_master_~item~1#1.base|))))) (exists ((v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse6 (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) (.cse5 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse7 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1))) (and (= (store v_arrayElimArr_1 .cse5 (select |v_old(#valid)_AFTER_CALL_20| .cse5)) |v_old(#valid)_AFTER_CALL_20|) (= .cse6 (select v_arrayElimArr_1 |v_dll_create_generic_~#dll~0.base_33|)) (= (select (store (store v_arrayElimArr_1 v_prenex_19 0) |v_dll_create_generic_~#dll~0.base_33| .cse6) |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse7 .cse5) 1) (= |c_#valid| (store .cse7 v_prenex_19 (select |c_#valid| v_prenex_19))) (not (= |v_dll_create_generic_~#dll~0.base_33| |c_dll_insert_master_~item~1#1.base|)) (not (= |v_dll_create_generic_~#dll~0.base_33| v_prenex_19))))) .cse0 (exists ((v_DerPreprocessor_56 Int) (v_prenex_281 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_280 Int) (v_prenex_19 Int)) (let ((.cse9 (store v_prenex_281 v_prenex_280 1)) (.cse8 (@diff v_arrayElimArr_1 v_prenex_281)) (.cse10 (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_56) |v_dll_create_generic_~#dll~0.base_33| 0) v_prenex_19)) |v_dll_create_generic_~#dll~0.base_33| 0))) (and (= v_prenex_281 (store v_arrayElimArr_1 .cse8 (select v_prenex_281 .cse8))) (= |c_#valid| (store .cse9 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (select .cse9 .cse8) 1) (= (select .cse10 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse10 v_prenex_19) 0) (= (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|) 0) (not (= |v_dll_create_generic_~#dll~0.base_33| v_prenex_19))))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_DerPreprocessor_64 Int) (v_prenex_19 Int)) (let ((.cse14 (store v_arrayElimArr_1 v_prenex_19 0))) (let ((.cse11 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse12 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1)) (.cse13 (select (store (store (store .cse14 v_prenex_16 v_DerPreprocessor_64) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) v_prenex_16))) (and (not (= v_prenex_16 |c_dll_insert_master_~item~1#1.base|)) (= (store v_arrayElimArr_1 .cse11 (select |v_old(#valid)_AFTER_CALL_20| .cse11)) |v_old(#valid)_AFTER_CALL_20|) (= (select .cse12 .cse11) 1) (= (select v_arrayElimArr_1 v_prenex_16) .cse13) (= (select (store .cse14 v_prenex_16 (select |c_#valid| v_prenex_16)) |c_dll_insert_master_~item~1#1.base|) 1) (= |c_#valid| (store .cse12 v_prenex_19 (select |c_#valid| v_prenex_19))) (not (= v_prenex_16 v_prenex_19)) (= v_DerPreprocessor_64 .cse13))))) (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (exists ((v_DerPreprocessor_58 Int) (v_arrayElimArr_1 (Array Int Int)) (v_prenex_253 (Array Int Int)) (v_prenex_252 Int) (v_prenex_19 Int)) (let ((.cse16 (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_58) |v_dll_create_generic_~#dll~0.base_33| 1) v_prenex_19)) |v_dll_create_generic_~#dll~0.base_33| 1)) (.cse15 (store v_prenex_253 v_prenex_252 1)) (.cse17 (@diff v_arrayElimArr_1 v_prenex_253))) (and (= (select v_arrayElimArr_1 |v_dll_create_generic_~#dll~0.base_33|) 1) (= |c_#valid| (store .cse15 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (select .cse16 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse16 v_prenex_19) 0) (= (store v_arrayElimArr_1 .cse17 (select v_prenex_253 .cse17)) v_prenex_253) (= (select .cse15 .cse17) 1)))) (= (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|) 1))) (exists ((v_arrayElimArr_1 (Array Int Int)) (v_prenex_286 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_287 (Array Int Int)) (v_prenex_19 Int) (v_DerPreprocessor_52 Int)) (let ((.cse18 (store v_prenex_287 v_prenex_286 1)) (.cse19 (@diff v_arrayElimArr_1 v_prenex_287)) (.cse20 (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_52) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) v_prenex_19)) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| (select |c_#valid| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|)))) (and (not (= |v_dll_create_generic_~#dll~0.base_33| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|)) (not (= v_prenex_19 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|)) (= (select .cse18 .cse19) 1) (= |c_#valid| (store .cse18 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (select v_arrayElimArr_1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 1) (= (select .cse20 |c_dll_insert_master_~item~1#1.base|) 1) (= v_prenex_287 (store v_arrayElimArr_1 .cse19 (select v_prenex_287 .cse19))) (= (select .cse20 v_prenex_19) 0) (not (= |v_dll_create_generic_~#dll~0.base_33| v_prenex_19))))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse23 (store v_arrayElimArr_1 v_prenex_19 0))) (let ((.cse21 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse22 (store .cse23 v_prenex_16 (select |c_#valid| v_prenex_16))) (.cse24 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1))) (and (not (= v_prenex_16 |c_dll_insert_master_~item~1#1.base|)) (= (store v_arrayElimArr_1 .cse21 (select |v_old(#valid)_AFTER_CALL_20| .cse21)) |v_old(#valid)_AFTER_CALL_20|) (= (select .cse22 v_prenex_19) 0) (= (select v_arrayElimArr_1 v_prenex_16) 0) (= (select (store (store (store .cse23 v_prenex_16 0) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) v_prenex_16) 0) (= (select .cse24 .cse21) 1) (= (select .cse22 |c_dll_insert_master_~item~1#1.base|) 1) (= |c_#valid| (store .cse24 v_prenex_19 (select |c_#valid| v_prenex_19))))))) (exists ((v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_DerPreprocessor_61 Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse25 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse26 (let ((.cse28 (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|))) (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_61) |v_dll_create_generic_~#dll~0.base_33| .cse28) v_prenex_19)) |v_dll_create_generic_~#dll~0.base_33| .cse28))) (.cse27 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1))) (and (= (store v_arrayElimArr_1 .cse25 (select |v_old(#valid)_AFTER_CALL_20| .cse25)) |v_old(#valid)_AFTER_CALL_20|) (= (select .cse26 v_prenex_19) 0) (= (select .cse27 .cse25) 1) (= (select .cse26 |c_dll_insert_master_~item~1#1.base|) 1) (= |c_#valid| (store .cse27 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (select v_arrayElimArr_1 |v_dll_create_generic_~#dll~0.base_33|) 0) (not (= |v_dll_create_generic_~#dll~0.base_33| |c_dll_insert_master_~item~1#1.base|)) (not (= |v_dll_create_generic_~#dll~0.base_33| v_prenex_19))))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse29 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse30 (store v_arrayElimArr_1 v_prenex_19 0)) (.cse31 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1))) (and (= (store v_arrayElimArr_1 .cse29 (select |v_old(#valid)_AFTER_CALL_20| .cse29)) |v_old(#valid)_AFTER_CALL_20|) (= (select v_arrayElimArr_1 v_prenex_16) 1) (= (select (store (store (store .cse30 v_prenex_16 1) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 1) (= (select .cse31 .cse29) 1) (= (select (store .cse30 v_prenex_16 (select |c_#valid| v_prenex_16)) |c_dll_insert_master_~item~1#1.base|) 1) (= |c_#valid| (store .cse31 v_prenex_19 (select |c_#valid| v_prenex_19))) (not (= v_prenex_16 v_prenex_19))))) (exists ((|v_dll_create_generic_~#dll~0.base_33| Int)) (and (= (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|) 1) (exists ((v_arrayElimArr_1 (Array Int Int)) (v_DerPreprocessor_59 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_prenex_253 (Array Int Int)) (v_prenex_252 Int) (v_prenex_19 Int)) (let ((.cse32 (store (store v_arrayElimArr_1 v_prenex_19 (select (store (store (store v_arrayElimArr_1 v_prenex_19 v_DerPreprocessor_59) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| 1) v_prenex_19)) |v_dll_create_generic_~#dll~0.base_33| 1)) (.cse33 (store v_prenex_253 v_prenex_252 1)) (.cse34 (@diff v_arrayElimArr_1 v_prenex_253))) (and (= (select .cse32 v_prenex_19) 0) (= (select .cse32 |c_dll_insert_master_~item~1#1.base|) 1) (= (select v_arrayElimArr_1 |v_dll_create_generic_~#dll~0.base_33|) 1) (= |c_#valid| (store .cse33 v_prenex_19 (select |c_#valid| v_prenex_19))) (= (store v_arrayElimArr_1 .cse34 (select v_prenex_253 .cse34)) v_prenex_253) (= (select .cse33 .cse34) 1)))))) (exists ((v_prenex_18 Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_33| Int) (v_prenex_19 Int)) (let ((.cse35 (store |v_old(#valid)_AFTER_CALL_20| v_prenex_18 1)) (.cse36 (@diff v_arrayElimArr_1 |v_old(#valid)_AFTER_CALL_20|)) (.cse37 (store v_arrayElimArr_1 v_prenex_19 0))) (and (= |c_#valid| (store .cse35 v_prenex_19 0)) (= (store v_arrayElimArr_1 .cse36 (select |v_old(#valid)_AFTER_CALL_20| .cse36)) |v_old(#valid)_AFTER_CALL_20|) (= (select .cse37 |c_dll_insert_master_~item~1#1.base|) 1) (= (select .cse35 .cse36) 1) (= (select (store (store .cse37 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_33| (select |c_#valid| |v_dll_create_generic_~#dll~0.base_33|)) v_prenex_19) 0))))))) is different from true [2024-11-19 06:55:29,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:29,609 INFO L93 Difference]: Finished difference Result 307 states and 339 transitions. [2024-11-19 06:55:29,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 06:55:29,609 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 3.1) internal successors, (93), 30 states have internal predecessors, (93), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 65 [2024-11-19 06:55:29,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:29,611 INFO L225 Difference]: With dead ends: 307 [2024-11-19 06:55:29,611 INFO L226 Difference]: Without dead ends: 307 [2024-11-19 06:55:29,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=204, Invalid=1375, Unknown=21, NotChecked=850, Total=2450 [2024-11-19 06:55:29,613 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 211 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 2638 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 4892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2190 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:29,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1764 Invalid, 4892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2638 Invalid, 0 Unknown, 2190 Unchecked, 1.9s Time] [2024-11-19 06:55:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-19 06:55:29,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2024-11-19 06:55:29,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 187 states have (on average 1.5561497326203209) internal successors, (291), 280 states have internal predecessors, (291), 28 states have call successors, (28), 11 states have call predecessors, (28), 10 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2024-11-19 06:55:29,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 335 transitions. [2024-11-19 06:55:29,621 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 335 transitions. Word has length 65 [2024-11-19 06:55:29,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:29,621 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 335 transitions. [2024-11-19 06:55:29,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 3.1) internal successors, (93), 30 states have internal predecessors, (93), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-19 06:55:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 335 transitions. [2024-11-19 06:55:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 06:55:29,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:29,626 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:29,647 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-11-19 06:55:29,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:29,826 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting dll_insert_masterErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2024-11-19 06:55:29,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:29,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1358928088, now seen corresponding path program 1 times [2024-11-19 06:55:29,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:29,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815606477] [2024-11-19 06:55:29,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:29,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:30,954 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:55:30,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:30,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815606477] [2024-11-19 06:55:30,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815606477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:30,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640259284] [2024-11-19 06:55:30,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:55:30,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:30,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:30,958 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-11-19 06:55:30,959 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-11-19 06:55:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:55:31,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-19 06:55:31,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:31,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:55:31,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-19 06:55:31,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-19 06:55:31,597 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-11-19 06:55:31,755 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 74 treesize of output 46 [2024-11-19 06:55:31,774 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2024-11-19 06:55:31,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 43 [2024-11-19 06:55:31,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-19 06:55:32,183 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 74 treesize of output 46