./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 13180db7de3a8489ee06ea96825d5be5d06449dd3c867f58676a7914255b860c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:27:12,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:27:12,653 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 08:27:12,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:27:12,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:27:12,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:27:12,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:27:12,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:27:12,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:27:12,686 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:27:12,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:27:12,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:27:12,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:27:12,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:27:12,687 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:27:12,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:27:12,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:27:12,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:27:12,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:27:12,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:27:12,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:27:12,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:27:12,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:27:12,688 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:27:12,689 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:27:12,689 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:27:12,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:27:12,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:27:12,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:27:12,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:27:12,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:27:12,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:27:12,690 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:27:12,690 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:27:12,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:27:12,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:27:12,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:27:12,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:27:12,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:27:12,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:27:12,690 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13180db7de3a8489ee06ea96825d5be5d06449dd3c867f58676a7914255b860c [2025-02-06 08:27:12,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:27:12,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:27:12,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:27:12,948 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:27:12,948 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:27:12,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2025-02-06 08:27:14,114 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be3f3b2d9/8c26d6421d9646ee89ba0872270da0d9/FLAGfa7ac05fe [2025-02-06 08:27:14,751 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:27:14,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2025-02-06 08:27:14,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be3f3b2d9/8c26d6421d9646ee89ba0872270da0d9/FLAGfa7ac05fe [2025-02-06 08:27:15,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be3f3b2d9/8c26d6421d9646ee89ba0872270da0d9 [2025-02-06 08:27:15,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:27:15,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:27:15,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:27:15,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:27:15,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:27:15,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:27:15" (1/1) ... [2025-02-06 08:27:15,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e2080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:27:15, skipping insertion in model container [2025-02-06 08:27:15,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:27:15" (1/1) ... [2025-02-06 08:27:15,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:27:18,421 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400642,400655] [2025-02-06 08:27:18,424 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400787,400800] [2025-02-06 08:27:18,425 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400933,400946] [2025-02-06 08:27:18,425 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401098,401111] [2025-02-06 08:27:18,426 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401256,401269] [2025-02-06 08:27:18,426 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401414,401427] [2025-02-06 08:27:18,426 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401572,401585] [2025-02-06 08:27:18,430 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401732,401745] [2025-02-06 08:27:18,430 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401891,401904] [2025-02-06 08:27:18,430 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402030,402043] [2025-02-06 08:27:18,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402172,402185] [2025-02-06 08:27:18,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402321,402334] [2025-02-06 08:27:18,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402460,402473] [2025-02-06 08:27:18,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402615,402628] [2025-02-06 08:27:18,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402775,402788] [2025-02-06 08:27:18,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402926,402939] [2025-02-06 08:27:18,432 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403077,403090] [2025-02-06 08:27:18,432 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403229,403242] [2025-02-06 08:27:18,432 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403378,403391] [2025-02-06 08:27:18,432 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403526,403539] [2025-02-06 08:27:18,432 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403683,403696] [2025-02-06 08:27:18,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403832,403845] [2025-02-06 08:27:18,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403988,404001] [2025-02-06 08:27:18,436 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404141,404154] [2025-02-06 08:27:18,436 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404287,404300] [2025-02-06 08:27:18,436 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404430,404443] [2025-02-06 08:27:18,437 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404582,404595] [2025-02-06 08:27:18,437 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404728,404741] [2025-02-06 08:27:18,437 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404873,404886] [2025-02-06 08:27:18,437 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405027,405040] [2025-02-06 08:27:18,437 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405178,405191] [2025-02-06 08:27:18,437 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405333,405346] [2025-02-06 08:27:18,438 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405485,405498] [2025-02-06 08:27:18,438 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405640,405653] [2025-02-06 08:27:18,438 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405804,405817] [2025-02-06 08:27:18,438 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405960,405973] [2025-02-06 08:27:18,438 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406124,406137] [2025-02-06 08:27:18,438 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406266,406279] [2025-02-06 08:27:18,438 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406424,406437] [2025-02-06 08:27:18,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406591,406604] [2025-02-06 08:27:18,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406750,406763] [2025-02-06 08:27:18,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406909,406922] [2025-02-06 08:27:18,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407058,407071] [2025-02-06 08:27:18,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407205,407218] [2025-02-06 08:27:18,440 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2025-02-06 08:27:18,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2025-02-06 08:27:18,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2025-02-06 08:27:18,442 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407837,407850] [2025-02-06 08:27:18,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408002,408015] [2025-02-06 08:27:18,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2025-02-06 08:27:18,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2025-02-06 08:27:18,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2025-02-06 08:27:18,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2025-02-06 08:27:18,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2025-02-06 08:27:18,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2025-02-06 08:27:18,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2025-02-06 08:27:18,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2025-02-06 08:27:18,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2025-02-06 08:27:18,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2025-02-06 08:27:18,446 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2025-02-06 08:27:18,446 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2025-02-06 08:27:18,446 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2025-02-06 08:27:18,446 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2025-02-06 08:27:18,446 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2025-02-06 08:27:18,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2025-02-06 08:27:18,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2025-02-06 08:27:18,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2025-02-06 08:27:18,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2025-02-06 08:27:18,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2025-02-06 08:27:18,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2025-02-06 08:27:18,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2025-02-06 08:27:18,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2025-02-06 08:27:18,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2025-02-06 08:27:18,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2025-02-06 08:27:18,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2025-02-06 08:27:18,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2025-02-06 08:27:18,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2025-02-06 08:27:18,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2025-02-06 08:27:18,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412570,412583] [2025-02-06 08:27:18,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412736,412749] [2025-02-06 08:27:18,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412905,412918] [2025-02-06 08:27:18,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413072,413085] [2025-02-06 08:27:18,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413240,413253] [2025-02-06 08:27:18,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413390,413403] [2025-02-06 08:27:18,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413537,413550] [2025-02-06 08:27:18,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2025-02-06 08:27:18,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2025-02-06 08:27:18,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2025-02-06 08:27:18,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:27:18,493 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:27:18,605 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; cmpxchgb %2,%1": "=a" (__ret), "+m" (*__ptr): "q" (__new), "0" (__old): "memory"); [7080-7081] [2025-02-06 08:27:18,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; cmpxchgw %2,%1": "=a" (__ret), "+m" (*__ptr___0): "r" (__new), "0" (__old): "memory"); [7085-7086] [2025-02-06 08:27:18,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; cmpxchgl %2,%1": "=a" (__ret), "+m" (*__ptr___1): "r" (__new), "0" (__old): "memory"); [7090-7091] [2025-02-06 08:27:18,607 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; cmpxchgq %2,%1": "=a" (__ret), "+m" (*__ptr___2): "r" (__new), "0" (__old): "memory"); [7095-7096] [2025-02-06 08:27:18,623 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/net/netns/generic.h"), "i" (41), "i" (12UL)); [7547-7548] [2025-02-06 08:27:18,623 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/net/netns/generic.h"), "i" (41), "i" (12UL)); [7557-7558] [2025-02-06 08:27:18,624 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/net/netns/generic.h"), "i" (45), "i" (12UL)); [7571-7572] [2025-02-06 08:27:18,642 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"net/netfilter/nfnetlink_log.c"), "i" (581), "i" (12UL)); [8504-8505] [2025-02-06 08:27:18,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400642,400655] [2025-02-06 08:27:18,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400787,400800] [2025-02-06 08:27:18,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400933,400946] [2025-02-06 08:27:18,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401098,401111] [2025-02-06 08:27:18,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401256,401269] [2025-02-06 08:27:18,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401414,401427] [2025-02-06 08:27:18,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401572,401585] [2025-02-06 08:27:18,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401732,401745] [2025-02-06 08:27:18,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401891,401904] [2025-02-06 08:27:18,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402030,402043] [2025-02-06 08:27:18,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402172,402185] [2025-02-06 08:27:18,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402321,402334] [2025-02-06 08:27:18,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402460,402473] [2025-02-06 08:27:18,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402615,402628] [2025-02-06 08:27:18,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402775,402788] [2025-02-06 08:27:18,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402926,402939] [2025-02-06 08:27:18,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403077,403090] [2025-02-06 08:27:18,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403229,403242] [2025-02-06 08:27:18,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403378,403391] [2025-02-06 08:27:18,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403526,403539] [2025-02-06 08:27:18,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403683,403696] [2025-02-06 08:27:18,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403832,403845] [2025-02-06 08:27:18,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403988,404001] [2025-02-06 08:27:18,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404141,404154] [2025-02-06 08:27:18,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404287,404300] [2025-02-06 08:27:18,733 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404430,404443] [2025-02-06 08:27:18,733 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404582,404595] [2025-02-06 08:27:18,733 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404728,404741] [2025-02-06 08:27:18,733 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404873,404886] [2025-02-06 08:27:18,733 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405027,405040] [2025-02-06 08:27:18,734 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405178,405191] [2025-02-06 08:27:18,734 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405333,405346] [2025-02-06 08:27:18,734 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405485,405498] [2025-02-06 08:27:18,734 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405640,405653] [2025-02-06 08:27:18,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405804,405817] [2025-02-06 08:27:18,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405960,405973] [2025-02-06 08:27:18,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406124,406137] [2025-02-06 08:27:18,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406266,406279] [2025-02-06 08:27:18,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406424,406437] [2025-02-06 08:27:18,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406591,406604] [2025-02-06 08:27:18,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406750,406763] [2025-02-06 08:27:18,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406909,406922] [2025-02-06 08:27:18,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407058,407071] [2025-02-06 08:27:18,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407205,407218] [2025-02-06 08:27:18,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2025-02-06 08:27:18,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2025-02-06 08:27:18,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2025-02-06 08:27:18,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407837,407850] [2025-02-06 08:27:18,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408002,408015] [2025-02-06 08:27:18,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2025-02-06 08:27:18,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2025-02-06 08:27:18,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2025-02-06 08:27:18,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2025-02-06 08:27:18,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2025-02-06 08:27:18,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2025-02-06 08:27:18,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2025-02-06 08:27:18,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2025-02-06 08:27:18,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2025-02-06 08:27:18,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2025-02-06 08:27:18,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2025-02-06 08:27:18,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2025-02-06 08:27:18,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2025-02-06 08:27:18,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2025-02-06 08:27:18,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2025-02-06 08:27:18,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2025-02-06 08:27:18,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2025-02-06 08:27:18,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2025-02-06 08:27:18,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2025-02-06 08:27:18,741 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2025-02-06 08:27:18,741 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2025-02-06 08:27:18,741 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2025-02-06 08:27:18,741 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2025-02-06 08:27:18,741 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2025-02-06 08:27:18,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2025-02-06 08:27:18,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2025-02-06 08:27:18,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2025-02-06 08:27:18,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2025-02-06 08:27:18,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2025-02-06 08:27:18,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412570,412583] [2025-02-06 08:27:18,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412736,412749] [2025-02-06 08:27:18,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412905,412918] [2025-02-06 08:27:18,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413072,413085] [2025-02-06 08:27:18,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413240,413253] [2025-02-06 08:27:18,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413390,413403] [2025-02-06 08:27:18,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413537,413550] [2025-02-06 08:27:18,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2025-02-06 08:27:18,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2025-02-06 08:27:18,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2025-02-06 08:27:18,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:27:18,864 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: __cmpxchg_wrong_size [2025-02-06 08:27:18,869 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:27:18,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:27:18 WrapperNode [2025-02-06 08:27:18,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:27:18,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:27:18,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:27:18,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:27:18,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:27:18" (1/1) ... [2025-02-06 08:27:18,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:27:18" (1/1) ... [2025-02-06 08:27:19,053 INFO L138 Inliner]: procedures = 618, calls = 1465, calls flagged for inlining = 276, calls inlined = 181, statements flattened = 2717 [2025-02-06 08:27:19,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:27:19,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:27:19,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:27:19,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:27:19,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:27:18" (1/1) ... [2025-02-06 08:27:19,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:27:18" (1/1) ... [2025-02-06 08:27:19,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:27:18" (1/1) ... [2025-02-06 08:27:19,333 INFO L175 MemorySlicer]: Split 248 memory accesses to 24 slices as follows [16, 6, 103, 4, 31, 7, 4, 2, 4, 10, 12, 1, 3, 1, 1, 8, 2, 1, 1, 4, 1, 19, 3, 4]. 42 percent of accesses are in the largest equivalence class. The 36 initializations are split as follows [4, 6, 4, 4, 0, 7, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 0, 0, 4, 0, 0, 0, 4]. The 112 writes are split as follows [12, 0, 47, 0, 31, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 19, 0, 0]. [2025-02-06 08:27:19,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:27:18" (1/1) ... [2025-02-06 08:27:19,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:27:18" (1/1) ... [2025-02-06 08:27:19,427 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:27:18" (1/1) ... [2025-02-06 08:27:19,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:27:18" (1/1) ... [2025-02-06 08:27:19,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:27:18" (1/1) ... [2025-02-06 08:27:19,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:27:18" (1/1) ... [2025-02-06 08:27:19,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:27:19,474 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:27:19,474 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:27:19,474 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:27:19,475 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:27:18" (1/1) ... [2025-02-06 08:27:19,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:27:19,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:27:19,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:27:19,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:27:19,551 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_total_size [2025-02-06 08:27:19,551 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_total_size [2025-02-06 08:27:19,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-02-06 08:27:19,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-02-06 08:27:19,551 INFO L130 BoogieDeclarations]: Found specification of procedure seq_release_net [2025-02-06 08:27:19,552 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_release_net [2025-02-06 08:27:19,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-02-06 08:27:19,552 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-02-06 08:27:19,552 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2025-02-06 08:27:19,552 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2025-02-06 08:27:19,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 08:27:19,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 08:27:19,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-02-06 08:27:19,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-02-06 08:27:19,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-02-06 08:27:19,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-02-06 08:27:19,552 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_send [2025-02-06 08:27:19,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_send [2025-02-06 08:27:19,552 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh [2025-02-06 08:27:19,552 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh [2025-02-06 08:27:19,552 INFO L130 BoogieDeclarations]: Found specification of procedure instance_put [2025-02-06 08:27:19,552 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_put [2025-02-06 08:27:19,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-02-06 08:27:19,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-02-06 08:27:19,553 INFO L130 BoogieDeclarations]: Found specification of procedure nf_log_unregister [2025-02-06 08:27:19,553 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_log_unregister [2025-02-06 08:27:19,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-02-06 08:27:19,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-02-06 08:27:19,553 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-02-06 08:27:19,553 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-02-06 08:27:19,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-02-06 08:27:19,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-02-06 08:27:19,553 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2025-02-06 08:27:19,553 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2025-02-06 08:27:19,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-02-06 08:27:19,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-02-06 08:27:19,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-02-06 08:27:19,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-02-06 08:27:19,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:27:19,553 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tailroom [2025-02-06 08:27:19,554 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tailroom [2025-02-06 08:27:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-02-06 08:27:19,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-02-06 08:27:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-02-06 08:27:19,554 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-02-06 08:27:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-02-06 08:27:19,554 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-02-06 08:27:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 08:27:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 08:27:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 08:27:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 08:27:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 08:27:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 08:27:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 08:27:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 08:27:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 08:27:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 08:27:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-06 08:27:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-06 08:27:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-06 08:27:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-06 08:27:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-06 08:27:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-06 08:27:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-06 08:27:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-06 08:27:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-06 08:27:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-06 08:27:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-06 08:27:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-02-06 08:27:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-02-06 08:27:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-02-06 08:27:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-02-06 08:27:19,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-02-06 08:27:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-02-06 08:27:19,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-02-06 08:27:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure nfnetlink_subsys_unregister [2025-02-06 08:27:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnetlink_subsys_unregister [2025-02-06 08:27:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-02-06 08:27:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-02-06 08:27:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:27:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:27:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:27:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 08:27:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 08:27:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 08:27:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 08:27:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 08:27:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 08:27:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 08:27:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 08:27:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 08:27:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 08:27:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 08:27:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 08:27:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 08:27:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-06 08:27:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-06 08:27:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-06 08:27:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-06 08:27:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-06 08:27:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-06 08:27:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-02-06 08:27:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-02-06 08:27:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-02-06 08:27:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-02-06 08:27:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-02-06 08:27:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-02-06 08:27:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure seq_file_net [2025-02-06 08:27:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_file_net [2025-02-06 08:27:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_130 [2025-02-06 08:27:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_130 [2025-02-06 08:27:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-02-06 08:27:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_put [2025-02-06 08:27:19,558 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_put [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_138 [2025-02-06 08:27:19,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_138 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-02-06 08:27:19,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure instance_lookup_get [2025-02-06 08:27:19,558 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_lookup_get [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-02-06 08:27:19,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-06 08:27:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-02-06 08:27:19,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure seq_show [2025-02-06 08:27:19,561 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_show [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-02-06 08:27:19,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:27:19,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2025-02-06 08:27:19,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-02-06 08:27:19,561 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-02-06 08:27:19,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 08:27:19,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-02-06 08:27:19,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure nful_open [2025-02-06 08:27:19,561 INFO L138 BoogieDeclarations]: Found implementation of procedure nful_open [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure seq_read [2025-02-06 08:27:19,561 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_read [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netlink_unregister_notifier [2025-02-06 08:27:19,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netlink_unregister_notifier [2025-02-06 08:27:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure nla_get_be32 [2025-02-06 08:27:19,561 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_get_be32 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2025-02-06 08:27:19,562 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_pernet [2025-02-06 08:27:19,562 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_pernet [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-02-06 08:27:19,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_for_read_section [2025-02-06 08:27:19,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_for_read_section [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_data [2025-02-06 08:27:19,562 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_data [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-02-06 08:27:19,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-02-06 08:27:19,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_unlock_bh [2025-02-06 08:27:19,562 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_unlock_bh [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-06 08:27:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-06 08:27:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_net_exit [2025-02-06 08:27:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_net_exit [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure nla_data [2025-02-06 08:27:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_data [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-02-06 08:27:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-02-06 08:27:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_lookup [2025-02-06 08:27:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_lookup [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-02-06 08:27:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-02-06 08:27:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-02-06 08:27:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-02-06 08:27:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_132 [2025-02-06 08:27:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_132 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_139 [2025-02-06 08:27:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_139 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_unregister_notifier [2025-02-06 08:27:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_unregister_notifier [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2025-02-06 08:27:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-02-06 08:27:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 08:27:19,563 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 08:27:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-02-06 08:27:19,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-02-06 08:27:19,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-02-06 08:27:19,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2025-02-06 08:27:19,564 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_rcu_suspicious [2025-02-06 08:27:19,564 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_rcu_suspicious [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh_held [2025-02-06 08:27:19,564 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh_held [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_destroy [2025-02-06 08:27:19,564 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_destroy [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-02-06 08:27:19,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2025-02-06 08:27:19,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-02-06 08:27:19,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure instance_hashfn [2025-02-06 08:27:19,564 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_hashfn [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 08:27:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 08:27:19,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 08:27:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 08:27:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 08:27:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 08:27:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 08:27:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 08:27:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-06 08:27:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-06 08:27:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-06 08:27:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-06 08:27:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-06 08:27:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-06 08:27:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-02-06 08:27:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-02-06 08:27:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_flush [2025-02-06 08:27:19,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_flush [2025-02-06 08:27:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure get_next [2025-02-06 08:27:19,571 INFO L138 BoogieDeclarations]: Found implementation of procedure get_next [2025-02-06 08:27:20,157 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:27:20,161 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:27:20,224 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15709: havoc #t~nondet826; [2025-02-06 08:27:20,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 08:27:20,252 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15697: havoc seq_open_net_#t~nondet823#1; [2025-02-06 08:27:20,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15589: havoc #t~nondet800; [2025-02-06 08:27:20,292 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15705: havoc #t~nondet825; [2025-02-06 08:27:20,300 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10006: #res#1 := ~arg0#1; [2025-02-06 08:27:20,316 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc #t~mem124; [2025-02-06 08:27:20,359 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15660: havoc nfnetlink_unicast_#t~nondet812#1; [2025-02-06 08:27:20,364 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7035: havoc #t~mem17; [2025-02-06 08:27:20,474 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7262: havoc skb_is_nonlinear_#t~mem56#1; [2025-02-06 08:27:20,475 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7273: havoc #t~ite62#1;havoc #t~mem60#1;havoc #t~mem61#1; [2025-02-06 08:27:20,477 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15671: havoc #t~nondet817; [2025-02-06 08:27:20,513 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6976: havoc #t~bitwise4; [2025-02-06 08:27:20,588 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15656: havoc #t~nondet811; [2025-02-06 08:27:20,617 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15628: havoc #t~nondet806; [2025-02-06 08:27:20,618 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15682: havoc #t~nondet820; [2025-02-06 08:27:20,626 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7311: havoc #t~mem84.base, #t~mem84.offset;havoc #t~mem85.base, #t~mem85.offset; [2025-02-06 08:27:20,662 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15564: havoc __nlmsg_put_#t~ret799#1.base, __nlmsg_put_#t~ret799#1.offset; [2025-02-06 08:27:20,750 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15678: havoc #t~nondet819; [2025-02-06 08:27:20,774 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15701: havoc seq_printf_#t~nondet824#1; [2025-02-06 08:27:20,801 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9505-1: ldv_del_timer_#res#1 := ldv_del_timer_~arg0#1; [2025-02-06 08:27:20,801 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10559-1: ldv_del_timer_148_#res#1 := ldv_del_timer_148_~ldv_func_res~0#1; [2025-02-06 08:27:20,801 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15593: havoc del_timer_#t~nondet801#1; [2025-02-06 08:27:25,595 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15693: havoc seq_lseek_#t~nondet822#1; [2025-02-06 08:27:25,595 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10574-1: ldv_netlink_register_notifier_155_#res#1 := ldv_netlink_register_notifier_155_~ldv_func_res~1#1; [2025-02-06 08:27:25,595 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15632: havoc nf_log_bind_pf_#t~nondet807#1; [2025-02-06 08:27:25,595 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7011: havoc hlist_empty_#t~mem8#1.base, hlist_empty_#t~mem8#1.offset; [2025-02-06 08:27:25,595 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7343: havoc read_pnet_#t~mem88#1.base, read_pnet_#t~mem88#1.offset; [2025-02-06 08:27:25,595 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15636: havoc nf_log_register_#t~nondet808#1; [2025-02-06 08:27:25,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9294: call ULTIMATE.dealloc(nfnl_log_net_init_~#__key~1#1.base, nfnl_log_net_init_~#__key~1#1.offset);havoc nfnl_log_net_init_~#__key~1#1.base, nfnl_log_net_init_~#__key~1#1.offset; [2025-02-06 08:27:25,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7479: havoc nla_get_be16_#t~mem126#1; [2025-02-06 08:27:25,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15674: havoc proc_create_data_#t~ret818#1.base, proc_create_data_#t~ret818#1.offset; [2025-02-06 08:27:25,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9994-1: ldv_netlink_register_notifier_#res#1 := ldv_netlink_register_notifier_~arg0#1; [2025-02-06 08:27:25,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10589-1: ldv_netlink_unregister_notifier_156_#res#1 := ldv_netlink_unregister_notifier_156_~ldv_func_res~2#1; [2025-02-06 08:27:25,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7485: havoc sk_user_ns_#t~mem127#1.base, sk_user_ns_#t~mem127#1.offset;havoc sk_user_ns_#t~mem128#1.base, sk_user_ns_#t~mem128#1.offset;havoc sk_user_ns_#t~mem129#1.base, sk_user_ns_#t~mem129#1.offset;havoc sk_user_ns_#t~mem130#1.base, sk_user_ns_#t~mem130#1.offset; [2025-02-06 08:27:25,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7789: call ULTIMATE.dealloc(instance_create_~#__key~0#1.base, instance_create_~#__key~0#1.offset);havoc instance_create_~#__key~0#1.base, instance_create_~#__key~0#1.offset;call ULTIMATE.dealloc(instance_create_~#__key___0~0#1.base, instance_create_~#__key___0~0#1.offset);havoc instance_create_~#__key___0~0#1.base, instance_create_~#__key___0~0#1.offset; [2025-02-06 08:27:25,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15652: havoc nfnetlink_subsys_register_#t~nondet810#1; [2025-02-06 08:27:25,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15686: havoc register_pernet_subsys_#t~nondet821#1; [2025-02-06 08:27:25,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15624: havoc netlink_register_notifier_#t~nondet805#1; [2025-02-06 08:27:25,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10604-1: ldv_netlink_unregister_notifier_157_#res#1 := ldv_netlink_unregister_notifier_157_~ldv_func_res~3#1; [2025-02-06 08:27:25,910 INFO L? ?]: Removed 1552 outVars from TransFormulas that were not future-live. [2025-02-06 08:27:25,910 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:27:25,953 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:27:25,953 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 08:27:25,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:27:25 BoogieIcfgContainer [2025-02-06 08:27:25,954 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:27:25,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:27:25,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:27:25,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:27:25,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:27:15" (1/3) ... [2025-02-06 08:27:25,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4893131d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:27:25, skipping insertion in model container [2025-02-06 08:27:25,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:27:18" (2/3) ... [2025-02-06 08:27:25,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4893131d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:27:25, skipping insertion in model container [2025-02-06 08:27:25,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:27:25" (3/3) ... [2025-02-06 08:27:25,962 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2025-02-06 08:27:25,974 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:27:25,977 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i that has 86 procedures, 1134 locations, 1 initial locations, 1 loop locations, and 32 error locations. [2025-02-06 08:27:26,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:27:26,057 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=LoopHeads, 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;@8ab5d45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:27:26,058 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-02-06 08:27:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 1136 states, 753 states have (on average 1.248339973439575) internal successors, (940), 813 states have internal predecessors, (940), 263 states have call successors, (263), 85 states have call predecessors, (263), 84 states have return successors, (258), 254 states have call predecessors, (258), 258 states have call successors, (258) [2025-02-06 08:27:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 08:27:26,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:26,072 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:26,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:26,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:26,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1454878487, now seen corresponding path program 1 times [2025-02-06 08:27:26,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:26,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969267651] [2025-02-06 08:27:26,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:26,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:26,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 08:27:26,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 08:27:26,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:26,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:27,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:27,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969267651] [2025-02-06 08:27:27,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969267651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:27,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:27,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:27,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333065207] [2025-02-06 08:27:27,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:27,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:27,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:27,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:27,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:27,506 INFO L87 Difference]: Start difference. First operand has 1136 states, 753 states have (on average 1.248339973439575) internal successors, (940), 813 states have internal predecessors, (940), 263 states have call successors, (263), 85 states have call predecessors, (263), 84 states have return successors, (258), 254 states have call predecessors, (258), 258 states have call successors, (258) Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 08:27:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:27,723 INFO L93 Difference]: Finished difference Result 2236 states and 2966 transitions. [2025-02-06 08:27:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:27,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 70 [2025-02-06 08:27:27,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:27,747 INFO L225 Difference]: With dead ends: 2236 [2025-02-06 08:27:27,747 INFO L226 Difference]: Without dead ends: 1106 [2025-02-06 08:27:27,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:27,762 INFO L435 NwaCegarLoop]: 1405 mSDtfsCounter, 1374 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:27,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 2809 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:27,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-02-06 08:27:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2025-02-06 08:27:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 735 states have (on average 1.1877551020408164) internal successors, (873), 786 states have internal predecessors, (873), 258 states have call successors, (258), 84 states have call predecessors, (258), 83 states have return successors, (256), 252 states have call predecessors, (256), 256 states have call successors, (256) [2025-02-06 08:27:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1387 transitions. [2025-02-06 08:27:27,900 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1387 transitions. Word has length 70 [2025-02-06 08:27:27,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:27,901 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1387 transitions. [2025-02-06 08:27:27,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 08:27:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1387 transitions. [2025-02-06 08:27:27,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 08:27:27,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:27,906 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:27,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:27:27,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:27,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:27,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1126230998, now seen corresponding path program 1 times [2025-02-06 08:27:27,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:27,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484834969] [2025-02-06 08:27:27,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:27,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:28,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 08:27:28,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 08:27:28,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:28,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:28,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:28,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484834969] [2025-02-06 08:27:28,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484834969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:28,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:28,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:28,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085627319] [2025-02-06 08:27:28,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:28,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:28,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:28,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:28,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:28,764 INFO L87 Difference]: Start difference. First operand 1106 states and 1387 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 08:27:28,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:28,902 INFO L93 Difference]: Finished difference Result 1106 states and 1387 transitions. [2025-02-06 08:27:28,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:28,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 76 [2025-02-06 08:27:28,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:28,913 INFO L225 Difference]: With dead ends: 1106 [2025-02-06 08:27:28,915 INFO L226 Difference]: Without dead ends: 1104 [2025-02-06 08:27:28,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:28,917 INFO L435 NwaCegarLoop]: 1382 mSDtfsCounter, 1350 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 2763 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:28,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 2763 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:28,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2025-02-06 08:27:28,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1104. [2025-02-06 08:27:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 734 states have (on average 1.1866485013623977) internal successors, (871), 784 states have internal predecessors, (871), 258 states have call successors, (258), 84 states have call predecessors, (258), 83 states have return successors, (256), 252 states have call predecessors, (256), 256 states have call successors, (256) [2025-02-06 08:27:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1385 transitions. [2025-02-06 08:27:28,988 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1385 transitions. Word has length 76 [2025-02-06 08:27:28,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:28,989 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1385 transitions. [2025-02-06 08:27:28,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 08:27:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1385 transitions. [2025-02-06 08:27:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 08:27:28,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:28,993 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2025-02-06 08:27:28,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:27:28,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:28,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash 129268089, now seen corresponding path program 1 times [2025-02-06 08:27:28,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:28,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625511947] [2025-02-06 08:27:28,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:28,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:29,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 08:27:29,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 08:27:29,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:29,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:29,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:29,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625511947] [2025-02-06 08:27:29,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625511947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:29,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:29,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:29,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927387904] [2025-02-06 08:27:29,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:29,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:29,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:29,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:29,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:29,574 INFO L87 Difference]: Start difference. First operand 1104 states and 1385 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 08:27:29,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:29,647 INFO L93 Difference]: Finished difference Result 1104 states and 1385 transitions. [2025-02-06 08:27:29,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:29,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 82 [2025-02-06 08:27:29,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:29,655 INFO L225 Difference]: With dead ends: 1104 [2025-02-06 08:27:29,655 INFO L226 Difference]: Without dead ends: 1102 [2025-02-06 08:27:29,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:29,657 INFO L435 NwaCegarLoop]: 1380 mSDtfsCounter, 1347 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:29,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 2759 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:29,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-02-06 08:27:29,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1102. [2025-02-06 08:27:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 733 states have (on average 1.1855388813096863) internal successors, (869), 782 states have internal predecessors, (869), 258 states have call successors, (258), 84 states have call predecessors, (258), 83 states have return successors, (256), 252 states have call predecessors, (256), 256 states have call successors, (256) [2025-02-06 08:27:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1383 transitions. [2025-02-06 08:27:29,711 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1383 transitions. Word has length 82 [2025-02-06 08:27:29,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:29,712 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1383 transitions. [2025-02-06 08:27:29,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 08:27:29,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1383 transitions. [2025-02-06 08:27:29,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 08:27:29,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:29,716 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:29,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:27:29,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting nfnl_log_pernetErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:29,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:29,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1603376363, now seen corresponding path program 1 times [2025-02-06 08:27:29,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:29,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970760416] [2025-02-06 08:27:29,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:29,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:30,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 08:27:30,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 08:27:30,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:30,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-02-06 08:27:30,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:30,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970760416] [2025-02-06 08:27:30,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970760416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:30,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:30,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:27:30,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795294670] [2025-02-06 08:27:30,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:30,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:27:30,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:30,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:27:30,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:30,786 INFO L87 Difference]: Start difference. First operand 1102 states and 1383 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 08:27:34,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:27:35,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:35,846 INFO L93 Difference]: Finished difference Result 1821 states and 2245 transitions. [2025-02-06 08:27:35,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:27:35,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2025-02-06 08:27:35,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:35,860 INFO L225 Difference]: With dead ends: 1821 [2025-02-06 08:27:35,861 INFO L226 Difference]: Without dead ends: 1819 [2025-02-06 08:27:35,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:27:35,864 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 844 mSDsluCounter, 4061 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 5586 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:35,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 5586 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 368 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-02-06 08:27:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2025-02-06 08:27:35,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1624. [2025-02-06 08:27:35,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1079 states have (on average 1.1742354031510658) internal successors, (1267), 1144 states have internal predecessors, (1267), 385 states have call successors, (385), 134 states have call predecessors, (385), 132 states have return successors, (385), 370 states have call predecessors, (385), 383 states have call successors, (385) [2025-02-06 08:27:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2037 transitions. [2025-02-06 08:27:35,953 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2037 transitions. Word has length 97 [2025-02-06 08:27:35,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:35,953 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2037 transitions. [2025-02-06 08:27:35,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 08:27:35,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2037 transitions. [2025-02-06 08:27:35,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 08:27:35,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:35,955 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:35,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:27:35,955 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:35,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:35,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1422514692, now seen corresponding path program 1 times [2025-02-06 08:27:35,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:35,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520747048] [2025-02-06 08:27:35,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:35,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:36,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 08:27:36,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 08:27:36,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:36,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:36,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:36,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520747048] [2025-02-06 08:27:36,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520747048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:36,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:36,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:36,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027622851] [2025-02-06 08:27:36,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:36,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:36,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:36,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:36,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:36,564 INFO L87 Difference]: Start difference. First operand 1624 states and 2037 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 08:27:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:36,636 INFO L93 Difference]: Finished difference Result 1624 states and 2037 transitions. [2025-02-06 08:27:36,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:36,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 88 [2025-02-06 08:27:36,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:36,644 INFO L225 Difference]: With dead ends: 1624 [2025-02-06 08:27:36,645 INFO L226 Difference]: Without dead ends: 1622 [2025-02-06 08:27:36,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:36,646 INFO L435 NwaCegarLoop]: 1378 mSDtfsCounter, 1344 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 2755 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:36,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 2755 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:36,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2025-02-06 08:27:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1622. [2025-02-06 08:27:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1078 states have (on average 1.1734693877551021) internal successors, (1265), 1142 states have internal predecessors, (1265), 385 states have call successors, (385), 134 states have call predecessors, (385), 132 states have return successors, (385), 370 states have call predecessors, (385), 383 states have call successors, (385) [2025-02-06 08:27:36,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2035 transitions. [2025-02-06 08:27:36,713 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2035 transitions. Word has length 88 [2025-02-06 08:27:36,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:36,714 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2035 transitions. [2025-02-06 08:27:36,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 08:27:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2035 transitions. [2025-02-06 08:27:36,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 08:27:36,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:36,716 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:36,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:27:36,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:36,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:36,716 INFO L85 PathProgramCache]: Analyzing trace with hash 465522318, now seen corresponding path program 1 times [2025-02-06 08:27:36,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:36,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123314868] [2025-02-06 08:27:36,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:36,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:37,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 08:27:37,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 08:27:37,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:37,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:37,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:37,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123314868] [2025-02-06 08:27:37,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123314868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:37,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:37,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:37,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293199717] [2025-02-06 08:27:37,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:37,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:37,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:37,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:37,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:37,319 INFO L87 Difference]: Start difference. First operand 1622 states and 2035 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 08:27:37,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:37,410 INFO L93 Difference]: Finished difference Result 1622 states and 2035 transitions. [2025-02-06 08:27:37,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:37,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 94 [2025-02-06 08:27:37,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:37,418 INFO L225 Difference]: With dead ends: 1622 [2025-02-06 08:27:37,418 INFO L226 Difference]: Without dead ends: 1620 [2025-02-06 08:27:37,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:37,420 INFO L435 NwaCegarLoop]: 1376 mSDtfsCounter, 1341 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:37,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1341 Valid, 2751 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:37,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2025-02-06 08:27:37,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1620. [2025-02-06 08:27:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1077 states have (on average 1.1727019498607243) internal successors, (1263), 1140 states have internal predecessors, (1263), 385 states have call successors, (385), 134 states have call predecessors, (385), 132 states have return successors, (385), 370 states have call predecessors, (385), 383 states have call successors, (385) [2025-02-06 08:27:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2033 transitions. [2025-02-06 08:27:37,494 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2033 transitions. Word has length 94 [2025-02-06 08:27:37,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:37,494 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2033 transitions. [2025-02-06 08:27:37,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 08:27:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2033 transitions. [2025-02-06 08:27:37,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 08:27:37,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:37,498 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:37,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:27:37,499 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:37,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:37,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1194135242, now seen corresponding path program 1 times [2025-02-06 08:27:37,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:37,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2442174] [2025-02-06 08:27:37,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:37,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:37,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 08:27:37,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 08:27:37,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:37,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:38,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:38,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2442174] [2025-02-06 08:27:38,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2442174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:38,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:38,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:38,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734801270] [2025-02-06 08:27:38,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:38,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:38,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:38,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:38,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:38,050 INFO L87 Difference]: Start difference. First operand 1620 states and 2033 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 08:27:38,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:38,132 INFO L93 Difference]: Finished difference Result 1620 states and 2033 transitions. [2025-02-06 08:27:38,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:38,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 100 [2025-02-06 08:27:38,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:38,139 INFO L225 Difference]: With dead ends: 1620 [2025-02-06 08:27:38,139 INFO L226 Difference]: Without dead ends: 1618 [2025-02-06 08:27:38,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:38,140 INFO L435 NwaCegarLoop]: 1374 mSDtfsCounter, 1338 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1338 SdHoareTripleChecker+Valid, 2747 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:38,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1338 Valid, 2747 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2025-02-06 08:27:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1618. [2025-02-06 08:27:38,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1076 states have (on average 1.1719330855018588) internal successors, (1261), 1138 states have internal predecessors, (1261), 385 states have call successors, (385), 134 states have call predecessors, (385), 132 states have return successors, (385), 370 states have call predecessors, (385), 383 states have call successors, (385) [2025-02-06 08:27:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2031 transitions. [2025-02-06 08:27:38,220 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2031 transitions. Word has length 100 [2025-02-06 08:27:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:38,220 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2031 transitions. [2025-02-06 08:27:38,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 08:27:38,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2031 transitions. [2025-02-06 08:27:38,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 08:27:38,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:38,221 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:38,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:27:38,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:38,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:38,222 INFO L85 PathProgramCache]: Analyzing trace with hash -753997431, now seen corresponding path program 1 times [2025-02-06 08:27:38,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:38,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163747004] [2025-02-06 08:27:38,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:38,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:38,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 08:27:38,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 08:27:38,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:38,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:38,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:38,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163747004] [2025-02-06 08:27:38,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163747004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:38,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:38,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:38,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026431078] [2025-02-06 08:27:38,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:38,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:38,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:38,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:38,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:38,907 INFO L87 Difference]: Start difference. First operand 1618 states and 2031 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 08:27:39,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:39,010 INFO L93 Difference]: Finished difference Result 1618 states and 2031 transitions. [2025-02-06 08:27:39,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:39,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 106 [2025-02-06 08:27:39,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:39,019 INFO L225 Difference]: With dead ends: 1618 [2025-02-06 08:27:39,019 INFO L226 Difference]: Without dead ends: 1616 [2025-02-06 08:27:39,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:39,020 INFO L435 NwaCegarLoop]: 1372 mSDtfsCounter, 1335 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 2743 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:39,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 2743 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:39,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2025-02-06 08:27:39,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1616. [2025-02-06 08:27:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1075 states have (on average 1.1711627906976745) internal successors, (1259), 1136 states have internal predecessors, (1259), 385 states have call successors, (385), 134 states have call predecessors, (385), 132 states have return successors, (385), 370 states have call predecessors, (385), 383 states have call successors, (385) [2025-02-06 08:27:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2029 transitions. [2025-02-06 08:27:39,095 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2029 transitions. Word has length 106 [2025-02-06 08:27:39,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:39,095 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2029 transitions. [2025-02-06 08:27:39,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 08:27:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2029 transitions. [2025-02-06 08:27:39,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 08:27:39,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:39,097 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:39,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:27:39,097 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:39,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:39,098 INFO L85 PathProgramCache]: Analyzing trace with hash 722243579, now seen corresponding path program 1 times [2025-02-06 08:27:39,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:39,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572077328] [2025-02-06 08:27:39,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:39,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:39,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 08:27:39,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 08:27:39,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:39,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-06 08:27:39,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:39,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572077328] [2025-02-06 08:27:39,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572077328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:39,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:39,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:27:39,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834232570] [2025-02-06 08:27:39,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:39,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:27:39,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:39,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:27:39,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:39,887 INFO L87 Difference]: Start difference. First operand 1616 states and 2029 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 08:27:40,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:40,081 INFO L93 Difference]: Finished difference Result 1796 states and 2227 transitions. [2025-02-06 08:27:40,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:27:40,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2025-02-06 08:27:40,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:40,090 INFO L225 Difference]: With dead ends: 1796 [2025-02-06 08:27:40,091 INFO L226 Difference]: Without dead ends: 1794 [2025-02-06 08:27:40,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:27:40,093 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 1183 mSDsluCounter, 3370 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 4877 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:40,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 4877 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:40,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2025-02-06 08:27:40,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1782. [2025-02-06 08:27:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1192 states have (on average 1.1736577181208054) internal successors, (1399), 1253 states have internal predecessors, (1399), 410 states have call successors, (410), 158 states have call predecessors, (410), 156 states have return successors, (410), 395 states have call predecessors, (410), 408 states have call successors, (410) [2025-02-06 08:27:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2219 transitions. [2025-02-06 08:27:40,186 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2219 transitions. Word has length 118 [2025-02-06 08:27:40,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:40,186 INFO L471 AbstractCegarLoop]: Abstraction has 1782 states and 2219 transitions. [2025-02-06 08:27:40,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 08:27:40,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2219 transitions. [2025-02-06 08:27:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 08:27:40,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:40,190 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:40,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:27:40,190 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:40,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2131970981, now seen corresponding path program 1 times [2025-02-06 08:27:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:40,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036930368] [2025-02-06 08:27:40,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:40,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:40,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 08:27:40,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 08:27:40,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:40,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:40,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:40,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036930368] [2025-02-06 08:27:40,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036930368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:40,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:40,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:40,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249607215] [2025-02-06 08:27:40,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:40,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:40,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:40,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:40,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:40,863 INFO L87 Difference]: Start difference. First operand 1782 states and 2219 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 08:27:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:40,953 INFO L93 Difference]: Finished difference Result 1782 states and 2219 transitions. [2025-02-06 08:27:40,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:40,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 112 [2025-02-06 08:27:40,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:40,961 INFO L225 Difference]: With dead ends: 1782 [2025-02-06 08:27:40,962 INFO L226 Difference]: Without dead ends: 1780 [2025-02-06 08:27:40,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:40,963 INFO L435 NwaCegarLoop]: 1370 mSDtfsCounter, 1332 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 2739 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:40,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 2739 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:40,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2025-02-06 08:27:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1780. [2025-02-06 08:27:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1191 states have (on average 1.1729638958858102) internal successors, (1397), 1251 states have internal predecessors, (1397), 410 states have call successors, (410), 158 states have call predecessors, (410), 156 states have return successors, (410), 395 states have call predecessors, (410), 408 states have call successors, (410) [2025-02-06 08:27:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2217 transitions. [2025-02-06 08:27:41,054 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2217 transitions. Word has length 112 [2025-02-06 08:27:41,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:41,054 INFO L471 AbstractCegarLoop]: Abstraction has 1780 states and 2217 transitions. [2025-02-06 08:27:41,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 08:27:41,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2217 transitions. [2025-02-06 08:27:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 08:27:41,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:41,058 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 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, 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, 1, 1, 1, 1, 1] [2025-02-06 08:27:41,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:27:41,058 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting rcu_read_unlock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:41,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:41,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1917855208, now seen corresponding path program 1 times [2025-02-06 08:27:41,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:41,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861229605] [2025-02-06 08:27:41,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:41,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:41,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 08:27:41,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 08:27:41,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:41,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-02-06 08:27:41,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:41,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861229605] [2025-02-06 08:27:41,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861229605] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:27:41,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819958901] [2025-02-06 08:27:41,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:41,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:27:41,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:27:41,781 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:27:41,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 08:27:42,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 08:27:42,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 08:27:42,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:42,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:42,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 1634 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 08:27:42,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:27:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-02-06 08:27:43,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:27:43,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819958901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:43,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:27:43,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-02-06 08:27:43,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539274661] [2025-02-06 08:27:43,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:43,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:27:43,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:43,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:27:43,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:27:43,092 INFO L87 Difference]: Start difference. First operand 1780 states and 2217 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-02-06 08:27:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:43,604 INFO L93 Difference]: Finished difference Result 3393 states and 4195 transitions. [2025-02-06 08:27:43,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:27:43,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 134 [2025-02-06 08:27:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:43,613 INFO L225 Difference]: With dead ends: 3393 [2025-02-06 08:27:43,614 INFO L226 Difference]: Without dead ends: 1788 [2025-02-06 08:27:43,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:27:43,618 INFO L435 NwaCegarLoop]: 1350 mSDtfsCounter, 35 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 5307 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:43,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 5307 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:27:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2025-02-06 08:27:43,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1786. [2025-02-06 08:27:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1195 states have (on average 1.1723849372384938) internal successors, (1401), 1255 states have internal predecessors, (1401), 412 states have call successors, (412), 158 states have call predecessors, (412), 156 states have return successors, (412), 397 states have call predecessors, (412), 410 states have call successors, (412) [2025-02-06 08:27:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2225 transitions. [2025-02-06 08:27:43,715 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2225 transitions. Word has length 134 [2025-02-06 08:27:43,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:43,715 INFO L471 AbstractCegarLoop]: Abstraction has 1786 states and 2225 transitions. [2025-02-06 08:27:43,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-02-06 08:27:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2225 transitions. [2025-02-06 08:27:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 08:27:43,717 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:43,717 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:43,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 08:27:43,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 08:27:43,922 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:43,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:43,922 INFO L85 PathProgramCache]: Analyzing trace with hash 124754208, now seen corresponding path program 1 times [2025-02-06 08:27:43,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:43,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116114672] [2025-02-06 08:27:43,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:43,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:44,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 08:27:44,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 08:27:44,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:44,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:44,753 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:44,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:44,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116114672] [2025-02-06 08:27:44,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116114672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:44,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:44,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:44,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938722889] [2025-02-06 08:27:44,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:44,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:44,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:44,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:44,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:44,755 INFO L87 Difference]: Start difference. First operand 1786 states and 2225 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 08:27:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:44,846 INFO L93 Difference]: Finished difference Result 1786 states and 2225 transitions. [2025-02-06 08:27:44,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:44,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 114 [2025-02-06 08:27:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:44,856 INFO L225 Difference]: With dead ends: 1786 [2025-02-06 08:27:44,856 INFO L226 Difference]: Without dead ends: 1784 [2025-02-06 08:27:44,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:44,858 INFO L435 NwaCegarLoop]: 1368 mSDtfsCounter, 1328 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:44,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 2735 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2025-02-06 08:27:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1784. [2025-02-06 08:27:44,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1194 states have (on average 1.1716917922948074) internal successors, (1399), 1253 states have internal predecessors, (1399), 412 states have call successors, (412), 158 states have call predecessors, (412), 156 states have return successors, (412), 397 states have call predecessors, (412), 410 states have call successors, (412) [2025-02-06 08:27:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2223 transitions. [2025-02-06 08:27:44,974 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2223 transitions. Word has length 114 [2025-02-06 08:27:44,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:44,974 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2223 transitions. [2025-02-06 08:27:44,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 08:27:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2223 transitions. [2025-02-06 08:27:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 08:27:44,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:44,976 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1] [2025-02-06 08:27:44,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 08:27:44,976 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:44,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash -30911402, now seen corresponding path program 1 times [2025-02-06 08:27:44,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:44,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547083560] [2025-02-06 08:27:44,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:44,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:45,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 08:27:45,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 08:27:45,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:45,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:45,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:45,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547083560] [2025-02-06 08:27:45,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547083560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:45,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:45,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:45,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850356531] [2025-02-06 08:27:45,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:45,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:45,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:45,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:45,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:45,682 INFO L87 Difference]: Start difference. First operand 1784 states and 2223 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 08:27:45,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:45,867 INFO L93 Difference]: Finished difference Result 2694 states and 3294 transitions. [2025-02-06 08:27:45,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:45,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 120 [2025-02-06 08:27:45,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:45,877 INFO L225 Difference]: With dead ends: 2694 [2025-02-06 08:27:45,878 INFO L226 Difference]: Without dead ends: 2692 [2025-02-06 08:27:45,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:45,880 INFO L435 NwaCegarLoop]: 1388 mSDtfsCounter, 1326 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 3656 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:45,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 3656 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2692 states. [2025-02-06 08:27:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2692 to 2647. [2025-02-06 08:27:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2647 states, 1799 states have (on average 1.1750972762645915) internal successors, (2114), 1866 states have internal predecessors, (2114), 577 states have call successors, (577), 251 states have call predecessors, (577), 249 states have return successors, (577), 561 states have call predecessors, (577), 575 states have call successors, (577) [2025-02-06 08:27:46,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 3268 transitions. [2025-02-06 08:27:46,017 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 3268 transitions. Word has length 120 [2025-02-06 08:27:46,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:46,018 INFO L471 AbstractCegarLoop]: Abstraction has 2647 states and 3268 transitions. [2025-02-06 08:27:46,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 08:27:46,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3268 transitions. [2025-02-06 08:27:46,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 08:27:46,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:46,020 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:46,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 08:27:46,020 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:46,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:46,021 INFO L85 PathProgramCache]: Analyzing trace with hash 849324805, now seen corresponding path program 1 times [2025-02-06 08:27:46,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:46,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826030516] [2025-02-06 08:27:46,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:46,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:46,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 08:27:46,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 08:27:46,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:46,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:46,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:46,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826030516] [2025-02-06 08:27:46,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826030516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:46,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:46,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:46,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473793442] [2025-02-06 08:27:46,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:46,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:46,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:46,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:46,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:46,555 INFO L87 Difference]: Start difference. First operand 2647 states and 3268 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 08:27:46,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:46,761 INFO L93 Difference]: Finished difference Result 3765 states and 4586 transitions. [2025-02-06 08:27:46,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:46,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 126 [2025-02-06 08:27:46,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:46,776 INFO L225 Difference]: With dead ends: 3765 [2025-02-06 08:27:46,776 INFO L226 Difference]: Without dead ends: 3763 [2025-02-06 08:27:46,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:46,778 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 846 mSDsluCounter, 2552 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 3918 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:46,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 3918 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3763 states. [2025-02-06 08:27:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3763 to 3622. [2025-02-06 08:27:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 2457 states have (on average 1.1664631664631664) internal successors, (2866), 2546 states have internal predecessors, (2866), 790 states have call successors, (790), 356 states have call predecessors, (790), 353 states have return successors, (790), 764 states have call predecessors, (790), 788 states have call successors, (790) [2025-02-06 08:27:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 4446 transitions. [2025-02-06 08:27:46,962 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 4446 transitions. Word has length 126 [2025-02-06 08:27:46,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:46,962 INFO L471 AbstractCegarLoop]: Abstraction has 3622 states and 4446 transitions. [2025-02-06 08:27:46,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 08:27:46,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 4446 transitions. [2025-02-06 08:27:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 08:27:46,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:46,964 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:46,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 08:27:46,964 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:46,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:46,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1356796777, now seen corresponding path program 1 times [2025-02-06 08:27:46,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:46,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844848512] [2025-02-06 08:27:46,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:46,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:47,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 08:27:47,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 08:27:47,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:47,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-02-06 08:27:47,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:47,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844848512] [2025-02-06 08:27:47,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844848512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:47,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:47,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:27:47,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043666118] [2025-02-06 08:27:47,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:47,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:27:47,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:47,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:27:47,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:27:47,641 INFO L87 Difference]: Start difference. First operand 3622 states and 4446 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 08:27:47,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:47,945 INFO L93 Difference]: Finished difference Result 6381 states and 7811 transitions. [2025-02-06 08:27:47,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:27:47,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-02-06 08:27:47,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:47,976 INFO L225 Difference]: With dead ends: 6381 [2025-02-06 08:27:47,976 INFO L226 Difference]: Without dead ends: 3633 [2025-02-06 08:27:47,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:27:47,987 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 13 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2730 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:47,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2730 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2025-02-06 08:27:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3623. [2025-02-06 08:27:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3623 states, 2458 states have (on average 1.1663954434499593) internal successors, (2867), 2547 states have internal predecessors, (2867), 790 states have call successors, (790), 356 states have call predecessors, (790), 353 states have return successors, (790), 764 states have call predecessors, (790), 788 states have call successors, (790) [2025-02-06 08:27:48,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 4447 transitions. [2025-02-06 08:27:48,269 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 4447 transitions. Word has length 141 [2025-02-06 08:27:48,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:48,269 INFO L471 AbstractCegarLoop]: Abstraction has 3623 states and 4447 transitions. [2025-02-06 08:27:48,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 08:27:48,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 4447 transitions. [2025-02-06 08:27:48,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 08:27:48,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:48,271 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:48,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 08:27:48,272 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:48,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:48,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1184326641, now seen corresponding path program 1 times [2025-02-06 08:27:48,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:48,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196048715] [2025-02-06 08:27:48,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:48,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:48,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 08:27:48,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 08:27:48,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:48,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:48,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:48,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196048715] [2025-02-06 08:27:48,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196048715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:48,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:48,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:48,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313785623] [2025-02-06 08:27:48,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:48,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:48,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:48,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:48,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:48,764 INFO L87 Difference]: Start difference. First operand 3623 states and 4447 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 08:27:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:48,922 INFO L93 Difference]: Finished difference Result 3623 states and 4447 transitions. [2025-02-06 08:27:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:48,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 132 [2025-02-06 08:27:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:48,935 INFO L225 Difference]: With dead ends: 3623 [2025-02-06 08:27:48,936 INFO L226 Difference]: Without dead ends: 3621 [2025-02-06 08:27:48,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:48,938 INFO L435 NwaCegarLoop]: 1365 mSDtfsCounter, 1325 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 2729 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:48,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 2729 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:48,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3621 states. [2025-02-06 08:27:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3621 to 3621. [2025-02-06 08:27:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 2457 states have (on average 1.1656491656491657) internal successors, (2864), 2545 states have internal predecessors, (2864), 790 states have call successors, (790), 356 states have call predecessors, (790), 353 states have return successors, (790), 764 states have call predecessors, (790), 788 states have call successors, (790) [2025-02-06 08:27:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 4444 transitions. [2025-02-06 08:27:49,146 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 4444 transitions. Word has length 132 [2025-02-06 08:27:49,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:49,147 INFO L471 AbstractCegarLoop]: Abstraction has 3621 states and 4444 transitions. [2025-02-06 08:27:49,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 08:27:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 4444 transitions. [2025-02-06 08:27:49,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 08:27:49,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:49,149 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:49,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:27:49,150 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:49,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:49,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1071287655, now seen corresponding path program 1 times [2025-02-06 08:27:49,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:49,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726611816] [2025-02-06 08:27:49,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:49,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:49,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 08:27:49,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 08:27:49,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:49,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-02-06 08:27:49,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:49,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726611816] [2025-02-06 08:27:49,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726611816] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:27:49,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127216876] [2025-02-06 08:27:49,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:49,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:27:49,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:27:49,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:27:49,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 08:27:50,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 08:27:50,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 08:27:50,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:50,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:50,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 1736 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 08:27:50,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:27:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-02-06 08:27:50,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:27:51,016 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-02-06 08:27:51,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127216876] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:27:51,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:27:51,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 08:27:51,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698450149] [2025-02-06 08:27:51,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:27:51,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:27:51,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:51,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:27:51,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:27:51,017 INFO L87 Difference]: Start difference. First operand 3621 states and 4444 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 08:27:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:51,216 INFO L93 Difference]: Finished difference Result 6401 states and 7841 transitions. [2025-02-06 08:27:51,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:27:51,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2025-02-06 08:27:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:51,229 INFO L225 Difference]: With dead ends: 6401 [2025-02-06 08:27:51,229 INFO L226 Difference]: Without dead ends: 3654 [2025-02-06 08:27:51,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:27:51,235 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 80 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:51,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 2759 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:51,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2025-02-06 08:27:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3654. [2025-02-06 08:27:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 2487 states have (on average 1.168476075593084) internal successors, (2906), 2578 states have internal predecessors, (2906), 793 states have call successors, (793), 356 states have call predecessors, (793), 353 states have return successors, (793), 767 states have call predecessors, (793), 791 states have call successors, (793) [2025-02-06 08:27:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 4492 transitions. [2025-02-06 08:27:51,398 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 4492 transitions. Word has length 146 [2025-02-06 08:27:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:51,399 INFO L471 AbstractCegarLoop]: Abstraction has 3654 states and 4492 transitions. [2025-02-06 08:27:51,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 08:27:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 4492 transitions. [2025-02-06 08:27:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 08:27:51,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:51,402 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:51,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 08:27:51,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 08:27:51,603 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_check_for_read_sectionErr3ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:51,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:51,603 INFO L85 PathProgramCache]: Analyzing trace with hash 689827972, now seen corresponding path program 1 times [2025-02-06 08:27:51,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:51,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256468409] [2025-02-06 08:27:51,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:51,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:52,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 08:27:52,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 08:27:52,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:52,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-02-06 08:27:52,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:52,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256468409] [2025-02-06 08:27:52,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256468409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:52,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:52,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:52,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061069580] [2025-02-06 08:27:52,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:52,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:52,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:52,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:52,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:52,322 INFO L87 Difference]: Start difference. First operand 3654 states and 4492 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 08:27:52,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:52,527 INFO L93 Difference]: Finished difference Result 3698 states and 4524 transitions. [2025-02-06 08:27:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:52,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-02-06 08:27:52,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:52,545 INFO L225 Difference]: With dead ends: 3698 [2025-02-06 08:27:52,545 INFO L226 Difference]: Without dead ends: 3696 [2025-02-06 08:27:52,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:52,547 INFO L435 NwaCegarLoop]: 1364 mSDtfsCounter, 850 mSDsluCounter, 2548 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 3912 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:52,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 3912 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:52,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3696 states. [2025-02-06 08:27:52,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3696 to 3654. [2025-02-06 08:27:52,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 2487 states have (on average 1.1672698029754724) internal successors, (2903), 2578 states have internal predecessors, (2903), 793 states have call successors, (793), 356 states have call predecessors, (793), 353 states have return successors, (793), 767 states have call predecessors, (793), 791 states have call successors, (793) [2025-02-06 08:27:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 4489 transitions. [2025-02-06 08:27:52,711 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 4489 transitions. Word has length 147 [2025-02-06 08:27:52,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:52,712 INFO L471 AbstractCegarLoop]: Abstraction has 3654 states and 4489 transitions. [2025-02-06 08:27:52,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 08:27:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 4489 transitions. [2025-02-06 08:27:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 08:27:52,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:52,714 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:52,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 08:27:52,714 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:52,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:52,715 INFO L85 PathProgramCache]: Analyzing trace with hash 467214967, now seen corresponding path program 1 times [2025-02-06 08:27:52,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:52,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303782521] [2025-02-06 08:27:52,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:52,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:53,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 08:27:53,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 08:27:53,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:53,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:27:53,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:53,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303782521] [2025-02-06 08:27:53,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303782521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:53,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:53,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:53,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086413292] [2025-02-06 08:27:53,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:53,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:53,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:53,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:53,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:53,412 INFO L87 Difference]: Start difference. First operand 3654 states and 4489 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 08:27:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:53,614 INFO L93 Difference]: Finished difference Result 3987 states and 4841 transitions. [2025-02-06 08:27:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:53,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 138 [2025-02-06 08:27:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:53,629 INFO L225 Difference]: With dead ends: 3987 [2025-02-06 08:27:53,629 INFO L226 Difference]: Without dead ends: 3985 [2025-02-06 08:27:53,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:53,632 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 780 mSDsluCounter, 2851 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 4364 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:53,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 4364 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:53,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2025-02-06 08:27:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3858. [2025-02-06 08:27:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3858 states, 2623 states have (on average 1.1589782691574533) internal successors, (3040), 2714 states have internal predecessors, (3040), 833 states have call successors, (833), 384 states have call predecessors, (833), 381 states have return successors, (833), 807 states have call predecessors, (833), 831 states have call successors, (833) [2025-02-06 08:27:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 4706 transitions. [2025-02-06 08:27:53,818 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 4706 transitions. Word has length 138 [2025-02-06 08:27:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:53,820 INFO L471 AbstractCegarLoop]: Abstraction has 3858 states and 4706 transitions. [2025-02-06 08:27:53,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 08:27:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 4706 transitions. [2025-02-06 08:27:53,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 08:27:53,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:53,822 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:53,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 08:27:53,822 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_check_for_read_sectionErr2ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:53,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:53,823 INFO L85 PathProgramCache]: Analyzing trace with hash -752344965, now seen corresponding path program 1 times [2025-02-06 08:27:53,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:53,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528037328] [2025-02-06 08:27:53,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:53,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:54,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 08:27:54,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 08:27:54,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:54,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-02-06 08:27:54,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:54,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528037328] [2025-02-06 08:27:54,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528037328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:54,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:54,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:54,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581411091] [2025-02-06 08:27:54,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:54,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:54,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:54,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:54,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:54,375 INFO L87 Difference]: Start difference. First operand 3858 states and 4706 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 08:27:54,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:54,551 INFO L93 Difference]: Finished difference Result 3858 states and 4706 transitions. [2025-02-06 08:27:54,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:54,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 150 [2025-02-06 08:27:54,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:54,565 INFO L225 Difference]: With dead ends: 3858 [2025-02-06 08:27:54,565 INFO L226 Difference]: Without dead ends: 3856 [2025-02-06 08:27:54,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:54,568 INFO L435 NwaCegarLoop]: 1363 mSDtfsCounter, 1329 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:54,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 2725 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:54,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2025-02-06 08:27:54,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 3856. [2025-02-06 08:27:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3856 states, 2622 states have (on average 1.1559877955758964) internal successors, (3031), 2712 states have internal predecessors, (3031), 833 states have call successors, (833), 384 states have call predecessors, (833), 381 states have return successors, (833), 807 states have call predecessors, (833), 831 states have call successors, (833) [2025-02-06 08:27:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3856 states to 3856 states and 4697 transitions. [2025-02-06 08:27:54,753 INFO L78 Accepts]: Start accepts. Automaton has 3856 states and 4697 transitions. Word has length 150 [2025-02-06 08:27:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:54,754 INFO L471 AbstractCegarLoop]: Abstraction has 3856 states and 4697 transitions. [2025-02-06 08:27:54,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 08:27:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3856 states and 4697 transitions. [2025-02-06 08:27:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:27:54,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:54,756 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:54,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 08:27:54,757 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_check_for_read_sectionErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:27:54,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:54,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1968457188, now seen corresponding path program 1 times [2025-02-06 08:27:54,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:54,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011762275] [2025-02-06 08:27:54,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:54,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:55,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:27:55,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:27:55,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:55,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-06 08:27:56,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:56,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011762275] [2025-02-06 08:27:56,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011762275] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:27:56,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758935210] [2025-02-06 08:27:56,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:56,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:27:56,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:27:56,148 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:27:56,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 08:27:57,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:27:57,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:27:57,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:57,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:57,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 1773 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 08:27:57,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:27:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-02-06 08:27:58,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:27:58,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758935210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:58,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:27:58,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 20 [2025-02-06 08:27:58,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669148933] [2025-02-06 08:27:58,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:58,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:27:58,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:58,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:27:58,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-02-06 08:27:58,209 INFO L87 Difference]: Start difference. First operand 3856 states and 4697 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 08:28:02,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:28:06,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:28:10,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:28:14,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:28:14,163 INFO L93 Difference]: Finished difference Result 4816 states and 5839 transitions. [2025-02-06 08:28:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:28:14,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 153 [2025-02-06 08:28:14,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:28:14,179 INFO L225 Difference]: With dead ends: 4816 [2025-02-06 08:28:14,179 INFO L226 Difference]: Without dead ends: 4814 [2025-02-06 08:28:14,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2025-02-06 08:28:14,183 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 2302 mSDsluCounter, 4308 mSDsCounter, 0 mSdLazyCounter, 2633 mSolverCounterSat, 591 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2416 SdHoareTripleChecker+Valid, 5165 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2633 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:28:14,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2416 Valid, 5165 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2633 Invalid, 3 Unknown, 0 Unchecked, 15.6s Time] [2025-02-06 08:28:14,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4814 states. [2025-02-06 08:28:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4814 to 4580. [2025-02-06 08:28:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4580 states, 3111 states have (on average 1.159755705560913) internal successors, (3608), 3216 states have internal predecessors, (3608), 1000 states have call successors, (1000), 452 states have call predecessors, (1000), 449 states have return successors, (1002), 969 states have call predecessors, (1002), 998 states have call successors, (1002) [2025-02-06 08:28:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4580 states to 4580 states and 5610 transitions. [2025-02-06 08:28:14,398 INFO L78 Accepts]: Start accepts. Automaton has 4580 states and 5610 transitions. Word has length 153 [2025-02-06 08:28:14,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:28:14,399 INFO L471 AbstractCegarLoop]: Abstraction has 4580 states and 5610 transitions. [2025-02-06 08:28:14,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 08:28:14,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4580 states and 5610 transitions. [2025-02-06 08:28:14,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 08:28:14,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:28:14,401 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:28:14,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 08:28:14,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:28:14,605 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:28:14,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:28:14,606 INFO L85 PathProgramCache]: Analyzing trace with hash 658445578, now seen corresponding path program 1 times [2025-02-06 08:28:14,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:28:14,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439041613] [2025-02-06 08:28:14,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:28:14,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:28:14,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 08:28:14,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 08:28:14,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:28:14,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:28:15,109 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:28:15,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:28:15,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439041613] [2025-02-06 08:28:15,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439041613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:28:15,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:28:15,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:28:15,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508356308] [2025-02-06 08:28:15,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:28:15,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:28:15,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:28:15,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:28:15,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:28:15,110 INFO L87 Difference]: Start difference. First operand 4580 states and 5610 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 08:28:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:28:15,309 INFO L93 Difference]: Finished difference Result 4580 states and 5610 transitions. [2025-02-06 08:28:15,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:28:15,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 144 [2025-02-06 08:28:15,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:28:15,324 INFO L225 Difference]: With dead ends: 4580 [2025-02-06 08:28:15,324 INFO L226 Difference]: Without dead ends: 4578 [2025-02-06 08:28:15,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:28:15,327 INFO L435 NwaCegarLoop]: 1361 mSDtfsCounter, 1319 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 2721 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:28:15,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 2721 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:28:15,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4578 states. [2025-02-06 08:28:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4578 to 4578. [2025-02-06 08:28:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4578 states, 3110 states have (on average 1.1591639871382637) internal successors, (3605), 3214 states have internal predecessors, (3605), 1000 states have call successors, (1000), 452 states have call predecessors, (1000), 449 states have return successors, (1002), 969 states have call predecessors, (1002), 998 states have call successors, (1002) [2025-02-06 08:28:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4578 states to 4578 states and 5607 transitions. [2025-02-06 08:28:15,599 INFO L78 Accepts]: Start accepts. Automaton has 4578 states and 5607 transitions. Word has length 144 [2025-02-06 08:28:15,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:28:15,599 INFO L471 AbstractCegarLoop]: Abstraction has 4578 states and 5607 transitions. [2025-02-06 08:28:15,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 08:28:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 4578 states and 5607 transitions. [2025-02-06 08:28:15,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 08:28:15,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:28:15,601 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:28:15,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 08:28:15,602 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_check_for_read_sectionErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:28:15,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:28:15,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1176408531, now seen corresponding path program 1 times [2025-02-06 08:28:15,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:28:15,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6929493] [2025-02-06 08:28:15,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:28:15,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:28:15,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 08:28:15,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 08:28:15,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:28:15,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:28:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-02-06 08:28:16,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:28:16,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6929493] [2025-02-06 08:28:16,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6929493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:28:16,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:28:16,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:28:16,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565541417] [2025-02-06 08:28:16,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:28:16,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:28:16,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:28:16,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:28:16,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:28:16,093 INFO L87 Difference]: Start difference. First operand 4578 states and 5607 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 08:28:16,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:28:16,298 INFO L93 Difference]: Finished difference Result 4578 states and 5607 transitions. [2025-02-06 08:28:16,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:28:16,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-02-06 08:28:16,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:28:16,312 INFO L225 Difference]: With dead ends: 4578 [2025-02-06 08:28:16,312 INFO L226 Difference]: Without dead ends: 4576 [2025-02-06 08:28:16,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:28:16,314 INFO L435 NwaCegarLoop]: 1359 mSDtfsCounter, 1319 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:28:16,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 2717 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:28:16,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2025-02-06 08:28:16,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 4576. [2025-02-06 08:28:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4576 states, 3109 states have (on average 1.1559987134126728) internal successors, (3594), 3212 states have internal predecessors, (3594), 1000 states have call successors, (1000), 452 states have call predecessors, (1000), 449 states have return successors, (1002), 969 states have call predecessors, (1002), 998 states have call successors, (1002) [2025-02-06 08:28:16,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4576 states to 4576 states and 5596 transitions. [2025-02-06 08:28:16,725 INFO L78 Accepts]: Start accepts. Automaton has 4576 states and 5596 transitions. Word has length 156 [2025-02-06 08:28:16,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:28:16,726 INFO L471 AbstractCegarLoop]: Abstraction has 4576 states and 5596 transitions. [2025-02-06 08:28:16,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 08:28:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 4576 states and 5596 transitions. [2025-02-06 08:28:16,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 08:28:16,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:28:16,728 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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] [2025-02-06 08:28:16,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 08:28:16,729 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:28:16,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:28:16,729 INFO L85 PathProgramCache]: Analyzing trace with hash 542750624, now seen corresponding path program 1 times [2025-02-06 08:28:16,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:28:16,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668890080] [2025-02-06 08:28:16,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:28:16,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:28:17,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 08:28:17,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 08:28:17,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:28:17,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:28:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:28:17,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:28:17,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668890080] [2025-02-06 08:28:17,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668890080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:28:17,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:28:17,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:28:17,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890252282] [2025-02-06 08:28:17,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:28:17,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:28:17,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:28:17,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:28:17,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:28:17,294 INFO L87 Difference]: Start difference. First operand 4576 states and 5596 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-06 08:28:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:28:17,516 INFO L93 Difference]: Finished difference Result 4576 states and 5596 transitions. [2025-02-06 08:28:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:28:17,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 150 [2025-02-06 08:28:17,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:28:17,532 INFO L225 Difference]: With dead ends: 4576 [2025-02-06 08:28:17,532 INFO L226 Difference]: Without dead ends: 4574 [2025-02-06 08:28:17,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:28:17,534 INFO L435 NwaCegarLoop]: 1358 mSDtfsCounter, 1314 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 2715 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:28:17,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 2715 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:28:17,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2025-02-06 08:28:17,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4574. [2025-02-06 08:28:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4574 states, 3108 states have (on average 1.1554054054054055) internal successors, (3591), 3210 states have internal predecessors, (3591), 1000 states have call successors, (1000), 452 states have call predecessors, (1000), 449 states have return successors, (1002), 969 states have call predecessors, (1002), 998 states have call successors, (1002) [2025-02-06 08:28:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 5593 transitions. [2025-02-06 08:28:17,804 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 5593 transitions. Word has length 150 [2025-02-06 08:28:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:28:17,804 INFO L471 AbstractCegarLoop]: Abstraction has 4574 states and 5593 transitions. [2025-02-06 08:28:17,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-06 08:28:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 5593 transitions. [2025-02-06 08:28:17,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-06 08:28:17,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:28:17,807 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:28:17,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 08:28:17,807 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:28:17,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:28:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1032797975, now seen corresponding path program 2 times [2025-02-06 08:28:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:28:17,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474930537] [2025-02-06 08:28:17,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:28:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:28:18,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 161 statements into 2 equivalence classes. [2025-02-06 08:28:18,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 161 statements. [2025-02-06 08:28:18,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:28:18,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:28:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-02-06 08:28:18,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:28:18,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474930537] [2025-02-06 08:28:18,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474930537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:28:18,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:28:18,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:28:18,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013324880] [2025-02-06 08:28:18,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:28:18,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:28:18,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:28:18,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:28:18,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:28:18,269 INFO L87 Difference]: Start difference. First operand 4574 states and 5593 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 08:28:22,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 08:28:22,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:28:22,603 INFO L93 Difference]: Finished difference Result 4600 states and 5614 transitions. [2025-02-06 08:28:22,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:28:22,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 161 [2025-02-06 08:28:22,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:28:22,617 INFO L225 Difference]: With dead ends: 4600 [2025-02-06 08:28:22,617 INFO L226 Difference]: Without dead ends: 4598 [2025-02-06 08:28:22,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:28:22,619 INFO L435 NwaCegarLoop]: 1416 mSDtfsCounter, 351 mSDsluCounter, 4012 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 5428 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:28:22,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 5428 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 08:28:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4598 states. [2025-02-06 08:28:22,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4598 to 4590. [2025-02-06 08:28:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4590 states, 3120 states have (on average 1.1548076923076922) internal successors, (3603), 3222 states have internal predecessors, (3603), 1000 states have call successors, (1000), 456 states have call predecessors, (1000), 453 states have return successors, (1002), 969 states have call predecessors, (1002), 998 states have call successors, (1002) [2025-02-06 08:28:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4590 states to 4590 states and 5605 transitions. [2025-02-06 08:28:22,912 INFO L78 Accepts]: Start accepts. Automaton has 4590 states and 5605 transitions. Word has length 161 [2025-02-06 08:28:22,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:28:22,913 INFO L471 AbstractCegarLoop]: Abstraction has 4590 states and 5605 transitions. [2025-02-06 08:28:22,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 08:28:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4590 states and 5605 transitions. [2025-02-06 08:28:22,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 08:28:22,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:28:22,915 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 3, 3, 3, 2, 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, 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, 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, 1, 1, 1, 1, 1] [2025-02-06 08:28:22,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 08:28:22,915 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:28:22,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:28:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1547680055, now seen corresponding path program 1 times [2025-02-06 08:28:22,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:28:22,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983680889] [2025-02-06 08:28:22,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:28:22,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:28:23,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 08:28:23,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 08:28:23,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:28:23,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:28:23,498 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-06 08:28:23,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:28:23,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983680889] [2025-02-06 08:28:23,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983680889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:28:23,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:28:23,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:28:23,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306890195] [2025-02-06 08:28:23,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:28:23,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:28:23,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:28:23,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:28:23,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:28:23,500 INFO L87 Difference]: Start difference. First operand 4590 states and 5605 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 08:28:23,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:28:23,770 INFO L93 Difference]: Finished difference Result 4829 states and 5834 transitions. [2025-02-06 08:28:23,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:28:23,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 175 [2025-02-06 08:28:23,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:28:23,785 INFO L225 Difference]: With dead ends: 4829 [2025-02-06 08:28:23,785 INFO L226 Difference]: Without dead ends: 4827 [2025-02-06 08:28:23,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:28:23,787 INFO L435 NwaCegarLoop]: 1389 mSDtfsCounter, 1185 mSDsluCounter, 2968 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 4357 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:28:23,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 4357 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:28:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2025-02-06 08:28:24,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 4823. [2025-02-06 08:28:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4823 states, 3295 states have (on average 1.1493171471927162) internal successors, (3787), 3396 states have internal predecessors, (3787), 1016 states have call successors, (1016), 499 states have call predecessors, (1016), 496 states have return successors, (1018), 985 states have call predecessors, (1018), 1014 states have call successors, (1018) [2025-02-06 08:28:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 5821 transitions. [2025-02-06 08:28:24,103 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 5821 transitions. Word has length 175 [2025-02-06 08:28:24,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:28:24,104 INFO L471 AbstractCegarLoop]: Abstraction has 4823 states and 5821 transitions. [2025-02-06 08:28:24,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 08:28:24,104 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 5821 transitions. [2025-02-06 08:28:24,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 08:28:24,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:28:24,106 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2025-02-06 08:28:24,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 08:28:24,106 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:28:24,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:28:24,106 INFO L85 PathProgramCache]: Analyzing trace with hash -878115501, now seen corresponding path program 1 times [2025-02-06 08:28:24,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:28:24,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501161919] [2025-02-06 08:28:24,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:28:24,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:28:24,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 08:28:24,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 08:28:24,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:28:24,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:28:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 08:28:24,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:28:24,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501161919] [2025-02-06 08:28:24,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501161919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:28:24,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:28:24,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:28:24,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941849791] [2025-02-06 08:28:24,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:28:24,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:28:24,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:28:24,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:28:24,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:28:24,697 INFO L87 Difference]: Start difference. First operand 4823 states and 5821 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 08:28:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:28:24,981 INFO L93 Difference]: Finished difference Result 4823 states and 5821 transitions. [2025-02-06 08:28:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:28:24,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 156 [2025-02-06 08:28:24,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:28:24,994 INFO L225 Difference]: With dead ends: 4823 [2025-02-06 08:28:24,995 INFO L226 Difference]: Without dead ends: 4821 [2025-02-06 08:28:24,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:28:24,997 INFO L435 NwaCegarLoop]: 1354 mSDtfsCounter, 1309 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:28:24,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 2707 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:28:25,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4821 states. [2025-02-06 08:28:25,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4821 to 4821. [2025-02-06 08:28:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4821 states, 3294 states have (on average 1.148755312689739) internal successors, (3784), 3394 states have internal predecessors, (3784), 1016 states have call successors, (1016), 499 states have call predecessors, (1016), 496 states have return successors, (1018), 985 states have call predecessors, (1018), 1014 states have call successors, (1018) [2025-02-06 08:28:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4821 states to 4821 states and 5818 transitions. [2025-02-06 08:28:25,264 INFO L78 Accepts]: Start accepts. Automaton has 4821 states and 5818 transitions. Word has length 156 [2025-02-06 08:28:25,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:28:25,265 INFO L471 AbstractCegarLoop]: Abstraction has 4821 states and 5818 transitions. [2025-02-06 08:28:25,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 08:28:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 4821 states and 5818 transitions. [2025-02-06 08:28:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-06 08:28:25,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:28:25,267 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:28:25,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 08:28:25,267 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting nfnl_log_pernetErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-02-06 08:28:25,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:28:25,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1637801239, now seen corresponding path program 1 times [2025-02-06 08:28:25,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:28:25,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216897541] [2025-02-06 08:28:25,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:28:25,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:28:25,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-06 08:28:25,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 08:28:25,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:28:25,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:28:26,025 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-02-06 08:28:26,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:28:26,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216897541] [2025-02-06 08:28:26,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216897541] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:28:26,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847655984] [2025-02-06 08:28:26,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:28:26,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:28:26,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:28:26,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:28:26,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 08:28:27,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-06 08:28:27,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 08:28:27,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:28:27,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:28:27,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1908 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 08:28:27,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:28:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-02-06 08:28:28,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:28:29,051 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-02-06 08:28:29,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847655984] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:28:29,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:28:29,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2025-02-06 08:28:29,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575458692] [2025-02-06 08:28:29,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:28:29,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 08:28:29,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:28:29,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 08:28:29,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-02-06 08:28:29,055 INFO L87 Difference]: Start difference. First operand 4821 states and 5818 transitions. Second operand has 14 states, 14 states have (on average 10.071428571428571) internal successors, (141), 13 states have internal predecessors, (141), 10 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (47), 10 states have call predecessors, (47), 10 states have call successors, (47)