./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6fbcf05da5228307460c10a1ab2d8431ff74359811f7e2c9b55e8eaa9db8f14c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 05:53:53,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 05:53:53,362 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 05:53:53,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 05:53:53,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 05:53:53,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 05:53:53,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 05:53:53,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 05:53:53,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 05:53:53,386 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 05:53:53,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 05:53:53,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 05:53:53,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 05:53:53,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 05:53:53,387 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 05:53:53,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 05:53:53,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 05:53:53,388 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 05:53:53,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 05:53:53,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 05:53:53,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 05:53:53,388 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 05:53:53,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 05:53:53,388 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 05:53:53,388 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 05:53:53,388 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 05:53:53,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 05:53:53,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 05:53:53,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 05:53:53,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:53:53,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 05:53:53,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 05:53:53,389 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 05:53:53,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 05:53:53,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 05:53:53,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 05:53:53,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 05:53:53,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 05:53:53,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 05:53:53,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 05:53:53,389 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/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 -> 6fbcf05da5228307460c10a1ab2d8431ff74359811f7e2c9b55e8eaa9db8f14c [2025-03-04 05:53:53,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 05:53:53,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 05:53:53,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 05:53:53,646 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 05:53:53,646 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 05:53:53,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2025-03-04 05:53:54,805 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1565a6f63/1152e115f0cd430aa71516f2f8acb434/FLAGc369ab461 [2025-03-04 05:53:55,256 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 05:53:55,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2025-03-04 05:53:55,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1565a6f63/1152e115f0cd430aa71516f2f8acb434/FLAGc369ab461 [2025-03-04 05:53:55,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1565a6f63/1152e115f0cd430aa71516f2f8acb434 [2025-03-04 05:53:55,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 05:53:55,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 05:53:55,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 05:53:55,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 05:53:55,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 05:53:55,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:53:55" (1/1) ... [2025-03-04 05:53:55,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@165efa66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:53:55, skipping insertion in model container [2025-03-04 05:53:55,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:53:55" (1/1) ... [2025-03-04 05:53:55,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 05:53:57,499 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307309,307322] [2025-03-04 05:53:57,502 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307454,307467] [2025-03-04 05:53:57,502 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307600,307613] [2025-03-04 05:53:57,502 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307765,307778] [2025-03-04 05:53:57,502 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307923,307936] [2025-03-04 05:53:57,503 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308081,308094] [2025-03-04 05:53:57,503 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308239,308252] [2025-03-04 05:53:57,503 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308399,308412] [2025-03-04 05:53:57,503 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308558,308571] [2025-03-04 05:53:57,503 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308697,308710] [2025-03-04 05:53:57,504 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308839,308852] [2025-03-04 05:53:57,504 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308988,309001] [2025-03-04 05:53:57,504 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309127,309140] [2025-03-04 05:53:57,504 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309282,309295] [2025-03-04 05:53:57,504 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309442,309455] [2025-03-04 05:53:57,504 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309593,309606] [2025-03-04 05:53:57,504 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309744,309757] [2025-03-04 05:53:57,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309896,309909] [2025-03-04 05:53:57,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310045,310058] [2025-03-04 05:53:57,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310193,310206] [2025-03-04 05:53:57,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310350,310363] [2025-03-04 05:53:57,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310499,310512] [2025-03-04 05:53:57,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310655,310668] [2025-03-04 05:53:57,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310808,310821] [2025-03-04 05:53:57,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310954,310967] [2025-03-04 05:53:57,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311097,311110] [2025-03-04 05:53:57,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311249,311262] [2025-03-04 05:53:57,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311395,311408] [2025-03-04 05:53:57,507 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311540,311553] [2025-03-04 05:53:57,507 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311694,311707] [2025-03-04 05:53:57,507 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311845,311858] [2025-03-04 05:53:57,507 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312000,312013] [2025-03-04 05:53:57,508 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312152,312165] [2025-03-04 05:53:57,508 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312307,312320] [2025-03-04 05:53:57,508 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312471,312484] [2025-03-04 05:53:57,508 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312627,312640] [2025-03-04 05:53:57,509 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312791,312804] [2025-03-04 05:53:57,509 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312933,312946] [2025-03-04 05:53:57,509 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313091,313104] [2025-03-04 05:53:57,509 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313258,313271] [2025-03-04 05:53:57,509 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313417,313430] [2025-03-04 05:53:57,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313576,313589] [2025-03-04 05:53:57,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313725,313738] [2025-03-04 05:53:57,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313872,313885] [2025-03-04 05:53:57,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314011,314024] [2025-03-04 05:53:57,511 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314174,314187] [2025-03-04 05:53:57,511 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314340,314353] [2025-03-04 05:53:57,511 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314504,314517] [2025-03-04 05:53:57,511 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314669,314682] [2025-03-04 05:53:57,511 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314834,314847] [2025-03-04 05:53:57,511 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315000,315013] [2025-03-04 05:53:57,512 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315165,315178] [2025-03-04 05:53:57,512 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315332,315345] [2025-03-04 05:53:57,512 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315492,315505] [2025-03-04 05:53:57,512 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315654,315667] [2025-03-04 05:53:57,512 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315813,315826] [2025-03-04 05:53:57,512 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315959,315972] [2025-03-04 05:53:57,512 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316102,316115] [2025-03-04 05:53:57,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316246,316259] [2025-03-04 05:53:57,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316389,316402] [2025-03-04 05:53:57,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316533,316546] [2025-03-04 05:53:57,514 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316674,316687] [2025-03-04 05:53:57,514 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316812,316825] [2025-03-04 05:53:57,514 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316970,316983] [2025-03-04 05:53:57,515 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317129,317142] [2025-03-04 05:53:57,515 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317285,317298] [2025-03-04 05:53:57,515 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317434,317447] [2025-03-04 05:53:57,515 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317586,317599] [2025-03-04 05:53:57,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317737,317750] [2025-03-04 05:53:57,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317886,317899] [2025-03-04 05:53:57,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318038,318051] [2025-03-04 05:53:57,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318186,318199] [2025-03-04 05:53:57,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318339,318352] [2025-03-04 05:53:57,517 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318490,318503] [2025-03-04 05:53:57,517 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318640,318653] [2025-03-04 05:53:57,517 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318787,318800] [2025-03-04 05:53:57,517 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318938,318951] [2025-03-04 05:53:57,517 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319089,319102] [2025-03-04 05:53:57,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319237,319250] [2025-03-04 05:53:57,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319403,319416] [2025-03-04 05:53:57,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319572,319585] [2025-03-04 05:53:57,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319739,319752] [2025-03-04 05:53:57,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319907,319920] [2025-03-04 05:53:57,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320057,320070] [2025-03-04 05:53:57,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320204,320217] [2025-03-04 05:53:57,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320365,320378] [2025-03-04 05:53:57,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320535,320548] [2025-03-04 05:53:57,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320697,320710] [2025-03-04 05:53:57,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:53:57,548 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 05:53:57,632 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; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4177] [2025-03-04 05:53:57,633 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; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4184] [2025-03-04 05:53:57,633 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [4191] [2025-03-04 05:53:57,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307309,307322] [2025-03-04 05:53:57,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307454,307467] [2025-03-04 05:53:57,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307600,307613] [2025-03-04 05:53:57,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307765,307778] [2025-03-04 05:53:57,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307923,307936] [2025-03-04 05:53:57,765 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308081,308094] [2025-03-04 05:53:57,765 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308239,308252] [2025-03-04 05:53:57,765 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308399,308412] [2025-03-04 05:53:57,766 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308558,308571] [2025-03-04 05:53:57,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308697,308710] [2025-03-04 05:53:57,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308839,308852] [2025-03-04 05:53:57,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308988,309001] [2025-03-04 05:53:57,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309127,309140] [2025-03-04 05:53:57,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309282,309295] [2025-03-04 05:53:57,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309442,309455] [2025-03-04 05:53:57,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309593,309606] [2025-03-04 05:53:57,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309744,309757] [2025-03-04 05:53:57,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309896,309909] [2025-03-04 05:53:57,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310045,310058] [2025-03-04 05:53:57,769 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310193,310206] [2025-03-04 05:53:57,769 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310350,310363] [2025-03-04 05:53:57,769 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310499,310512] [2025-03-04 05:53:57,769 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310655,310668] [2025-03-04 05:53:57,799 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310808,310821] [2025-03-04 05:53:57,799 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310954,310967] [2025-03-04 05:53:57,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311097,311110] [2025-03-04 05:53:57,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311249,311262] [2025-03-04 05:53:57,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311395,311408] [2025-03-04 05:53:57,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311540,311553] [2025-03-04 05:53:57,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311694,311707] [2025-03-04 05:53:57,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311845,311858] [2025-03-04 05:53:57,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312000,312013] [2025-03-04 05:53:57,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312152,312165] [2025-03-04 05:53:57,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312307,312320] [2025-03-04 05:53:57,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312471,312484] [2025-03-04 05:53:57,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312627,312640] [2025-03-04 05:53:57,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312791,312804] [2025-03-04 05:53:57,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312933,312946] [2025-03-04 05:53:57,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313091,313104] [2025-03-04 05:53:57,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313258,313271] [2025-03-04 05:53:57,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313417,313430] [2025-03-04 05:53:57,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313576,313589] [2025-03-04 05:53:57,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313725,313738] [2025-03-04 05:53:57,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313872,313885] [2025-03-04 05:53:57,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314011,314024] [2025-03-04 05:53:57,804 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314174,314187] [2025-03-04 05:53:57,804 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314340,314353] [2025-03-04 05:53:57,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314504,314517] [2025-03-04 05:53:57,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314669,314682] [2025-03-04 05:53:57,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314834,314847] [2025-03-04 05:53:57,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315000,315013] [2025-03-04 05:53:57,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315165,315178] [2025-03-04 05:53:57,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315332,315345] [2025-03-04 05:53:57,806 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315492,315505] [2025-03-04 05:53:57,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315654,315667] [2025-03-04 05:53:57,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315813,315826] [2025-03-04 05:53:57,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315959,315972] [2025-03-04 05:53:57,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316102,316115] [2025-03-04 05:53:57,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316246,316259] [2025-03-04 05:53:57,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316389,316402] [2025-03-04 05:53:57,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316533,316546] [2025-03-04 05:53:57,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316674,316687] [2025-03-04 05:53:57,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316812,316825] [2025-03-04 05:53:57,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316970,316983] [2025-03-04 05:53:57,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317129,317142] [2025-03-04 05:53:57,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317285,317298] [2025-03-04 05:53:57,810 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317434,317447] [2025-03-04 05:53:57,810 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317586,317599] [2025-03-04 05:53:57,810 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317737,317750] [2025-03-04 05:53:57,810 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317886,317899] [2025-03-04 05:53:57,810 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318038,318051] [2025-03-04 05:53:57,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318186,318199] [2025-03-04 05:53:57,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318339,318352] [2025-03-04 05:53:57,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318490,318503] [2025-03-04 05:53:57,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318640,318653] [2025-03-04 05:53:57,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318787,318800] [2025-03-04 05:53:57,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318938,318951] [2025-03-04 05:53:57,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319089,319102] [2025-03-04 05:53:57,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319237,319250] [2025-03-04 05:53:57,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319403,319416] [2025-03-04 05:53:57,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319572,319585] [2025-03-04 05:53:57,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319739,319752] [2025-03-04 05:53:57,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319907,319920] [2025-03-04 05:53:57,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320057,320070] [2025-03-04 05:53:57,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320204,320217] [2025-03-04 05:53:57,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320365,320378] [2025-03-04 05:53:57,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320535,320548] [2025-03-04 05:53:57,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320697,320710] [2025-03-04 05:53:57,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:53:57,931 INFO L204 MainTranslator]: Completed translation [2025-03-04 05:53:57,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:53:57 WrapperNode [2025-03-04 05:53:57,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 05:53:57,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 05:53:57,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 05:53:57,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 05:53:57,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:53:57" (1/1) ... [2025-03-04 05:53:58,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:53:57" (1/1) ... [2025-03-04 05:53:58,106 INFO L138 Inliner]: procedures = 592, calls = 1952, calls flagged for inlining = 265, calls inlined = 171, statements flattened = 3426 [2025-03-04 05:53:58,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 05:53:58,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 05:53:58,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 05:53:58,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 05:53:58,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:53:57" (1/1) ... [2025-03-04 05:53:58,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:53:57" (1/1) ... [2025-03-04 05:53:58,126 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:53:57" (1/1) ... [2025-03-04 05:53:58,493 INFO L175 MemorySlicer]: Split 593 memory accesses to 24 slices as follows [2, 8, 8, 10, 7, 2, 8, 3, 8, 8, 8, 8, 1, 23, 2, 8, 31, 56, 4, 22, 8, 4, 49, 305]. 51 percent of accesses are in the largest equivalence class. The 181 initializations are split as follows [0, 8, 8, 10, 0, 0, 8, 0, 8, 8, 8, 8, 1, 0, 2, 8, 0, 56, 4, 0, 8, 0, 0, 36]. The 239 writes are split as follows [1, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 23, 0, 0, 31, 0, 0, 22, 0, 1, 42, 113]. [2025-03-04 05:53:58,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:53:57" (1/1) ... [2025-03-04 05:53:58,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:53:57" (1/1) ... [2025-03-04 05:53:58,569 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:53:57" (1/1) ... [2025-03-04 05:53:58,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:53:57" (1/1) ... [2025-03-04 05:53:58,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:53:57" (1/1) ... [2025-03-04 05:53:58,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:53:57" (1/1) ... [2025-03-04 05:53:58,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 05:53:58,627 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 05:53:58,627 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 05:53:58,627 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 05:53:58,628 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:53:57" (1/1) ... [2025-03-04 05:53:58,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:53:58,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:53:58,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 05:53:58,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 05:53:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure recover_from_urb_loss [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure recover_from_urb_loss [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_control_urb [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_control_urb [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_ioctl [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_ioctl [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2025-03-04 05:53:58,702 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2025-03-04 05:53:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-04 05:53:58,703 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2025-03-04 05:53:58,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 05:53:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-03-04 05:53:58,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-04 05:53:58,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_111 [2025-03-04 05:53:58,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_111 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-04 05:53:58,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2025-03-04 05:53:58,706 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-03-04 05:53:58,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-03-04 05:53:58,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-03-04 05:53:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-03-04 05:53:58,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-03-04 05:53:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2025-03-04 05:53:58,707 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2025-03-04 05:53:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2025-03-04 05:53:58,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2025-03-04 05:53:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-03-04 05:53:58,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-03-04 05:53:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure kill_urbs [2025-03-04 05:53:58,707 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_urbs [2025-03-04 05:53:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2025-03-04 05:53:58,707 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2025-03-04 05:53:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-03-04 05:53:58,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-03-04 05:53:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-03-04 05:53:58,707 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-03-04 05:53:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-03-04 05:53:58,707 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-03-04 05:53:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-04 05:53:58,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-04 05:53:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 05:53:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2025-03-04 05:53:58,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2025-03-04 05:53:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 05:53:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-04 05:53:58,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-04 05:53:58,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 05:53:58,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 05:53:58,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 05:53:58,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 05:53:58,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 05:53:58,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-03-04 05:53:58,710 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-03-04 05:53:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-04 05:53:58,710 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-03-04 05:53:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-03-04 05:53:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_find_device [2025-03-04 05:53:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_find_device [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-04 05:53:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2025-03-04 05:53:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-03-04 05:53:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 05:53:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure usb_translate_errors [2025-03-04 05:53:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_translate_errors [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 05:53:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-04 05:53:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_create [2025-03-04 05:53:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_create [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_128 [2025-03-04 05:53:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_128 [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-03-04 05:53:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2025-03-04 05:53:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure clear_wdm_read_flag [2025-03-04 05:53:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_wdm_read_flag [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-03-04 05:53:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 05:53:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-04 05:53:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-04 05:53:58,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-04 05:53:58,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-04 05:53:58,712 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_disconnect [2025-03-04 05:53:58,712 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_disconnect [2025-03-04 05:53:58,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2025-03-04 05:53:58,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-04 05:53:58,713 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-04 05:53:58,713 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-04 05:53:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-03-04 05:53:58,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-03-04 05:53:58,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-04 05:53:58,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-04 05:53:58,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2025-03-04 05:53:58,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2025-03-04 05:53:58,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-04 05:53:58,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-04 05:53:58,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 05:53:58,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 05:53:58,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-03-04 05:53:58,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-03-04 05:53:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-03-04 05:53:58,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-03-04 05:53:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-04 05:53:58,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-04 05:53:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-04 05:53:58,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-04 05:53:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-03-04 05:53:58,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-03-04 05:53:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-03-04 05:53:58,717 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-04 05:53:58,718 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-04 05:53:58,718 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2025-03-04 05:53:58,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-04 05:53:58,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 05:53:58,718 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-04 05:53:58,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-04 05:53:58,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-04 05:53:58,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 05:53:58,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_95 [2025-03-04 05:53:58,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_95 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_resume [2025-03-04 05:53:58,719 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_resume [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-04 05:53:58,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_96 [2025-03-04 05:53:58,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_96 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2025-03-04 05:53:58,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-03-04 05:53:58,719 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-04 05:53:58,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-04 05:53:58,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-04 05:53:58,719 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-04 05:53:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-04 05:53:58,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-04 05:53:58,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2025-03-04 05:53:58,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2025-03-04 05:53:58,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_110 [2025-03-04 05:53:58,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_110 [2025-03-04 05:53:59,271 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 05:53:59,275 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 05:53:59,307 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 05:53:59,341 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7795: havoc ldv_usb_submit_urb_171_#t~nondet522#1; [2025-03-04 05:53:59,449 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12674: havoc #t~nondet708; [2025-03-04 05:53:59,808 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4389: havoc usb_endpoint_dir_in_#t~mem61#1; [2025-03-04 05:53:59,808 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12690: havoc usb_register_dev_#t~nondet709#1; [2025-03-04 05:53:59,808 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4383: havoc kobject_name_#t~mem60#1.base, kobject_name_#t~mem60#1.offset; [2025-03-04 05:53:59,808 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4425: havoc usb_endpoint_maxp_#t~mem65#1; [2025-03-04 05:53:59,808 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6020: call ULTIMATE.dealloc(~#__key~0#1.base, ~#__key~0#1.offset);havoc ~#__key~0#1.base, ~#__key~0#1.offset;call ULTIMATE.dealloc(~#__key___0~0#1.base, ~#__key___0~0#1.offset);havoc ~#__key___0~0#1.base, ~#__key___0~0#1.offset;call ULTIMATE.dealloc(~#__key___1~0#1.base, ~#__key___1~0#1.offset);havoc ~#__key___1~0#1.base, ~#__key___1~0#1.offset;call ULTIMATE.dealloc(~#__key___2~0#1.base, ~#__key___2~0#1.offset);havoc ~#__key___2~0#1.base, ~#__key___2~0#1.offset;call ULTIMATE.dealloc(~#__key___3~0#1.base, ~#__key___3~0#1.offset);havoc ~#__key___3~0#1.base, ~#__key___3~0#1.offset;call ULTIMATE.dealloc(~#__constr_expr_0~0#1.base, ~#__constr_expr_0~0#1.offset);havoc ~#__constr_expr_0~0#1.base, ~#__constr_expr_0~0#1.offset; [2025-03-04 05:53:59,808 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4501: havoc dev_name_#t~mem81#1.base, dev_name_#t~mem81#1.offset; [2025-03-04 05:53:59,808 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4395: havoc usb_endpoint_xfer_int_#t~mem62#1; [2025-03-04 05:53:59,862 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7486: havoc ldv_usb_submit_urb_116_#t~nondet512#1; [2025-03-04 05:53:59,937 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6326: call ULTIMATE.dealloc(~#descriptor~6#1.base, ~#descriptor~6#1.offset);havoc ~#descriptor~6#1.base, ~#descriptor~6#1.offset; [2025-03-04 05:53:59,960 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12631: havoc #t~nondet704; [2025-03-04 05:53:59,999 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12605: havoc #t~nondet702; [2025-03-04 05:54:00,066 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4618: havoc #t~mem107;havoc #t~bitwise108; [2025-03-04 05:54:00,077 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4199: havoc #t~mem5;havoc #t~bitwise6; [2025-03-04 05:54:00,107 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12663: havoc #t~nondet706; [2025-03-04 05:54:00,171 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6487: call ULTIMATE.dealloc(~#descriptor~8.base, ~#descriptor~8.offset);havoc ~#descriptor~8.base, ~#descriptor~8.offset; [2025-03-04 05:54:00,182 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12609: havoc #t~nondet703; [2025-03-04 05:54:05,347 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12659: havoc noop_llseek_#t~nondet705#1; [2025-03-04 05:54:05,348 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5855: call ULTIMATE.dealloc(wdm_release_~#descriptor~4#1.base, wdm_release_~#descriptor~4#1.offset);havoc wdm_release_~#descriptor~4#1.base, wdm_release_~#descriptor~4#1.offset;call ULTIMATE.dealloc(wdm_release_~#descriptor___0~2#1.base, wdm_release_~#descriptor___0~2#1.offset);havoc wdm_release_~#descriptor___0~2#1.base, wdm_release_~#descriptor___0~2#1.offset; [2025-03-04 05:54:05,348 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5660: call ULTIMATE.dealloc(wdm_flush_~#__wait~2#1.base, wdm_flush_~#__wait~2#1.offset);havoc wdm_flush_~#__wait~2#1.base, wdm_flush_~#__wait~2#1.offset; [2025-03-04 05:54:05,348 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7847-1: ldv_usb_register_driver_178_#res#1 := ldv_usb_register_driver_178_~ldv_func_res~0#1; [2025-03-04 05:54:05,348 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7198-1: ldv_usb_register_driver_#res#1 := ldv_usb_register_driver_~arg0#1; [2025-03-04 05:54:05,348 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6208: call ULTIMATE.dealloc(wdm_probe_~#descriptor~5#1.base, wdm_probe_~#descriptor~5#1.offset);havoc wdm_probe_~#descriptor~5#1.base, wdm_probe_~#descriptor~5#1.offset; [2025-03-04 05:54:05,348 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7468: havoc ldv_usb_submit_urb_113_#t~nondet511#1; [2025-03-04 05:54:05,348 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12694: havoc usb_register_driver_#t~nondet710#1; [2025-03-04 05:54:05,348 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5433: call ULTIMATE.dealloc(wdm_read_~#__wait~1#1.base, wdm_read_~#__wait~1#1.offset);havoc wdm_read_~#__wait~1#1.base, wdm_read_~#__wait~1#1.offset;call ULTIMATE.dealloc(wdm_read_~#descriptor~3#1.base, wdm_read_~#descriptor~3#1.offset);havoc wdm_read_~#descriptor~3#1.base, wdm_read_~#descriptor~3#1.offset; [2025-03-04 05:54:05,348 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7552: havoc ldv_usb_submit_urb_132_#t~nondet514#1; [2025-03-04 05:54:05,348 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4515: havoc iminor_#t~mem87#1; [2025-03-04 05:54:05,348 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5184: call ULTIMATE.dealloc(wdm_write_~#__wait~0#1.base, wdm_write_~#__wait~0#1.offset);havoc wdm_write_~#__wait~0#1.base, wdm_write_~#__wait~0#1.offset;call ULTIMATE.dealloc(wdm_write_~#descriptor~2#1.base, wdm_write_~#descriptor~2#1.offset);havoc wdm_write_~#descriptor~2#1.base, wdm_write_~#descriptor~2#1.offset; [2025-03-04 05:54:05,348 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6377: call ULTIMATE.dealloc(wdm_suspend_~#message#1.base, wdm_suspend_~#message#1.offset);havoc wdm_suspend_~#message#1.base, wdm_suspend_~#message#1.offset;call ULTIMATE.dealloc(wdm_suspend_~#descriptor~7#1.base, wdm_suspend_~#descriptor~7#1.offset);havoc wdm_suspend_~#descriptor~7#1.base, wdm_suspend_~#descriptor~7#1.offset; [2025-03-04 05:54:05,832 INFO L? ?]: Removed 1503 outVars from TransFormulas that were not future-live. [2025-03-04 05:54:05,832 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 05:54:05,873 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 05:54:05,874 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 05:54:05,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:54:05 BoogieIcfgContainer [2025-03-04 05:54:05,874 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 05:54:05,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 05:54:05,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 05:54:05,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 05:54:05,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 05:53:55" (1/3) ... [2025-03-04 05:54:05,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdd1fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:54:05, skipping insertion in model container [2025-03-04 05:54:05,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:53:57" (2/3) ... [2025-03-04 05:54:05,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdd1fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:54:05, skipping insertion in model container [2025-03-04 05:54:05,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:54:05" (3/3) ... [2025-03-04 05:54:05,883 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2025-03-04 05:54:05,894 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 05:54:05,898 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i that has 98 procedures, 1415 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2025-03-04 05:54:05,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 05:54:05,976 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;@691ca3ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 05:54:05,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-04 05:54:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 1414 states, 888 states have (on average 1.2522522522522523) internal successors, (1112), 942 states have internal predecessors, (1112), 399 states have call successors, (399), 97 states have call predecessors, (399), 96 states have return successors, (394), 391 states have call predecessors, (394), 394 states have call successors, (394) [2025-03-04 05:54:05,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 05:54:05,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:05,988 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:05,988 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 28 more)] === [2025-03-04 05:54:05,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:05,991 INFO L85 PathProgramCache]: Analyzing trace with hash -279052911, now seen corresponding path program 1 times [2025-03-04 05:54:05,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:05,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603297131] [2025-03-04 05:54:05,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:05,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:07,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 05:54:07,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 05:54:07,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:07,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:54:08,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:08,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603297131] [2025-03-04 05:54:08,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603297131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:08,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:08,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007830262] [2025-03-04 05:54:08,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:08,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:08,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:08,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:08,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:08,206 INFO L87 Difference]: Start difference. First operand has 1414 states, 888 states have (on average 1.2522522522522523) internal successors, (1112), 942 states have internal predecessors, (1112), 399 states have call successors, (399), 97 states have call predecessors, (399), 96 states have return successors, (394), 391 states have call predecessors, (394), 394 states have call successors, (394) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-03-04 05:54:08,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:08,624 INFO L93 Difference]: Finished difference Result 2761 states and 3867 transitions. [2025-03-04 05:54:08,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:08,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 71 [2025-03-04 05:54:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:08,648 INFO L225 Difference]: With dead ends: 2761 [2025-03-04 05:54:08,648 INFO L226 Difference]: Without dead ends: 1396 [2025-03-04 05:54:08,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:08,660 INFO L435 NwaCegarLoop]: 1852 mSDtfsCounter, 1834 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1834 SdHoareTripleChecker+Valid, 3703 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:08,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1834 Valid, 3703 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:54:08,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2025-03-04 05:54:08,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1396. [2025-03-04 05:54:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 878 states have (on average 1.2095671981776766) internal successors, (1062), 927 states have internal predecessors, (1062), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-03-04 05:54:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1848 transitions. [2025-03-04 05:54:08,765 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1848 transitions. Word has length 71 [2025-03-04 05:54:08,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:08,766 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 1848 transitions. [2025-03-04 05:54:08,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-03-04 05:54:08,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1848 transitions. [2025-03-04 05:54:08,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 05:54:08,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:08,768 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:08,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 05:54:08,769 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 28 more)] === [2025-03-04 05:54:08,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:08,769 INFO L85 PathProgramCache]: Analyzing trace with hash -322309981, now seen corresponding path program 1 times [2025-03-04 05:54:08,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:08,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019292080] [2025-03-04 05:54:08,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:08,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:09,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 05:54:09,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 05:54:09,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:09,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:54:10,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:10,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019292080] [2025-03-04 05:54:10,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019292080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:10,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:10,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:10,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381487411] [2025-03-04 05:54:10,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:10,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:10,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:10,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:10,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:10,195 INFO L87 Difference]: Start difference. First operand 1396 states and 1848 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-03-04 05:54:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:10,438 INFO L93 Difference]: Finished difference Result 1396 states and 1848 transitions. [2025-03-04 05:54:10,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:10,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 77 [2025-03-04 05:54:10,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:10,448 INFO L225 Difference]: With dead ends: 1396 [2025-03-04 05:54:10,448 INFO L226 Difference]: Without dead ends: 1394 [2025-03-04 05:54:10,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:10,450 INFO L435 NwaCegarLoop]: 1832 mSDtfsCounter, 1813 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1813 SdHoareTripleChecker+Valid, 3663 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:10,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1813 Valid, 3663 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:54:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-04 05:54:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2025-03-04 05:54:10,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 877 states have (on average 1.2086659064994298) internal successors, (1060), 925 states have internal predecessors, (1060), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-03-04 05:54:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1846 transitions. [2025-03-04 05:54:10,514 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1846 transitions. Word has length 77 [2025-03-04 05:54:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:10,514 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1846 transitions. [2025-03-04 05:54:10,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-03-04 05:54:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1846 transitions. [2025-03-04 05:54:10,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 05:54:10,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:10,516 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:10,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 05:54:10,517 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 28 more)] === [2025-03-04 05:54:10,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:10,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1066269679, now seen corresponding path program 1 times [2025-03-04 05:54:10,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:10,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292360333] [2025-03-04 05:54:10,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:10,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:11,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 05:54:11,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 05:54:11,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:11,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:54:11,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:11,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292360333] [2025-03-04 05:54:11,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292360333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:11,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:11,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:11,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699478814] [2025-03-04 05:54:11,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:11,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:11,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:11,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:11,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:11,663 INFO L87 Difference]: Start difference. First operand 1394 states and 1846 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-03-04 05:54:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:11,889 INFO L93 Difference]: Finished difference Result 1394 states and 1846 transitions. [2025-03-04 05:54:11,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:11,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 83 [2025-03-04 05:54:11,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:11,896 INFO L225 Difference]: With dead ends: 1394 [2025-03-04 05:54:11,896 INFO L226 Difference]: Without dead ends: 1392 [2025-03-04 05:54:11,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:11,897 INFO L435 NwaCegarLoop]: 1830 mSDtfsCounter, 1810 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1810 SdHoareTripleChecker+Valid, 3659 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:11,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1810 Valid, 3659 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:54:11,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-04 05:54:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1392. [2025-03-04 05:54:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 876 states have (on average 1.2077625570776256) internal successors, (1058), 923 states have internal predecessors, (1058), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-03-04 05:54:11,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1844 transitions. [2025-03-04 05:54:11,945 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1844 transitions. Word has length 83 [2025-03-04 05:54:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:11,946 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1844 transitions. [2025-03-04 05:54:11,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-03-04 05:54:11,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1844 transitions. [2025-03-04 05:54:11,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 05:54:11,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:11,947 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:11,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 05:54:11,947 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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 28 more)] === [2025-03-04 05:54:11,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash 279720821, now seen corresponding path program 1 times [2025-03-04 05:54:11,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:11,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059904448] [2025-03-04 05:54:11,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:11,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:12,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 05:54:12,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 05:54:12,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:12,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:54:13,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:13,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059904448] [2025-03-04 05:54:13,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059904448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:13,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:13,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:13,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084573061] [2025-03-04 05:54:13,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:13,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:13,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:13,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:13,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:13,213 INFO L87 Difference]: Start difference. First operand 1392 states and 1844 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-03-04 05:54:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:13,450 INFO L93 Difference]: Finished difference Result 1392 states and 1844 transitions. [2025-03-04 05:54:13,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:13,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 89 [2025-03-04 05:54:13,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:13,459 INFO L225 Difference]: With dead ends: 1392 [2025-03-04 05:54:13,460 INFO L226 Difference]: Without dead ends: 1390 [2025-03-04 05:54:13,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:13,461 INFO L435 NwaCegarLoop]: 1828 mSDtfsCounter, 1807 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 3655 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:13,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1807 Valid, 3655 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:54:13,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-03-04 05:54:13,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1390. [2025-03-04 05:54:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 875 states have (on average 1.2068571428571429) internal successors, (1056), 921 states have internal predecessors, (1056), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-03-04 05:54:13,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1842 transitions. [2025-03-04 05:54:13,525 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1842 transitions. Word has length 89 [2025-03-04 05:54:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:13,526 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 1842 transitions. [2025-03-04 05:54:13,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-03-04 05:54:13,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1842 transitions. [2025-03-04 05:54:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 05:54:13,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:13,528 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:13,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 05:54:13,529 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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 28 more)] === [2025-03-04 05:54:13,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:13,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2140818219, now seen corresponding path program 1 times [2025-03-04 05:54:13,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:13,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626344952] [2025-03-04 05:54:13,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:13,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:14,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 05:54:14,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 05:54:14,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:14,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:14,668 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:54:14,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:14,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626344952] [2025-03-04 05:54:14,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626344952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:14,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:14,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:14,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107069141] [2025-03-04 05:54:14,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:14,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:14,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:14,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:14,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:14,669 INFO L87 Difference]: Start difference. First operand 1390 states and 1842 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-03-04 05:54:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:14,915 INFO L93 Difference]: Finished difference Result 1390 states and 1842 transitions. [2025-03-04 05:54:14,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:14,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 95 [2025-03-04 05:54:14,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:14,923 INFO L225 Difference]: With dead ends: 1390 [2025-03-04 05:54:14,924 INFO L226 Difference]: Without dead ends: 1388 [2025-03-04 05:54:14,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:14,926 INFO L435 NwaCegarLoop]: 1826 mSDtfsCounter, 1804 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 3651 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:14,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1804 Valid, 3651 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:54:14,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2025-03-04 05:54:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1388. [2025-03-04 05:54:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 874 states have (on average 1.205949656750572) internal successors, (1054), 919 states have internal predecessors, (1054), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-03-04 05:54:14,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1840 transitions. [2025-03-04 05:54:14,990 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1840 transitions. Word has length 95 [2025-03-04 05:54:14,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:14,991 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1840 transitions. [2025-03-04 05:54:14,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-03-04 05:54:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1840 transitions. [2025-03-04 05:54:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 05:54:14,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:14,994 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:14,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 05:54:14,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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 28 more)] === [2025-03-04 05:54:14,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:14,995 INFO L85 PathProgramCache]: Analyzing trace with hash 359277610, now seen corresponding path program 1 times [2025-03-04 05:54:14,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:14,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692965122] [2025-03-04 05:54:14,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:14,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:15,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 05:54:15,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 05:54:15,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:15,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:54:16,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:16,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692965122] [2025-03-04 05:54:16,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692965122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:16,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:16,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:16,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292055518] [2025-03-04 05:54:16,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:16,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:16,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:16,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:16,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:16,227 INFO L87 Difference]: Start difference. First operand 1388 states and 1840 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-03-04 05:54:16,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:16,482 INFO L93 Difference]: Finished difference Result 1388 states and 1840 transitions. [2025-03-04 05:54:16,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:16,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 101 [2025-03-04 05:54:16,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:16,490 INFO L225 Difference]: With dead ends: 1388 [2025-03-04 05:54:16,490 INFO L226 Difference]: Without dead ends: 1386 [2025-03-04 05:54:16,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:16,492 INFO L435 NwaCegarLoop]: 1824 mSDtfsCounter, 1801 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 3647 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:16,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1801 Valid, 3647 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:54:16,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2025-03-04 05:54:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1386. [2025-03-04 05:54:16,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 873 states have (on average 1.2050400916380297) internal successors, (1052), 917 states have internal predecessors, (1052), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-03-04 05:54:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1838 transitions. [2025-03-04 05:54:16,561 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1838 transitions. Word has length 101 [2025-03-04 05:54:16,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:16,561 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1838 transitions. [2025-03-04 05:54:16,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-03-04 05:54:16,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1838 transitions. [2025-03-04 05:54:16,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 05:54:16,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:16,564 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:16,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 05:54:16,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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 28 more)] === [2025-03-04 05:54:16,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:16,564 INFO L85 PathProgramCache]: Analyzing trace with hash -148057843, now seen corresponding path program 1 times [2025-03-04 05:54:16,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:16,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082204796] [2025-03-04 05:54:16,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:16,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:17,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 05:54:17,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 05:54:17,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:17,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:17,649 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:54:17,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:17,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082204796] [2025-03-04 05:54:17,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082204796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:17,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:17,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:17,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312699964] [2025-03-04 05:54:17,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:17,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:17,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:17,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:17,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:17,651 INFO L87 Difference]: Start difference. First operand 1386 states and 1838 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-03-04 05:54:17,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:17,900 INFO L93 Difference]: Finished difference Result 1386 states and 1838 transitions. [2025-03-04 05:54:17,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:17,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 107 [2025-03-04 05:54:17,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:17,908 INFO L225 Difference]: With dead ends: 1386 [2025-03-04 05:54:17,909 INFO L226 Difference]: Without dead ends: 1384 [2025-03-04 05:54:17,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:17,910 INFO L435 NwaCegarLoop]: 1822 mSDtfsCounter, 1798 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1798 SdHoareTripleChecker+Valid, 3643 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:17,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1798 Valid, 3643 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:54:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-03-04 05:54:17,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2025-03-04 05:54:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 872 states have (on average 1.2041284403669725) internal successors, (1050), 915 states have internal predecessors, (1050), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-03-04 05:54:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1836 transitions. [2025-03-04 05:54:17,974 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1836 transitions. Word has length 107 [2025-03-04 05:54:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:17,974 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1836 transitions. [2025-03-04 05:54:17,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-03-04 05:54:17,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1836 transitions. [2025-03-04 05:54:17,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 05:54:17,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:17,977 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:17,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 05:54:17,977 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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 28 more)] === [2025-03-04 05:54:17,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:17,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1222619349, now seen corresponding path program 1 times [2025-03-04 05:54:17,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:17,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269336938] [2025-03-04 05:54:17,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:17,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:18,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 05:54:18,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 05:54:18,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:18,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:54:19,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:19,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269336938] [2025-03-04 05:54:19,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269336938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:19,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:19,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:19,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920532435] [2025-03-04 05:54:19,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:19,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:19,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:19,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:19,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:19,158 INFO L87 Difference]: Start difference. First operand 1384 states and 1836 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-03-04 05:54:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:19,406 INFO L93 Difference]: Finished difference Result 1384 states and 1836 transitions. [2025-03-04 05:54:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:19,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 113 [2025-03-04 05:54:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:19,415 INFO L225 Difference]: With dead ends: 1384 [2025-03-04 05:54:19,415 INFO L226 Difference]: Without dead ends: 1382 [2025-03-04 05:54:19,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:19,416 INFO L435 NwaCegarLoop]: 1820 mSDtfsCounter, 1795 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1795 SdHoareTripleChecker+Valid, 3639 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:19,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1795 Valid, 3639 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:54:19,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2025-03-04 05:54:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1382. [2025-03-04 05:54:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 871 states have (on average 1.2032146957520091) internal successors, (1048), 913 states have internal predecessors, (1048), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-03-04 05:54:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1834 transitions. [2025-03-04 05:54:19,482 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1834 transitions. Word has length 113 [2025-03-04 05:54:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:19,484 INFO L471 AbstractCegarLoop]: Abstraction has 1382 states and 1834 transitions. [2025-03-04 05:54:19,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-03-04 05:54:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1834 transitions. [2025-03-04 05:54:19,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 05:54:19,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:19,487 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-03-04 05:54:19,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 05:54:19,488 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:54:19,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:19,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2094186360, now seen corresponding path program 1 times [2025-03-04 05:54:19,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:19,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033252520] [2025-03-04 05:54:19,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:19,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:20,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 05:54:20,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 05:54:20,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:20,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:20,536 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-04 05:54:20,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:20,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033252520] [2025-03-04 05:54:20,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033252520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:20,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:20,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:54:20,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606300823] [2025-03-04 05:54:20,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:20,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:54:20,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:20,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:54:20,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:54:20,538 INFO L87 Difference]: Start difference. First operand 1382 states and 1834 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:54:20,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:20,718 INFO L93 Difference]: Finished difference Result 2551 states and 3362 transitions. [2025-03-04 05:54:20,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:54:20,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 155 [2025-03-04 05:54:20,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:20,726 INFO L225 Difference]: With dead ends: 2551 [2025-03-04 05:54:20,727 INFO L226 Difference]: Without dead ends: 1378 [2025-03-04 05:54:20,730 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-03-04 05:54:20,731 INFO L435 NwaCegarLoop]: 1816 mSDtfsCounter, 1817 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1817 SdHoareTripleChecker+Valid, 1816 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:20,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1817 Valid, 1816 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:54:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2025-03-04 05:54:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2025-03-04 05:54:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 868 states have (on average 1.2016129032258065) internal successors, (1043), 909 states have internal predecessors, (1043), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-03-04 05:54:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1829 transitions. [2025-03-04 05:54:20,799 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1829 transitions. Word has length 155 [2025-03-04 05:54:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:20,800 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1829 transitions. [2025-03-04 05:54:20,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:54:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1829 transitions. [2025-03-04 05:54:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 05:54:20,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:20,804 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:20,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 05:54:20,804 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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 28 more)] === [2025-03-04 05:54:20,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:20,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1883796720, now seen corresponding path program 1 times [2025-03-04 05:54:20,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:20,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838623343] [2025-03-04 05:54:20,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:20,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:21,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 05:54:21,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 05:54:21,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:21,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:54:21,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:21,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838623343] [2025-03-04 05:54:21,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838623343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:21,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:21,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:21,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854900698] [2025-03-04 05:54:21,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:21,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:21,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:21,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:21,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:21,939 INFO L87 Difference]: Start difference. First operand 1378 states and 1829 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-03-04 05:54:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:22,207 INFO L93 Difference]: Finished difference Result 1378 states and 1829 transitions. [2025-03-04 05:54:22,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:22,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 115 [2025-03-04 05:54:22,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:22,215 INFO L225 Difference]: With dead ends: 1378 [2025-03-04 05:54:22,215 INFO L226 Difference]: Without dead ends: 1376 [2025-03-04 05:54:22,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:22,217 INFO L435 NwaCegarLoop]: 1813 mSDtfsCounter, 1786 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 3625 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:22,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1786 Valid, 3625 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:54:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2025-03-04 05:54:22,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2025-03-04 05:54:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 867 states have (on average 1.2006920415224913) internal successors, (1041), 907 states have internal predecessors, (1041), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-03-04 05:54:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1827 transitions. [2025-03-04 05:54:22,370 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1827 transitions. Word has length 115 [2025-03-04 05:54:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:22,374 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 1827 transitions. [2025-03-04 05:54:22,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-03-04 05:54:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1827 transitions. [2025-03-04 05:54:22,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 05:54:22,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:22,376 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-03-04 05:54:22,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 05:54:22,377 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:54:22,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:22,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1243086519, now seen corresponding path program 1 times [2025-03-04 05:54:22,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:22,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606403250] [2025-03-04 05:54:22,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:22,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:23,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 05:54:23,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 05:54:23,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:23,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:23,778 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 05:54:23,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:23,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606403250] [2025-03-04 05:54:23,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606403250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:54:23,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21066151] [2025-03-04 05:54:23,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:23,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:54:23,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:54:23,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:54:23,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 05:54:25,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 05:54:25,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 05:54:25,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:25,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:25,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 2866 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 05:54:25,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:54:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-04 05:54:25,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:54:25,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21066151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:25,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:54:25,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-04 05:54:25,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540784484] [2025-03-04 05:54:25,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:25,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:54:25,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:25,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:54:25,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:54:25,644 INFO L87 Difference]: Start difference. First operand 1376 states and 1827 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 05:54:25,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:25,894 INFO L93 Difference]: Finished difference Result 2592 states and 3414 transitions. [2025-03-04 05:54:25,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:54:25,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 161 [2025-03-04 05:54:25,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:25,905 INFO L225 Difference]: With dead ends: 2592 [2025-03-04 05:54:25,906 INFO L226 Difference]: Without dead ends: 1428 [2025-03-04 05:54:25,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:54:25,912 INFO L435 NwaCegarLoop]: 1874 mSDtfsCounter, 1804 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:25,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1804 Valid, 1941 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:54:25,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-03-04 05:54:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1425. [2025-03-04 05:54:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 896 states have (on average 1.1953125) internal successors, (1071), 939 states have internal predecessors, (1071), 409 states have call successors, (409), 102 states have call predecessors, (409), 101 states have return successors, (407), 402 states have call predecessors, (407), 407 states have call successors, (407) [2025-03-04 05:54:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1887 transitions. [2025-03-04 05:54:26,054 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1887 transitions. Word has length 161 [2025-03-04 05:54:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:26,054 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 1887 transitions. [2025-03-04 05:54:26,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 05:54:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1887 transitions. [2025-03-04 05:54:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 05:54:26,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:26,058 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:26,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 05:54:26,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 05:54:26,259 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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 28 more)] === [2025-03-04 05:54:26,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:26,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1245712580, now seen corresponding path program 1 times [2025-03-04 05:54:26,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:26,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903675875] [2025-03-04 05:54:26,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:26,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:27,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 05:54:27,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 05:54:27,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:27,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:27,395 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:54:27,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:27,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903675875] [2025-03-04 05:54:27,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903675875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:27,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:27,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:27,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837278039] [2025-03-04 05:54:27,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:27,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:27,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:27,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:27,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:27,396 INFO L87 Difference]: Start difference. First operand 1425 states and 1887 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-03-04 05:54:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:27,655 INFO L93 Difference]: Finished difference Result 1425 states and 1887 transitions. [2025-03-04 05:54:27,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:27,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 121 [2025-03-04 05:54:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:27,662 INFO L225 Difference]: With dead ends: 1425 [2025-03-04 05:54:27,663 INFO L226 Difference]: Without dead ends: 1423 [2025-03-04 05:54:27,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:27,664 INFO L435 NwaCegarLoop]: 1806 mSDtfsCounter, 1780 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1780 SdHoareTripleChecker+Valid, 3611 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:27,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1780 Valid, 3611 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:54:27,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2025-03-04 05:54:27,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1423. [2025-03-04 05:54:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 895 states have (on average 1.194413407821229) internal successors, (1069), 937 states have internal predecessors, (1069), 409 states have call successors, (409), 102 states have call predecessors, (409), 101 states have return successors, (407), 402 states have call predecessors, (407), 407 states have call successors, (407) [2025-03-04 05:54:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1885 transitions. [2025-03-04 05:54:27,769 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1885 transitions. Word has length 121 [2025-03-04 05:54:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:27,769 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 1885 transitions. [2025-03-04 05:54:27,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-03-04 05:54:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1885 transitions. [2025-03-04 05:54:27,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 05:54:27,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:27,772 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:27,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 05:54:27,772 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_assert_linux_kernel_locking_mutex__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 28 more)] === [2025-03-04 05:54:27,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:27,773 INFO L85 PathProgramCache]: Analyzing trace with hash -310880044, now seen corresponding path program 1 times [2025-03-04 05:54:27,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:27,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538308238] [2025-03-04 05:54:27,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:27,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:28,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 05:54:28,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 05:54:28,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:28,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2025-03-04 05:54:29,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:29,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538308238] [2025-03-04 05:54:29,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538308238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:29,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:29,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:54:29,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236867588] [2025-03-04 05:54:29,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:29,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:54:29,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:29,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:54:29,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:29,386 INFO L87 Difference]: Start difference. First operand 1423 states and 1885 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 05:54:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:29,856 INFO L93 Difference]: Finished difference Result 1651 states and 2112 transitions. [2025-03-04 05:54:29,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:54:29,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2025-03-04 05:54:29,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:29,865 INFO L225 Difference]: With dead ends: 1651 [2025-03-04 05:54:29,865 INFO L226 Difference]: Without dead ends: 1649 [2025-03-04 05:54:29,866 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-03-04 05:54:29,867 INFO L435 NwaCegarLoop]: 1894 mSDtfsCounter, 1600 mSDsluCounter, 4178 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 6072 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:29,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1601 Valid, 6072 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:54:29,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-03-04 05:54:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1635. [2025-03-04 05:54:29,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1034 states have (on average 1.1827852998065764) internal successors, (1223), 1076 states have internal predecessors, (1223), 441 states have call successors, (441), 143 states have call predecessors, (441), 142 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-04 05:54:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2103 transitions. [2025-03-04 05:54:29,968 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2103 transitions. Word has length 153 [2025-03-04 05:54:29,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:29,968 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2103 transitions. [2025-03-04 05:54:29,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 05:54:29,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2103 transitions. [2025-03-04 05:54:29,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 05:54:29,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:29,970 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-03-04 05:54:29,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 05:54:29,971 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:54:29,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:29,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1831618451, now seen corresponding path program 1 times [2025-03-04 05:54:29,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:29,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675185292] [2025-03-04 05:54:29,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:29,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:30,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 05:54:30,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 05:54:30,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:30,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-04 05:54:32,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:32,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675185292] [2025-03-04 05:54:32,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675185292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:32,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:32,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 05:54:32,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978152146] [2025-03-04 05:54:32,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:32,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 05:54:32,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:32,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 05:54:32,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:54:32,018 INFO L87 Difference]: Start difference. First operand 1635 states and 2103 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 05:54:36,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:54:41,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:41,566 INFO L93 Difference]: Finished difference Result 3160 states and 4077 transitions. [2025-03-04 05:54:41,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 05:54:41,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 166 [2025-03-04 05:54:41,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:41,576 INFO L225 Difference]: With dead ends: 3160 [2025-03-04 05:54:41,577 INFO L226 Difference]: Without dead ends: 1635 [2025-03-04 05:54:41,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:54:41,583 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 1776 mSDsluCounter, 4622 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1777 SdHoareTripleChecker+Valid, 6426 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:41,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1777 Valid, 6426 Invalid, 846 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 845 Invalid, 1 Unknown, 0 Unchecked, 9.1s Time] [2025-03-04 05:54:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2025-03-04 05:54:41,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1635. [2025-03-04 05:54:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1034 states have (on average 1.1808510638297873) internal successors, (1221), 1076 states have internal predecessors, (1221), 441 states have call successors, (441), 143 states have call predecessors, (441), 142 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-04 05:54:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2101 transitions. [2025-03-04 05:54:41,686 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2101 transitions. Word has length 166 [2025-03-04 05:54:41,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:41,686 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2101 transitions. [2025-03-04 05:54:41,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 05:54:41,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2101 transitions. [2025-03-04 05:54:41,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 05:54:41,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:41,689 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-03-04 05:54:41,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 05:54:41,690 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:54:41,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:41,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1831588660, now seen corresponding path program 1 times [2025-03-04 05:54:41,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:41,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184755515] [2025-03-04 05:54:41,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:41,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:42,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 05:54:42,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 05:54:42,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:42,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-04 05:54:43,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:43,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184755515] [2025-03-04 05:54:43,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184755515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:43,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:43,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:43,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116155995] [2025-03-04 05:54:43,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:43,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:43,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:43,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:43,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:43,162 INFO L87 Difference]: Start difference. First operand 1635 states and 2101 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 05:54:43,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:43,489 INFO L93 Difference]: Finished difference Result 1635 states and 2101 transitions. [2025-03-04 05:54:43,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:43,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 166 [2025-03-04 05:54:43,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:43,498 INFO L225 Difference]: With dead ends: 1635 [2025-03-04 05:54:43,498 INFO L226 Difference]: Without dead ends: 1633 [2025-03-04 05:54:43,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:43,500 INFO L435 NwaCegarLoop]: 1803 mSDtfsCounter, 0 mSDsluCounter, 3603 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5406 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:43,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5406 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:54:43,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2025-03-04 05:54:43,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2025-03-04 05:54:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1033 states have (on average 1.1790900290416264) internal successors, (1218), 1074 states have internal predecessors, (1218), 441 states have call successors, (441), 143 states have call predecessors, (441), 142 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-04 05:54:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2098 transitions. [2025-03-04 05:54:43,599 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2098 transitions. Word has length 166 [2025-03-04 05:54:43,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:43,600 INFO L471 AbstractCegarLoop]: Abstraction has 1633 states and 2098 transitions. [2025-03-04 05:54:43,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 05:54:43,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2098 transitions. [2025-03-04 05:54:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 05:54:43,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:43,602 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:43,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 05:54:43,602 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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 28 more)] === [2025-03-04 05:54:43,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:43,602 INFO L85 PathProgramCache]: Analyzing trace with hash -960856330, now seen corresponding path program 1 times [2025-03-04 05:54:43,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:43,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295553163] [2025-03-04 05:54:43,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:43,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:44,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 05:54:44,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 05:54:44,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:44,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:54:44,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:44,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295553163] [2025-03-04 05:54:44,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295553163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:44,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:44,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:44,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343558016] [2025-03-04 05:54:44,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:44,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:44,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:44,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:44,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:44,701 INFO L87 Difference]: Start difference. First operand 1633 states and 2098 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-03-04 05:54:44,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:44,948 INFO L93 Difference]: Finished difference Result 1633 states and 2098 transitions. [2025-03-04 05:54:44,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:44,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 127 [2025-03-04 05:54:44,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:44,956 INFO L225 Difference]: With dead ends: 1633 [2025-03-04 05:54:44,956 INFO L226 Difference]: Without dead ends: 1631 [2025-03-04 05:54:44,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:44,958 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 1774 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1774 SdHoareTripleChecker+Valid, 3601 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:44,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1774 Valid, 3601 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:54:44,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2025-03-04 05:54:45,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2025-03-04 05:54:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1032 states have (on average 1.178294573643411) internal successors, (1216), 1072 states have internal predecessors, (1216), 441 states have call successors, (441), 143 states have call predecessors, (441), 142 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-04 05:54:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2096 transitions. [2025-03-04 05:54:45,052 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2096 transitions. Word has length 127 [2025-03-04 05:54:45,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:45,052 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2096 transitions. [2025-03-04 05:54:45,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-03-04 05:54:45,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2096 transitions. [2025-03-04 05:54:45,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 05:54:45,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:45,055 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-03-04 05:54:45,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 05:54:45,055 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-04 05:54:45,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:45,055 INFO L85 PathProgramCache]: Analyzing trace with hash 515652897, now seen corresponding path program 1 times [2025-03-04 05:54:45,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:45,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703406108] [2025-03-04 05:54:45,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:45,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:45,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 05:54:45,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 05:54:45,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:45,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:46,080 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-04 05:54:46,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:46,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703406108] [2025-03-04 05:54:46,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703406108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:46,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:46,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:54:46,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31260489] [2025-03-04 05:54:46,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:46,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:54:46,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:46,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:54:46,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:54:46,082 INFO L87 Difference]: Start difference. First operand 1631 states and 2096 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 05:54:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:46,252 INFO L93 Difference]: Finished difference Result 3146 states and 4056 transitions. [2025-03-04 05:54:46,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:54:46,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 173 [2025-03-04 05:54:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:46,260 INFO L225 Difference]: With dead ends: 3146 [2025-03-04 05:54:46,260 INFO L226 Difference]: Without dead ends: 1625 [2025-03-04 05:54:46,265 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-03-04 05:54:46,265 INFO L435 NwaCegarLoop]: 1797 mSDtfsCounter, 1767 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 1797 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:46,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 1797 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:54:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2025-03-04 05:54:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1625. [2025-03-04 05:54:46,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1027 states have (on average 1.1752677702044791) internal successors, (1207), 1066 states have internal predecessors, (1207), 441 states have call successors, (441), 143 states have call predecessors, (441), 142 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-04 05:54:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2087 transitions. [2025-03-04 05:54:46,370 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2087 transitions. Word has length 173 [2025-03-04 05:54:46,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:46,370 INFO L471 AbstractCegarLoop]: Abstraction has 1625 states and 2087 transitions. [2025-03-04 05:54:46,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 05:54:46,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2087 transitions. [2025-03-04 05:54:46,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 05:54:46,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:46,373 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:46,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 05:54:46,373 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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 28 more)] === [2025-03-04 05:54:46,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:46,373 INFO L85 PathProgramCache]: Analyzing trace with hash 600407234, now seen corresponding path program 1 times [2025-03-04 05:54:46,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:46,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903460085] [2025-03-04 05:54:46,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:46,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:47,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 05:54:47,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 05:54:47,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:47,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:47,747 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2025-03-04 05:54:47,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:47,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903460085] [2025-03-04 05:54:47,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903460085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:47,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:47,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:54:47,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215630014] [2025-03-04 05:54:47,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:47,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:54:47,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:47,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:54:47,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:47,749 INFO L87 Difference]: Start difference. First operand 1625 states and 2087 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 05:54:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:48,202 INFO L93 Difference]: Finished difference Result 1653 states and 2111 transitions. [2025-03-04 05:54:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:54:48,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 164 [2025-03-04 05:54:48,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:48,214 INFO L225 Difference]: With dead ends: 1653 [2025-03-04 05:54:48,215 INFO L226 Difference]: Without dead ends: 1651 [2025-03-04 05:54:48,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:54:48,216 INFO L435 NwaCegarLoop]: 1799 mSDtfsCounter, 1721 mSDsluCounter, 3642 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1722 SdHoareTripleChecker+Valid, 5441 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:48,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1722 Valid, 5441 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:54:48,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2025-03-04 05:54:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1649. [2025-03-04 05:54:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1045 states have (on average 1.1741626794258373) internal successors, (1227), 1084 states have internal predecessors, (1227), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-04 05:54:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2107 transitions. [2025-03-04 05:54:48,317 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2107 transitions. Word has length 164 [2025-03-04 05:54:48,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:48,318 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2107 transitions. [2025-03-04 05:54:48,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 05:54:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2107 transitions. [2025-03-04 05:54:48,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 05:54:48,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:48,319 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:48,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 05:54:48,320 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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 28 more)] === [2025-03-04 05:54:48,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:48,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1529834684, now seen corresponding path program 1 times [2025-03-04 05:54:48,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:48,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147083887] [2025-03-04 05:54:48,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:48,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:49,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 05:54:49,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 05:54:49,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:49,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:54:49,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:49,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147083887] [2025-03-04 05:54:49,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147083887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:49,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:49,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:49,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304262557] [2025-03-04 05:54:49,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:49,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:49,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:49,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:49,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:49,442 INFO L87 Difference]: Start difference. First operand 1649 states and 2107 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-03-04 05:54:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:49,711 INFO L93 Difference]: Finished difference Result 1649 states and 2107 transitions. [2025-03-04 05:54:49,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:49,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 133 [2025-03-04 05:54:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:49,721 INFO L225 Difference]: With dead ends: 1649 [2025-03-04 05:54:49,722 INFO L226 Difference]: Without dead ends: 1647 [2025-03-04 05:54:49,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:49,723 INFO L435 NwaCegarLoop]: 1794 mSDtfsCounter, 1766 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1766 SdHoareTripleChecker+Valid, 3587 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:49,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1766 Valid, 3587 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:54:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2025-03-04 05:54:49,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2025-03-04 05:54:49,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1044 states have (on average 1.1733716475095786) internal successors, (1225), 1082 states have internal predecessors, (1225), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-04 05:54:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2105 transitions. [2025-03-04 05:54:49,869 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2105 transitions. Word has length 133 [2025-03-04 05:54:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:49,869 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2105 transitions. [2025-03-04 05:54:49,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-03-04 05:54:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2105 transitions. [2025-03-04 05:54:49,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 05:54:49,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:49,872 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:49,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 05:54:49,872 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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 28 more)] === [2025-03-04 05:54:49,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:49,873 INFO L85 PathProgramCache]: Analyzing trace with hash -800275160, now seen corresponding path program 1 times [2025-03-04 05:54:49,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:49,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774016453] [2025-03-04 05:54:49,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:49,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:50,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 05:54:50,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 05:54:50,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:50,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:54:50,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:50,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774016453] [2025-03-04 05:54:50,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774016453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:50,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:50,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:50,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110879859] [2025-03-04 05:54:50,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:50,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:50,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:50,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:50,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:50,892 INFO L87 Difference]: Start difference. First operand 1647 states and 2105 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-03-04 05:54:51,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:51,134 INFO L93 Difference]: Finished difference Result 1647 states and 2105 transitions. [2025-03-04 05:54:51,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:51,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 139 [2025-03-04 05:54:51,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:51,143 INFO L225 Difference]: With dead ends: 1647 [2025-03-04 05:54:51,143 INFO L226 Difference]: Without dead ends: 1645 [2025-03-04 05:54:51,144 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-03-04 05:54:51,144 INFO L435 NwaCegarLoop]: 1792 mSDtfsCounter, 1763 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1763 SdHoareTripleChecker+Valid, 3583 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:51,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1763 Valid, 3583 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:54:51,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2025-03-04 05:54:51,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1645. [2025-03-04 05:54:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1043 states have (on average 1.1725790987535953) internal successors, (1223), 1080 states have internal predecessors, (1223), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-04 05:54:51,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2103 transitions. [2025-03-04 05:54:51,245 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2103 transitions. Word has length 139 [2025-03-04 05:54:51,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:51,245 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 2103 transitions. [2025-03-04 05:54:51,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-03-04 05:54:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2103 transitions. [2025-03-04 05:54:51,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 05:54:51,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:51,247 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:51,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 05:54:51,247 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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 28 more)] === [2025-03-04 05:54:51,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:51,247 INFO L85 PathProgramCache]: Analyzing trace with hash -198478950, now seen corresponding path program 1 times [2025-03-04 05:54:51,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:51,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076202502] [2025-03-04 05:54:51,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:51,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:52,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 05:54:52,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 05:54:52,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:52,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:54:52,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:52,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076202502] [2025-03-04 05:54:52,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076202502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:52,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:52,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:52,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62622704] [2025-03-04 05:54:52,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:52,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:52,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:52,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:52,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:52,393 INFO L87 Difference]: Start difference. First operand 1645 states and 2103 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-03-04 05:54:52,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:52,691 INFO L93 Difference]: Finished difference Result 1645 states and 2103 transitions. [2025-03-04 05:54:52,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:52,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 145 [2025-03-04 05:54:52,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:52,697 INFO L225 Difference]: With dead ends: 1645 [2025-03-04 05:54:52,697 INFO L226 Difference]: Without dead ends: 1643 [2025-03-04 05:54:52,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:52,699 INFO L435 NwaCegarLoop]: 1790 mSDtfsCounter, 1760 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 3579 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:52,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 3579 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:54:52,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2025-03-04 05:54:52,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1643. [2025-03-04 05:54:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1042 states have (on average 1.171785028790787) internal successors, (1221), 1078 states have internal predecessors, (1221), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-04 05:54:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2101 transitions. [2025-03-04 05:54:52,806 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2101 transitions. Word has length 145 [2025-03-04 05:54:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:52,807 INFO L471 AbstractCegarLoop]: Abstraction has 1643 states and 2101 transitions. [2025-03-04 05:54:52,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-03-04 05:54:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2101 transitions. [2025-03-04 05:54:52,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 05:54:52,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:52,809 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:52,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 05:54:52,809 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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 28 more)] === [2025-03-04 05:54:52,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:52,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1115319793, now seen corresponding path program 1 times [2025-03-04 05:54:52,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:52,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968698061] [2025-03-04 05:54:52,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:52,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:53,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 05:54:53,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 05:54:53,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:53,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:54:54,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:54,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968698061] [2025-03-04 05:54:54,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968698061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:54,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:54,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:54,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263496451] [2025-03-04 05:54:54,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:54,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:54,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:54,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:54,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:54,109 INFO L87 Difference]: Start difference. First operand 1643 states and 2101 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-03-04 05:54:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:54,386 INFO L93 Difference]: Finished difference Result 1643 states and 2101 transitions. [2025-03-04 05:54:54,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:54,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 151 [2025-03-04 05:54:54,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:54,392 INFO L225 Difference]: With dead ends: 1643 [2025-03-04 05:54:54,393 INFO L226 Difference]: Without dead ends: 1641 [2025-03-04 05:54:54,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:54,395 INFO L435 NwaCegarLoop]: 1788 mSDtfsCounter, 1757 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 3575 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:54,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1757 Valid, 3575 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:54:54,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2025-03-04 05:54:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1641. [2025-03-04 05:54:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1041 states have (on average 1.170989433237272) internal successors, (1219), 1076 states have internal predecessors, (1219), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-04 05:54:54,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2099 transitions. [2025-03-04 05:54:54,517 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2099 transitions. Word has length 151 [2025-03-04 05:54:54,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:54,517 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2099 transitions. [2025-03-04 05:54:54,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-03-04 05:54:54,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2099 transitions. [2025-03-04 05:54:54,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-04 05:54:54,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:54,520 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:54:54,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 05:54:54,520 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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 28 more)] === [2025-03-04 05:54:54,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:54,521 INFO L85 PathProgramCache]: Analyzing trace with hash 637303612, now seen corresponding path program 1 times [2025-03-04 05:54:54,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:54,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037933736] [2025-03-04 05:54:54,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:54,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:55,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 05:54:55,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 05:54:55,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:55,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-04 05:54:55,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:55,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037933736] [2025-03-04 05:54:55,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037933736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:55,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:55,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:54:55,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599367107] [2025-03-04 05:54:55,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:55,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:54:55,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:55,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:54:55,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:55,755 INFO L87 Difference]: Start difference. First operand 1641 states and 2099 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 05:54:59,781 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-03-04 05:55:00,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:00,375 INFO L93 Difference]: Finished difference Result 1643 states and 2100 transitions. [2025-03-04 05:55:00,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:55:00,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 187 [2025-03-04 05:55:00,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:00,381 INFO L225 Difference]: With dead ends: 1643 [2025-03-04 05:55:00,381 INFO L226 Difference]: Without dead ends: 1641 [2025-03-04 05:55:00,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:55:00,382 INFO L435 NwaCegarLoop]: 1789 mSDtfsCounter, 43 mSDsluCounter, 5315 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 7104 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:00,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 7104 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-04 05:55:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2025-03-04 05:55:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1641. [2025-03-04 05:55:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1041 states have (on average 1.1690682036503361) internal successors, (1217), 1076 states have internal predecessors, (1217), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-04 05:55:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2097 transitions. [2025-03-04 05:55:00,498 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2097 transitions. Word has length 187 [2025-03-04 05:55:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:00,498 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2097 transitions. [2025-03-04 05:55:00,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 05:55:00,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2097 transitions. [2025-03-04 05:55:00,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 05:55:00,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:00,500 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:55:00,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 05:55:00,500 INFO L396 AbstractCegarLoop]: === Iteration 24 === 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 28 more)] === [2025-03-04 05:55:00,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:00,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1385860507, now seen corresponding path program 1 times [2025-03-04 05:55:00,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:00,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124642271] [2025-03-04 05:55:00,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:00,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:01,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 05:55:01,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 05:55:01,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:01,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:55:01,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:01,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124642271] [2025-03-04 05:55:01,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124642271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:01,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:01,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:01,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180669642] [2025-03-04 05:55:01,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:01,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:01,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:01,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:01,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:01,662 INFO L87 Difference]: Start difference. First operand 1641 states and 2097 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-04 05:55:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:01,934 INFO L93 Difference]: Finished difference Result 1641 states and 2097 transitions. [2025-03-04 05:55:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:01,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2025-03-04 05:55:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:01,939 INFO L225 Difference]: With dead ends: 1641 [2025-03-04 05:55:01,940 INFO L226 Difference]: Without dead ends: 1639 [2025-03-04 05:55:01,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:01,940 INFO L435 NwaCegarLoop]: 1786 mSDtfsCounter, 1754 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 3571 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:01,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 3571 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:01,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2025-03-04 05:55:02,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1639. [2025-03-04 05:55:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1040 states have (on average 1.1682692307692308) internal successors, (1215), 1074 states have internal predecessors, (1215), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-04 05:55:02,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2095 transitions. [2025-03-04 05:55:02,080 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2095 transitions. Word has length 157 [2025-03-04 05:55:02,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:02,081 INFO L471 AbstractCegarLoop]: Abstraction has 1639 states and 2095 transitions. [2025-03-04 05:55:02,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-04 05:55:02,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2095 transitions. [2025-03-04 05:55:02,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 05:55:02,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:02,083 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:55:02,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 05:55:02,083 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_net_rtnetlink_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 28 more)] === [2025-03-04 05:55:02,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:02,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1885038272, now seen corresponding path program 1 times [2025-03-04 05:55:02,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:02,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575833363] [2025-03-04 05:55:02,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:02,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:02,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 05:55:02,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 05:55:02,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:02,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:55:03,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:03,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575833363] [2025-03-04 05:55:03,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575833363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:03,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:03,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:03,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960166677] [2025-03-04 05:55:03,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:03,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:03,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:03,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:03,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:03,136 INFO L87 Difference]: Start difference. First operand 1639 states and 2095 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 05:55:03,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:03,459 INFO L93 Difference]: Finished difference Result 1639 states and 2095 transitions. [2025-03-04 05:55:03,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:03,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2025-03-04 05:55:03,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:03,466 INFO L225 Difference]: With dead ends: 1639 [2025-03-04 05:55:03,466 INFO L226 Difference]: Without dead ends: 1637 [2025-03-04 05:55:03,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:03,467 INFO L435 NwaCegarLoop]: 1784 mSDtfsCounter, 1751 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 3567 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:03,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1751 Valid, 3567 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:03,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2025-03-04 05:55:03,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1637. [2025-03-04 05:55:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1637 states, 1039 states have (on average 1.167468719923003) internal successors, (1213), 1072 states have internal predecessors, (1213), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-04 05:55:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2093 transitions. [2025-03-04 05:55:03,588 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2093 transitions. Word has length 163 [2025-03-04 05:55:03,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:03,588 INFO L471 AbstractCegarLoop]: Abstraction has 1637 states and 2093 transitions. [2025-03-04 05:55:03,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 05:55:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2093 transitions. [2025-03-04 05:55:03,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 05:55:03,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:03,589 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:55:03,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 05:55:03,590 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_net_sock_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 28 more)] === [2025-03-04 05:55:03,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:03,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1748505780, now seen corresponding path program 1 times [2025-03-04 05:55:03,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:03,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379745811] [2025-03-04 05:55:03,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:03,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:04,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 05:55:04,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 05:55:04,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:04,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:55:04,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:04,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379745811] [2025-03-04 05:55:04,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379745811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:04,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:04,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:04,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068990141] [2025-03-04 05:55:04,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:04,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:04,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:04,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:04,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:04,714 INFO L87 Difference]: Start difference. First operand 1637 states and 2093 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 05:55:05,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:05,034 INFO L93 Difference]: Finished difference Result 1637 states and 2093 transitions. [2025-03-04 05:55:05,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:05,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2025-03-04 05:55:05,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:05,041 INFO L225 Difference]: With dead ends: 1637 [2025-03-04 05:55:05,041 INFO L226 Difference]: Without dead ends: 1635 [2025-03-04 05:55:05,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:05,042 INFO L435 NwaCegarLoop]: 1782 mSDtfsCounter, 1748 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 3563 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:05,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 3563 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:55:05,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2025-03-04 05:55:05,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1635. [2025-03-04 05:55:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1038 states have (on average 1.1666666666666667) internal successors, (1211), 1070 states have internal predecessors, (1211), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-04 05:55:05,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2091 transitions. [2025-03-04 05:55:05,174 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2091 transitions. Word has length 169 [2025-03-04 05:55:05,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:05,174 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2091 transitions. [2025-03-04 05:55:05,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 05:55:05,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2091 transitions. [2025-03-04 05:55:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 05:55:05,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:05,176 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:55:05,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 05:55:05,177 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_coherent_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 28 more)] === [2025-03-04 05:55:05,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:05,177 INFO L85 PathProgramCache]: Analyzing trace with hash -334841795, now seen corresponding path program 1 times [2025-03-04 05:55:05,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:05,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946359708] [2025-03-04 05:55:05,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:05,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:05,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 05:55:05,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 05:55:05,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:05,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 05:55:06,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:06,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946359708] [2025-03-04 05:55:06,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946359708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:06,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:06,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:06,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356291896] [2025-03-04 05:55:06,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:06,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:06,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:06,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:06,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:06,249 INFO L87 Difference]: Start difference. First operand 1635 states and 2091 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-04 05:55:06,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:06,546 INFO L93 Difference]: Finished difference Result 1635 states and 2091 transitions. [2025-03-04 05:55:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:06,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2025-03-04 05:55:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:06,552 INFO L225 Difference]: With dead ends: 1635 [2025-03-04 05:55:06,552 INFO L226 Difference]: Without dead ends: 1633 [2025-03-04 05:55:06,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:06,553 INFO L435 NwaCegarLoop]: 1780 mSDtfsCounter, 1745 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 3559 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:06,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1745 Valid, 3559 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2025-03-04 05:55:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2025-03-04 05:55:06,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1037 states have (on average 1.1658630665380907) internal successors, (1209), 1068 states have internal predecessors, (1209), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-04 05:55:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2089 transitions. [2025-03-04 05:55:06,683 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2089 transitions. Word has length 175 [2025-03-04 05:55:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:06,683 INFO L471 AbstractCegarLoop]: Abstraction has 1633 states and 2089 transitions. [2025-03-04 05:55:06,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-04 05:55:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2089 transitions. [2025-03-04 05:55:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-04 05:55:06,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:06,685 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 05:55:06,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 05:55:06,685 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_assert_linux_kernel_locking_mutex__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 28 more)] === [2025-03-04 05:55:06,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:06,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1211169378, now seen corresponding path program 1 times [2025-03-04 05:55:06,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:06,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635867247] [2025-03-04 05:55:06,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:06,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:07,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-04 05:55:07,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-04 05:55:07,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:07,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-03-04 05:55:08,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:08,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635867247] [2025-03-04 05:55:08,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635867247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:08,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:08,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:55:08,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371523482] [2025-03-04 05:55:08,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:08,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:55:08,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:08,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:55:08,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:08,999 INFO L87 Difference]: Start difference. First operand 1633 states and 2089 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 4 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29)