./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 21:05:49,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:05:49,471 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 21:05:49,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:05:49,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:05:49,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:05:49,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:05:49,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:05:49,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 21:05:49,499 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 21:05:49,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:05:49,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:05:49,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:05:49,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:05:49,500 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:05:49,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:05:49,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:05:49,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:05:49,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:05:49,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:05:49,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:05:49,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:05:49,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:05:49,501 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:05:49,501 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:05:49,501 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:05:49,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:05:49,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 21:05:49,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:05:49,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:05:49,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:05:49,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:05:49,501 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:05:49,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:05:49,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:05:49,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:05:49,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:05:49,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:05:49,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:05:49,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:05:49,502 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-08 21:05:49,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:05:49,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:05:49,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:05:49,753 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:05:49,754 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:05:49,755 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-08 21:05:51,005 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfbdaddb9/b6bf9e7c8fc245bc87178776dd1eb0ba/FLAG58bbd8e06 [2025-03-08 21:05:51,598 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:05:51,599 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-08 21:05:51,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfbdaddb9/b6bf9e7c8fc245bc87178776dd1eb0ba/FLAG58bbd8e06 [2025-03-08 21:05:52,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfbdaddb9/b6bf9e7c8fc245bc87178776dd1eb0ba [2025-03-08 21:05:52,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:05:52,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:05:52,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:05:52,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:05:52,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:05:52,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:05:52" (1/1) ... [2025-03-08 21:05:52,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b94d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:05:52, skipping insertion in model container [2025-03-08 21:05:52,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:05:52" (1/1) ... [2025-03-08 21:05:52,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:05:54,792 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-08 21:05:54,795 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-08 21:05:54,795 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-08 21:05:54,796 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-08 21:05:54,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[307923,307936] [2025-03-08 21:05:54,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[308081,308094] [2025-03-08 21:05:54,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[308239,308252] [2025-03-08 21:05:54,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[308399,308412] [2025-03-08 21:05:54,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[308558,308571] [2025-03-08 21:05:54,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[308697,308710] [2025-03-08 21:05:54,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[308839,308852] [2025-03-08 21:05:54,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[308988,309001] [2025-03-08 21:05:54,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[309127,309140] [2025-03-08 21:05:54,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[309282,309295] [2025-03-08 21:05:54,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[309442,309455] [2025-03-08 21:05:54,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[309593,309606] [2025-03-08 21:05:54,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[309744,309757] [2025-03-08 21:05:54,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[309896,309909] [2025-03-08 21:05:54,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[310045,310058] [2025-03-08 21:05:54,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[310193,310206] [2025-03-08 21:05:54,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[310350,310363] [2025-03-08 21:05:54,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[310499,310512] [2025-03-08 21:05:54,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[310655,310668] [2025-03-08 21:05:54,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[310808,310821] [2025-03-08 21:05:54,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[310954,310967] [2025-03-08 21:05:54,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[311097,311110] [2025-03-08 21:05:54,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[311249,311262] [2025-03-08 21:05:54,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[311395,311408] [2025-03-08 21:05:54,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[311540,311553] [2025-03-08 21:05:54,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[311694,311707] [2025-03-08 21:05:54,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[311845,311858] [2025-03-08 21:05:54,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[312000,312013] [2025-03-08 21:05:54,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[312152,312165] [2025-03-08 21:05:54,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[312307,312320] [2025-03-08 21:05:54,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[312471,312484] [2025-03-08 21:05:54,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[312627,312640] [2025-03-08 21:05:54,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[312791,312804] [2025-03-08 21:05:54,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[312933,312946] [2025-03-08 21:05:54,815 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-08 21:05:54,815 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-08 21:05:54,815 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-08 21:05:54,816 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-08 21:05:54,816 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-08 21:05:54,816 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-08 21:05:54,816 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-08 21:05:54,817 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-08 21:05:54,818 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-08 21:05:54,818 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-08 21:05:54,818 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-08 21:05:54,818 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-08 21:05:54,819 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-08 21:05:54,819 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-08 21:05:54,820 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-08 21:05:54,820 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-08 21:05:54,820 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-08 21:05:54,820 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-08 21:05:54,820 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-08 21:05:54,821 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-08 21:05:54,821 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-08 21:05:54,821 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-08 21:05:54,821 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-08 21:05:54,821 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-08 21:05:54,822 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-08 21:05:54,823 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-08 21:05:54,824 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-08 21:05:54,824 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-08 21:05:54,824 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-08 21:05:54,825 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-08 21:05:54,825 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-08 21:05:54,825 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-08 21:05:54,826 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-08 21:05:54,826 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-08 21:05:54,827 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-08 21:05:54,827 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-08 21:05:54,827 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-08 21:05:54,827 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-08 21:05:54,828 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-08 21:05:54,828 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-08 21:05:54,828 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-08 21:05:54,829 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-08 21:05:54,829 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-08 21:05:54,829 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-08 21:05:54,829 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-08 21:05:54,830 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-08 21:05:54,830 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-08 21:05:54,830 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-08 21:05:54,831 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-08 21:05:54,831 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-08 21:05:54,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:05:54,871 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:05:54,958 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-08 21:05:54,960 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-08 21:05:54,960 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [4191] [2025-03-08 21:05:55,067 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-08 21:05:55,068 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-08 21:05:55,068 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-08 21:05:55,068 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-08 21:05:55,068 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-08 21:05:55,069 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-08 21:05:55,069 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-08 21:05:55,070 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-08 21:05:55,070 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-08 21:05:55,070 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-08 21:05:55,070 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-08 21:05:55,070 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-08 21:05:55,070 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-08 21:05:55,071 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-08 21:05:55,071 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-08 21:05:55,071 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-08 21:05:55,072 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-08 21:05:55,072 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-08 21:05:55,072 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-08 21:05:55,073 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-08 21:05:55,073 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-08 21:05:55,073 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-08 21:05:55,073 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-08 21:05:55,073 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-08 21:05:55,073 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-08 21:05:55,073 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-08 21:05:55,074 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-08 21:05:55,074 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-08 21:05:55,074 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-08 21:05:55,074 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-08 21:05:55,074 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-08 21:05:55,074 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-08 21:05:55,074 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-08 21:05:55,075 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-08 21:05:55,075 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-08 21:05:55,075 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-08 21:05:55,075 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-08 21:05:55,075 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-08 21:05:55,075 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-08 21:05:55,075 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-08 21:05:55,076 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-08 21:05:55,076 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-08 21:05:55,076 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-08 21:05:55,076 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-08 21:05:55,076 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-08 21:05:55,076 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-08 21:05:55,078 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-08 21:05:55,079 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-08 21:05:55,079 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-08 21:05:55,079 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-08 21:05:55,079 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-08 21:05:55,080 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-08 21:05:55,080 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-08 21:05:55,081 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-08 21:05:55,081 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-08 21:05:55,081 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-08 21:05:55,082 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-08 21:05:55,082 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-08 21:05:55,082 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-08 21:05:55,082 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-08 21:05:55,083 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-08 21:05:55,083 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-08 21:05:55,083 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-08 21:05:55,083 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-08 21:05:55,084 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-08 21:05:55,084 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-08 21:05:55,084 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-08 21:05:55,084 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-08 21:05:55,084 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-08 21:05:55,085 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-08 21:05:55,085 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-08 21:05:55,085 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-08 21:05:55,085 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-08 21:05:55,086 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-08 21:05:55,086 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-08 21:05:55,086 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-08 21:05:55,086 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-08 21:05:55,086 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-08 21:05:55,087 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-08 21:05:55,087 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-08 21:05:55,088 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-08 21:05:55,088 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-08 21:05:55,088 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-08 21:05:55,089 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-08 21:05:55,089 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-08 21:05:55,089 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-08 21:05:55,089 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-08 21:05:55,090 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-08 21:05:55,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:05:55,243 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:05:55,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:05:55 WrapperNode [2025-03-08 21:05:55,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:05:55,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:05:55,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:05:55,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:05:55,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:05:55" (1/1) ... [2025-03-08 21:05:55,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:05:55" (1/1) ... [2025-03-08 21:05:55,423 INFO L138 Inliner]: procedures = 592, calls = 1952, calls flagged for inlining = 265, calls inlined = 171, statements flattened = 3426 [2025-03-08 21:05:55,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:05:55,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:05:55,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:05:55,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:05:55,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:05:55" (1/1) ... [2025-03-08 21:05:55,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:05:55" (1/1) ... [2025-03-08 21:05:55,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:05:55" (1/1) ... [2025-03-08 21:05:55,877 INFO L175 MemorySlicer]: Split 593 memory accesses to 24 slices as follows [2, 49, 7, 8, 8, 8, 8, 8, 2, 8, 8, 1, 2, 23, 305, 10, 8, 4, 56, 31, 3, 4, 22, 8]. 51 percent of accesses are in the largest equivalence class. The 181 initializations are split as follows [0, 0, 0, 8, 8, 8, 8, 8, 0, 8, 8, 1, 2, 0, 36, 10, 8, 0, 56, 0, 0, 4, 0, 8]. The 239 writes are split as follows [1, 42, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 23, 113, 0, 0, 1, 0, 31, 0, 0, 22, 0]. [2025-03-08 21:05:55,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:05:55" (1/1) ... [2025-03-08 21:05:55,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:05:55" (1/1) ... [2025-03-08 21:05:55,973 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:05:55" (1/1) ... [2025-03-08 21:05:55,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:05:55" (1/1) ... [2025-03-08 21:05:56,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:05:55" (1/1) ... [2025-03-08 21:05:56,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:05:55" (1/1) ... [2025-03-08 21:05:56,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:05:56,044 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:05:56,044 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:05:56,044 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:05:56,047 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:05:55" (1/1) ... [2025-03-08 21:05:56,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:05:56,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:05:56,078 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-08 21:05:56,080 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-08 21:05:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-03-08 21:05:56,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-03-08 21:05:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-08 21:05:56,099 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-08 21:05:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure recover_from_urb_loss [2025-03-08 21:05:56,099 INFO L138 BoogieDeclarations]: Found implementation of procedure recover_from_urb_loss [2025-03-08 21:05:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_control_urb [2025-03-08 21:05:56,099 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_control_urb [2025-03-08 21:05:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 21:05:56,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 21:05:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_ioctl [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_ioctl [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2025-03-08 21:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2025-03-08 21:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-03-08 21:05:56,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-08 21:05:56,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_111 [2025-03-08 21:05:56,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_111 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-08 21:05:56,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2025-03-08 21:05:56,103 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 21:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 21:05:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 21:05:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 21:05:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-08 21:05:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-08 21:05:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-08 21:05:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-08 21:05:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-08 21:05:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-08 21:05:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-03-08 21:05:56,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-03-08 21:05:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-03-08 21:05:56,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-03-08 21:05:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-03-08 21:05:56,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-03-08 21:05:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2025-03-08 21:05:56,104 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2025-03-08 21:05:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2025-03-08 21:05:56,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2025-03-08 21:05:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-03-08 21:05:56,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-03-08 21:05:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure kill_urbs [2025-03-08 21:05:56,104 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_urbs [2025-03-08 21:05:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2025-03-08 21:05:56,105 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-03-08 21:05:56,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-03-08 21:05:56,105 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-03-08 21:05:56,105 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-08 21:05:56,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2025-03-08 21:05:56,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-08 21:05:56,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-08 21:05:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-03-08 21:05:56,106 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 21:05:56,106 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-03-08 21:05:56,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-03-08 21:05:56,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_find_device [2025-03-08 21:05:56,106 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_find_device [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-08 21:05:56,106 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2025-03-08 21:05:56,106 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-03-08 21:05:56,106 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:05:56,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure usb_translate_errors [2025-03-08 21:05:56,106 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_translate_errors [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 21:05:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 21:05:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 21:05:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-08 21:05:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-08 21:05:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-08 21:05:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-08 21:05:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-08 21:05:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-08 21:05:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-08 21:05:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-08 21:05:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-08 21:05:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-08 21:05:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-08 21:05:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-03-08 21:05:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2025-03-08 21:05:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 21:05:56,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 21:05:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-08 21:05:56,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-08 21:05:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_create [2025-03-08 21:05:56,110 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_create [2025-03-08 21:05:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_128 [2025-03-08 21:05:56,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_128 [2025-03-08 21:05:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-03-08 21:05:56,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-03-08 21:05:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2025-03-08 21:05:56,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2025-03-08 21:05:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure clear_wdm_read_flag [2025-03-08 21:05:56,110 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_wdm_read_flag [2025-03-08 21:05:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-03-08 21:05:56,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-03-08 21:05:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:05:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-08 21:05:56,134 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-08 21:05:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-08 21:05:56,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-08 21:05:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_disconnect [2025-03-08 21:05:56,135 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_disconnect [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2025-03-08 21:05:56,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2025-03-08 21:05:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-08 21:05:56,135 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-08 21:05:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-08 21:05:56,136 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-08 21:05:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-03-08 21:05:56,136 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-03-08 21:05:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-08 21:05:56,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-08 21:05:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2025-03-08 21:05:56,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2025-03-08 21:05:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-08 21:05:56,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-08 21:05:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-08 21:05:56,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-08 21:05:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-03-08 21:05:56,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-03-08 21:05:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-03-08 21:05:56,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-03-08 21:05:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-08 21:05:56,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-08 21:05:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-08 21:05:56,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-08 21:05:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-03-08 21:05:56,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-03-08 21:05:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-03-08 21:05:56,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-03-08 21:05:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-08 21:05:56,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-08 21:05:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-08 21:05:56,139 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-08 21:05:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2025-03-08 21:05:56,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2025-03-08 21:05:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-08 21:05:56,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-08 21:05:56,139 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 21:05:56,140 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-08 21:05:56,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 21:05:56,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-08 21:05:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-08 21:05:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_95 [2025-03-08 21:05:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_95 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_resume [2025-03-08 21:05:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_resume [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-08 21:05:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_96 [2025-03-08 21:05:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_96 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2025-03-08 21:05:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-03-08 21:05:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-08 21:05:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-08 21:05:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-08 21:05:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2025-03-08 21:05:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2025-03-08 21:05:56,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_110 [2025-03-08 21:05:56,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_110 [2025-03-08 21:05:56,722 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:05:56,725 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:05:56,775 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 21:05:56,815 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7795: havoc ldv_usb_submit_urb_171_#t~nondet522#1; [2025-03-08 21:05:56,912 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12674: havoc #t~nondet708; [2025-03-08 21:05:57,317 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4389: havoc usb_endpoint_dir_in_#t~mem61#1; [2025-03-08 21:05:57,318 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12690: havoc usb_register_dev_#t~nondet709#1; [2025-03-08 21:05:57,318 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4383: havoc kobject_name_#t~mem60#1.base, kobject_name_#t~mem60#1.offset; [2025-03-08 21:05:57,318 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4425: havoc usb_endpoint_maxp_#t~mem65#1; [2025-03-08 21:05:57,319 INFO L1307 $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-08 21:05:57,319 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4501: havoc dev_name_#t~mem81#1.base, dev_name_#t~mem81#1.offset; [2025-03-08 21:05:57,319 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4395: havoc usb_endpoint_xfer_int_#t~mem62#1; [2025-03-08 21:05:57,368 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7486: havoc ldv_usb_submit_urb_116_#t~nondet512#1; [2025-03-08 21:05:57,434 INFO L1307 $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-08 21:05:57,464 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12631: havoc #t~nondet704; [2025-03-08 21:05:57,509 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12605: havoc #t~nondet702; [2025-03-08 21:05:57,583 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4618: havoc #t~mem107;havoc #t~bitwise108; [2025-03-08 21:05:57,596 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4199: havoc #t~mem5;havoc #t~bitwise6; [2025-03-08 21:05:57,628 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12663: havoc #t~nondet706; [2025-03-08 21:05:57,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6487: call ULTIMATE.dealloc(~#descriptor~8.base, ~#descriptor~8.offset);havoc ~#descriptor~8.base, ~#descriptor~8.offset; [2025-03-08 21:05:57,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12609: havoc #t~nondet703; [2025-03-08 21:06:02,791 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12659: havoc noop_llseek_#t~nondet705#1; [2025-03-08 21:06:02,791 INFO L1307 $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-08 21:06:02,791 INFO L1307 $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-08 21:06:02,791 INFO L1307 $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-08 21:06:02,792 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7198-1: ldv_usb_register_driver_#res#1 := ldv_usb_register_driver_~arg0#1; [2025-03-08 21:06:02,792 INFO L1307 $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-08 21:06:02,792 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7468: havoc ldv_usb_submit_urb_113_#t~nondet511#1; [2025-03-08 21:06:02,792 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12694: havoc usb_register_driver_#t~nondet710#1; [2025-03-08 21:06:02,792 INFO L1307 $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-08 21:06:02,792 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7552: havoc ldv_usb_submit_urb_132_#t~nondet514#1; [2025-03-08 21:06:02,792 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4515: havoc iminor_#t~mem87#1; [2025-03-08 21:06:02,792 INFO L1307 $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-08 21:06:02,792 INFO L1307 $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-08 21:06:03,306 INFO L? ?]: Removed 1503 outVars from TransFormulas that were not future-live. [2025-03-08 21:06:03,307 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:06:03,361 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:06:03,361 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 21:06:03,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:06:03 BoogieIcfgContainer [2025-03-08 21:06:03,361 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:06:03,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:06:03,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:06:03,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:06:03,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:05:52" (1/3) ... [2025-03-08 21:06:03,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695bb470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:06:03, skipping insertion in model container [2025-03-08 21:06:03,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:05:55" (2/3) ... [2025-03-08 21:06:03,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695bb470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:06:03, skipping insertion in model container [2025-03-08 21:06:03,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:06:03" (3/3) ... [2025-03-08 21:06:03,371 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2025-03-08 21:06:03,383 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:06:03,387 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-08 21:06:03,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:06:03,485 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;@edc8669, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:06:03,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-08 21:06:03,493 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-08 21:06:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 21:06:03,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:03,502 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-08 21:06:03,502 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-08 21:06:03,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:03,506 INFO L85 PathProgramCache]: Analyzing trace with hash -279052911, now seen corresponding path program 1 times [2025-03-08 21:06:03,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:03,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542343457] [2025-03-08 21:06:03,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:03,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:04,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 21:06:05,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 21:06:05,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:05,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:06,051 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-08 21:06:06,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:06,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542343457] [2025-03-08 21:06:06,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542343457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:06,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:06,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:06,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212268683] [2025-03-08 21:06:06,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:06,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:06,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:06,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:06,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:06,086 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-08 21:06:06,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:06,537 INFO L93 Difference]: Finished difference Result 2761 states and 3867 transitions. [2025-03-08 21:06:06,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:06,541 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-08 21:06:06,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:06,573 INFO L225 Difference]: With dead ends: 2761 [2025-03-08 21:06:06,573 INFO L226 Difference]: Without dead ends: 1396 [2025-03-08 21:06:06,590 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-08 21:06:06,592 INFO L435 NwaCegarLoop]: 1852 mSDtfsCounter, 1834 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-08 21:06:06,593 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-08 21:06:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2025-03-08 21:06:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1396. [2025-03-08 21:06:06,715 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-08 21:06:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1848 transitions. [2025-03-08 21:06:06,734 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1848 transitions. Word has length 71 [2025-03-08 21:06:06,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:06,739 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 1848 transitions. [2025-03-08 21:06:06,740 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-08 21:06:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1848 transitions. [2025-03-08 21:06:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 21:06:06,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:06,746 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-08 21:06:06,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:06:06,747 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-08 21:06:06,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:06,747 INFO L85 PathProgramCache]: Analyzing trace with hash -322309981, now seen corresponding path program 1 times [2025-03-08 21:06:06,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:06,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607047003] [2025-03-08 21:06:06,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:06,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:07,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 21:06:07,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 21:06:07,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:07,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:08,540 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-08 21:06:08,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:08,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607047003] [2025-03-08 21:06:08,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607047003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:08,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:08,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:08,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124332249] [2025-03-08 21:06:08,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:08,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:08,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:08,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:08,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:08,543 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-08 21:06:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:08,825 INFO L93 Difference]: Finished difference Result 1396 states and 1848 transitions. [2025-03-08 21:06:08,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:08,825 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-08 21:06:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:08,836 INFO L225 Difference]: With dead ends: 1396 [2025-03-08 21:06:08,837 INFO L226 Difference]: Without dead ends: 1394 [2025-03-08 21:06:08,838 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-08 21:06:08,839 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:08,839 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.2s Time] [2025-03-08 21:06:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-08 21:06:08,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2025-03-08 21:06:08,908 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-08 21:06:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1846 transitions. [2025-03-08 21:06:08,921 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1846 transitions. Word has length 77 [2025-03-08 21:06:08,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:08,924 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1846 transitions. [2025-03-08 21:06:08,924 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-08 21:06:08,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1846 transitions. [2025-03-08 21:06:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 21:06:08,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:08,926 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-08 21:06:08,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:06:08,926 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-08 21:06:08,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:08,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1066269679, now seen corresponding path program 1 times [2025-03-08 21:06:08,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:08,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670768668] [2025-03-08 21:06:08,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:08,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:09,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 21:06:10,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 21:06:10,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:10,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:10,634 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-08 21:06:10,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:10,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670768668] [2025-03-08 21:06:10,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670768668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:10,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:10,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:10,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033159651] [2025-03-08 21:06:10,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:10,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:10,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:10,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:10,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:10,636 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-08 21:06:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:10,906 INFO L93 Difference]: Finished difference Result 1394 states and 1846 transitions. [2025-03-08 21:06:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:10,907 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-08 21:06:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:10,916 INFO L225 Difference]: With dead ends: 1394 [2025-03-08 21:06:10,916 INFO L226 Difference]: Without dead ends: 1392 [2025-03-08 21:06:10,917 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-08 21:06:10,919 INFO L435 NwaCegarLoop]: 1830 mSDtfsCounter, 1810 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:10,920 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.2s Time] [2025-03-08 21:06:10,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-08 21:06:10,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1392. [2025-03-08 21:06:10,972 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-08 21:06:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1844 transitions. [2025-03-08 21:06:10,983 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1844 transitions. Word has length 83 [2025-03-08 21:06:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:10,984 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1844 transitions. [2025-03-08 21:06:10,984 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-08 21:06:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1844 transitions. [2025-03-08 21:06:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 21:06:10,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:06:10,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:06:10,988 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-08 21:06:10,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:10,989 INFO L85 PathProgramCache]: Analyzing trace with hash 279720821, now seen corresponding path program 1 times [2025-03-08 21:06:10,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:10,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355112192] [2025-03-08 21:06:10,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:10,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:11,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 21:06:11,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 21:06:11,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:11,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:12,409 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-08 21:06:12,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:12,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355112192] [2025-03-08 21:06:12,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355112192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:12,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:12,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:12,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319465296] [2025-03-08 21:06:12,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:12,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:12,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:12,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:12,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:12,411 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-08 21:06:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:12,663 INFO L93 Difference]: Finished difference Result 1392 states and 1844 transitions. [2025-03-08 21:06:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:12,663 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-08 21:06:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:12,672 INFO L225 Difference]: With dead ends: 1392 [2025-03-08 21:06:12,672 INFO L226 Difference]: Without dead ends: 1390 [2025-03-08 21:06:12,673 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-08 21:06:12,673 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-08 21:06:12,674 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-08 21:06:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-03-08 21:06:12,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1390. [2025-03-08 21:06:12,729 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-08 21:06:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1842 transitions. [2025-03-08 21:06:12,740 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1842 transitions. Word has length 89 [2025-03-08 21:06:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:12,741 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 1842 transitions. [2025-03-08 21:06:12,741 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-08 21:06:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1842 transitions. [2025-03-08 21:06:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 21:06:12,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:12,744 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-08 21:06:12,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:06:12,745 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-08 21:06:12,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:12,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2140818219, now seen corresponding path program 1 times [2025-03-08 21:06:12,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:12,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114196541] [2025-03-08 21:06:12,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:13,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 21:06:13,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 21:06:13,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:13,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:14,244 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-08 21:06:14,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:14,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114196541] [2025-03-08 21:06:14,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114196541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:14,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:14,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:14,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985993719] [2025-03-08 21:06:14,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:14,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:14,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:14,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:14,245 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-08 21:06:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:14,576 INFO L93 Difference]: Finished difference Result 1390 states and 1842 transitions. [2025-03-08 21:06:14,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:14,576 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-08 21:06:14,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:14,583 INFO L225 Difference]: With dead ends: 1390 [2025-03-08 21:06:14,584 INFO L226 Difference]: Without dead ends: 1388 [2025-03-08 21:06:14,584 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-08 21:06:14,586 INFO L435 NwaCegarLoop]: 1826 mSDtfsCounter, 1804 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:14,586 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.2s Time] [2025-03-08 21:06:14,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2025-03-08 21:06:14,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1388. [2025-03-08 21:06:14,641 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-08 21:06:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1840 transitions. [2025-03-08 21:06:14,650 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1840 transitions. Word has length 95 [2025-03-08 21:06:14,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:14,651 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1840 transitions. [2025-03-08 21:06:14,651 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-08 21:06:14,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1840 transitions. [2025-03-08 21:06:14,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 21:06:14,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:14,652 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-08 21:06:14,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:06:14,653 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-08 21:06:14,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:14,653 INFO L85 PathProgramCache]: Analyzing trace with hash 359277610, now seen corresponding path program 1 times [2025-03-08 21:06:14,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:14,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417335087] [2025-03-08 21:06:14,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:14,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:15,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 21:06:15,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 21:06:15,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:15,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:15,900 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-08 21:06:15,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:15,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417335087] [2025-03-08 21:06:15,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417335087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:15,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:15,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:15,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677622463] [2025-03-08 21:06:15,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:15,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:15,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:15,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:15,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:15,901 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-08 21:06:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:16,135 INFO L93 Difference]: Finished difference Result 1388 states and 1840 transitions. [2025-03-08 21:06:16,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:16,136 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-08 21:06:16,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:16,142 INFO L225 Difference]: With dead ends: 1388 [2025-03-08 21:06:16,142 INFO L226 Difference]: Without dead ends: 1386 [2025-03-08 21:06:16,143 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-08 21:06:16,143 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-08 21:06:16,143 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-08 21:06:16,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2025-03-08 21:06:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1386. [2025-03-08 21:06:16,195 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-08 21:06:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1838 transitions. [2025-03-08 21:06:16,204 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1838 transitions. Word has length 101 [2025-03-08 21:06:16,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:16,204 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1838 transitions. [2025-03-08 21:06:16,204 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-08 21:06:16,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1838 transitions. [2025-03-08 21:06:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 21:06:16,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:16,207 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-08 21:06:16,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:06:16,207 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-08 21:06:16,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash -148057843, now seen corresponding path program 1 times [2025-03-08 21:06:16,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:16,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88304815] [2025-03-08 21:06:16,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:16,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:17,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 21:06:17,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 21:06:17,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:17,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:17,432 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-08 21:06:17,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:17,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88304815] [2025-03-08 21:06:17,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88304815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:17,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:17,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:17,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158502106] [2025-03-08 21:06:17,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:17,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:17,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:17,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:17,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:17,433 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-08 21:06:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:17,702 INFO L93 Difference]: Finished difference Result 1386 states and 1838 transitions. [2025-03-08 21:06:17,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:17,707 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-08 21:06:17,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:17,719 INFO L225 Difference]: With dead ends: 1386 [2025-03-08 21:06:17,719 INFO L226 Difference]: Without dead ends: 1384 [2025-03-08 21:06:17,720 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-08 21:06:17,721 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-08 21:06:17,722 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-08 21:06:17,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-03-08 21:06:17,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2025-03-08 21:06:17,808 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-08 21:06:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1836 transitions. [2025-03-08 21:06:17,816 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1836 transitions. Word has length 107 [2025-03-08 21:06:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:17,816 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1836 transitions. [2025-03-08 21:06:17,816 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-08 21:06:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1836 transitions. [2025-03-08 21:06:17,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 21:06:17,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:17,818 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-08 21:06:17,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:06:17,819 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-08 21:06:17,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:17,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1222619349, now seen corresponding path program 1 times [2025-03-08 21:06:17,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:17,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638193663] [2025-03-08 21:06:17,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:17,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:18,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 21:06:18,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 21:06:18,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:18,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:18,949 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-08 21:06:18,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:18,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638193663] [2025-03-08 21:06:18,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638193663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:18,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:18,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:18,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257512432] [2025-03-08 21:06:18,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:18,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:18,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:18,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:18,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:18,951 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-08 21:06:19,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:19,190 INFO L93 Difference]: Finished difference Result 1384 states and 1836 transitions. [2025-03-08 21:06:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:19,191 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-08 21:06:19,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:19,200 INFO L225 Difference]: With dead ends: 1384 [2025-03-08 21:06:19,200 INFO L226 Difference]: Without dead ends: 1382 [2025-03-08 21:06:19,201 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-08 21:06:19,202 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-08 21:06:19,202 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-08 21:06:19,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2025-03-08 21:06:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1382. [2025-03-08 21:06:19,265 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-08 21:06:19,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1834 transitions. [2025-03-08 21:06:19,273 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1834 transitions. Word has length 113 [2025-03-08 21:06:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:19,274 INFO L471 AbstractCegarLoop]: Abstraction has 1382 states and 1834 transitions. [2025-03-08 21:06:19,274 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-08 21:06:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1834 transitions. [2025-03-08 21:06:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 21:06:19,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:19,277 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-08 21:06:19,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:06:19,277 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-08 21:06:19,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2094186360, now seen corresponding path program 1 times [2025-03-08 21:06:19,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:19,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57845010] [2025-03-08 21:06:19,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:19,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:20,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 21:06:20,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 21:06:20,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:20,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:20,430 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-08 21:06:20,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:20,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57845010] [2025-03-08 21:06:20,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57845010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:20,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:20,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:06:20,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223105410] [2025-03-08 21:06:20,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:20,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:06:20,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:20,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:06:20,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:06:20,432 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-08 21:06:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:20,636 INFO L93 Difference]: Finished difference Result 2551 states and 3362 transitions. [2025-03-08 21:06:20,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:06:20,637 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-08 21:06:20,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:20,647 INFO L225 Difference]: With dead ends: 2551 [2025-03-08 21:06:20,647 INFO L226 Difference]: Without dead ends: 1378 [2025-03-08 21:06:20,651 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-08 21:06:20,652 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-08 21:06:20,652 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-08 21:06:20,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2025-03-08 21:06:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2025-03-08 21:06:20,728 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-08 21:06:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1829 transitions. [2025-03-08 21:06:20,736 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1829 transitions. Word has length 155 [2025-03-08 21:06:20,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:20,737 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1829 transitions. [2025-03-08 21:06:20,737 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-08 21:06:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1829 transitions. [2025-03-08 21:06:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 21:06:20,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:20,743 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-08 21:06:20,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:06:20,743 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-08 21:06:20,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:20,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1883796720, now seen corresponding path program 1 times [2025-03-08 21:06:20,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:20,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992619023] [2025-03-08 21:06:20,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:20,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:21,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 21:06:21,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 21:06:21,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:21,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:21,793 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-08 21:06:21,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:21,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992619023] [2025-03-08 21:06:21,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992619023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:21,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:21,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:21,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172715949] [2025-03-08 21:06:21,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:21,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:21,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:21,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:21,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:21,795 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-08 21:06:22,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:22,013 INFO L93 Difference]: Finished difference Result 1378 states and 1829 transitions. [2025-03-08 21:06:22,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:22,013 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-08 21:06:22,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:22,022 INFO L225 Difference]: With dead ends: 1378 [2025-03-08 21:06:22,022 INFO L226 Difference]: Without dead ends: 1376 [2025-03-08 21:06:22,023 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-08 21:06:22,025 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-08 21:06:22,025 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-08 21:06:22,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2025-03-08 21:06:22,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2025-03-08 21:06:22,133 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-08 21:06:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1827 transitions. [2025-03-08 21:06:22,145 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1827 transitions. Word has length 115 [2025-03-08 21:06:22,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:22,145 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 1827 transitions. [2025-03-08 21:06:22,145 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-08 21:06:22,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1827 transitions. [2025-03-08 21:06:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 21:06:22,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:22,149 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-08 21:06:22,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:06:22,149 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-08 21:06:22,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:22,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1243086519, now seen corresponding path program 1 times [2025-03-08 21:06:22,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:22,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585535864] [2025-03-08 21:06:22,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:22,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:23,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 21:06:23,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 21:06:23,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:23,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:23,465 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-08 21:06:23,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:23,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585535864] [2025-03-08 21:06:23,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585535864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:06:23,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448523714] [2025-03-08 21:06:23,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:23,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:06:23,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:06:23,467 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-08 21:06:23,468 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-08 21:06:24,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 21:06:25,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 21:06:25,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:25,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:25,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 2866 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 21:06:25,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:06:25,342 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-08 21:06:25,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:06:25,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448523714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:25,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:06:25,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 21:06:25,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974573800] [2025-03-08 21:06:25,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:25,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:06:25,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:25,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:06:25,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:06:25,343 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-08 21:06:25,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:25,567 INFO L93 Difference]: Finished difference Result 2592 states and 3414 transitions. [2025-03-08 21:06:25,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:06:25,567 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-08 21:06:25,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:25,576 INFO L225 Difference]: With dead ends: 2592 [2025-03-08 21:06:25,576 INFO L226 Difference]: Without dead ends: 1428 [2025-03-08 21:06:25,580 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-08 21:06:25,581 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-08 21:06:25,581 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-08 21:06:25,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-03-08 21:06:25,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1425. [2025-03-08 21:06:25,656 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-08 21:06:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1887 transitions. [2025-03-08 21:06:25,665 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1887 transitions. Word has length 161 [2025-03-08 21:06:25,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:25,665 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 1887 transitions. [2025-03-08 21:06:25,665 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-08 21:06:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1887 transitions. [2025-03-08 21:06:25,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 21:06:25,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:25,667 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-08 21:06:25,685 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-08 21:06:25,867 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-08 21:06:25,868 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-08 21:06:25,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:25,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1245712580, now seen corresponding path program 1 times [2025-03-08 21:06:25,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:25,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139406203] [2025-03-08 21:06:25,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:25,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:26,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 21:06:26,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 21:06:26,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:26,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:27,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-08 21:06:27,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:27,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139406203] [2025-03-08 21:06:27,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139406203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:27,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:27,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:27,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001315779] [2025-03-08 21:06:27,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:27,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:27,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:27,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:27,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:27,157 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-08 21:06:27,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:27,425 INFO L93 Difference]: Finished difference Result 1425 states and 1887 transitions. [2025-03-08 21:06:27,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:27,425 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-08 21:06:27,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:27,434 INFO L225 Difference]: With dead ends: 1425 [2025-03-08 21:06:27,434 INFO L226 Difference]: Without dead ends: 1423 [2025-03-08 21:06:27,435 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-08 21:06:27,436 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:27,436 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.2s Time] [2025-03-08 21:06:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2025-03-08 21:06:27,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1423. [2025-03-08 21:06:27,556 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-08 21:06:27,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1885 transitions. [2025-03-08 21:06:27,564 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1885 transitions. Word has length 121 [2025-03-08 21:06:27,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:27,564 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 1885 transitions. [2025-03-08 21:06:27,564 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-08 21:06:27,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1885 transitions. [2025-03-08 21:06:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 21:06:27,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:27,566 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-08 21:06:27,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:06:27,566 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-08 21:06:27,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:27,567 INFO L85 PathProgramCache]: Analyzing trace with hash -310880044, now seen corresponding path program 1 times [2025-03-08 21:06:27,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:27,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684840505] [2025-03-08 21:06:27,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:27,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:28,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 21:06:28,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 21:06:28,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:28,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:29,095 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-08 21:06:29,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:29,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684840505] [2025-03-08 21:06:29,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684840505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:29,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:29,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:06:29,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524872057] [2025-03-08 21:06:29,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:29,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:06:29,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:29,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:06:29,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:29,097 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-08 21:06:29,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:29,585 INFO L93 Difference]: Finished difference Result 1651 states and 2112 transitions. [2025-03-08 21:06:29,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:06:29,586 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-08 21:06:29,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:29,594 INFO L225 Difference]: With dead ends: 1651 [2025-03-08 21:06:29,594 INFO L226 Difference]: Without dead ends: 1649 [2025-03-08 21:06:29,595 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-08 21:06:29,596 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-08 21:06:29,596 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-08 21:06:29,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-03-08 21:06:29,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1635. [2025-03-08 21:06:29,691 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-08 21:06:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2103 transitions. [2025-03-08 21:06:29,701 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2103 transitions. Word has length 153 [2025-03-08 21:06:29,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:29,701 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2103 transitions. [2025-03-08 21:06:29,702 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-08 21:06:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2103 transitions. [2025-03-08 21:06:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 21:06:29,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:29,704 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-08 21:06:29,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 21:06:29,704 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-08 21:06:29,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:29,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1831618451, now seen corresponding path program 1 times [2025-03-08 21:06:29,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:29,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094455684] [2025-03-08 21:06:29,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:29,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:30,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 21:06:30,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 21:06:30,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:30,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:31,636 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-08 21:06:31,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:31,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094455684] [2025-03-08 21:06:31,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094455684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:31,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:31,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:06:31,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066833324] [2025-03-08 21:06:31,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:31,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:06:31,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:31,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:06:31,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:06:31,638 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-08 21:06:35,665 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-08 21:06:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:41,518 INFO L93 Difference]: Finished difference Result 3160 states and 4077 transitions. [2025-03-08 21:06:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:06:41,519 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-08 21:06:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:41,530 INFO L225 Difference]: With dead ends: 3160 [2025-03-08 21:06:41,530 INFO L226 Difference]: Without dead ends: 1635 [2025-03-08 21:06:41,536 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-08 21:06:41,537 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 1776 mSDsluCounter, 4622 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1777 SdHoareTripleChecker+Valid, 6426 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:41,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1777 Valid, 6426 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 845 Invalid, 1 Unknown, 0 Unchecked, 9.4s Time] [2025-03-08 21:06:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2025-03-08 21:06:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1635. [2025-03-08 21:06:41,682 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-08 21:06:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2101 transitions. [2025-03-08 21:06:41,691 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2101 transitions. Word has length 166 [2025-03-08 21:06:41,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:41,693 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2101 transitions. [2025-03-08 21:06:41,693 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-08 21:06:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2101 transitions. [2025-03-08 21:06:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 21:06:41,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:41,696 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-08 21:06:41,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:06:41,696 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-08 21:06:41,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:41,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1831588660, now seen corresponding path program 1 times [2025-03-08 21:06:41,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:41,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773979546] [2025-03-08 21:06:41,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:41,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:42,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 21:06:42,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 21:06:42,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:42,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:42,928 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-08 21:06:42,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:42,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773979546] [2025-03-08 21:06:42,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773979546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:42,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:42,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:42,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47879705] [2025-03-08 21:06:42,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:42,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:42,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:42,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:42,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:42,932 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-08 21:06:43,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:43,355 INFO L93 Difference]: Finished difference Result 1635 states and 2101 transitions. [2025-03-08 21:06:43,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:43,356 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-08 21:06:43,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:43,365 INFO L225 Difference]: With dead ends: 1635 [2025-03-08 21:06:43,365 INFO L226 Difference]: Without dead ends: 1633 [2025-03-08 21:06:43,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:43,368 INFO L435 NwaCegarLoop]: 1803 mSDtfsCounter, 0 mSDsluCounter, 3603 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:43,368 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.3s Time] [2025-03-08 21:06:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2025-03-08 21:06:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2025-03-08 21:06:43,462 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-08 21:06:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2098 transitions. [2025-03-08 21:06:43,469 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2098 transitions. Word has length 166 [2025-03-08 21:06:43,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:43,470 INFO L471 AbstractCegarLoop]: Abstraction has 1633 states and 2098 transitions. [2025-03-08 21:06:43,470 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-08 21:06:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2098 transitions. [2025-03-08 21:06:43,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 21:06:43,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:43,471 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-08 21:06:43,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:06:43,472 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-08 21:06:43,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:43,472 INFO L85 PathProgramCache]: Analyzing trace with hash -960856330, now seen corresponding path program 1 times [2025-03-08 21:06:43,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:43,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191777577] [2025-03-08 21:06:43,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:44,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 21:06:44,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 21:06:44,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:44,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:44,831 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-08 21:06:44,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:44,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191777577] [2025-03-08 21:06:44,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191777577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:44,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:44,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:44,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613000914] [2025-03-08 21:06:44,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:44,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:44,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:44,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:44,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:44,832 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-08 21:06:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:45,173 INFO L93 Difference]: Finished difference Result 1633 states and 2098 transitions. [2025-03-08 21:06:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:45,175 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-08 21:06:45,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:45,185 INFO L225 Difference]: With dead ends: 1633 [2025-03-08 21:06:45,186 INFO L226 Difference]: Without dead ends: 1631 [2025-03-08 21:06:45,187 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-08 21:06:45,188 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 1774 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:45,188 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.2s Time] [2025-03-08 21:06:45,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2025-03-08 21:06:45,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2025-03-08 21:06:45,301 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-08 21:06:45,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2096 transitions. [2025-03-08 21:06:45,307 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2096 transitions. Word has length 127 [2025-03-08 21:06:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:45,308 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2096 transitions. [2025-03-08 21:06:45,308 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-08 21:06:45,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2096 transitions. [2025-03-08 21:06:45,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-08 21:06:45,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:45,311 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-08 21:06:45,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:06:45,311 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-08 21:06:45,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:45,312 INFO L85 PathProgramCache]: Analyzing trace with hash 515652897, now seen corresponding path program 1 times [2025-03-08 21:06:45,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:45,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935392293] [2025-03-08 21:06:45,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:45,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:46,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 21:06:46,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 21:06:46,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:46,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:46,355 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-08 21:06:46,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:46,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935392293] [2025-03-08 21:06:46,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935392293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:46,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:46,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:06:46,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332989460] [2025-03-08 21:06:46,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:46,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:06:46,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:46,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:06:46,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:06:46,356 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-08 21:06:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:46,552 INFO L93 Difference]: Finished difference Result 3146 states and 4056 transitions. [2025-03-08 21:06:46,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:06:46,553 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-08 21:06:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:46,561 INFO L225 Difference]: With dead ends: 3146 [2025-03-08 21:06:46,561 INFO L226 Difference]: Without dead ends: 1625 [2025-03-08 21:06:46,564 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-08 21:06:46,565 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-08 21:06:46,565 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-08 21:06:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2025-03-08 21:06:46,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1625. [2025-03-08 21:06:46,658 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-08 21:06:46,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2087 transitions. [2025-03-08 21:06:46,663 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2087 transitions. Word has length 173 [2025-03-08 21:06:46,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:46,663 INFO L471 AbstractCegarLoop]: Abstraction has 1625 states and 2087 transitions. [2025-03-08 21:06:46,664 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-08 21:06:46,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2087 transitions. [2025-03-08 21:06:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 21:06:46,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:46,665 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-08 21:06:46,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 21:06:46,665 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-08 21:06:46,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:46,666 INFO L85 PathProgramCache]: Analyzing trace with hash 600407234, now seen corresponding path program 1 times [2025-03-08 21:06:46,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:46,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134161080] [2025-03-08 21:06:46,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:46,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:47,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 21:06:47,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 21:06:47,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:47,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:47,816 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-08 21:06:47,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:47,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134161080] [2025-03-08 21:06:47,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134161080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:47,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:47,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:06:47,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444700455] [2025-03-08 21:06:47,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:47,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:06:47,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:47,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:06:47,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:47,818 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-08 21:06:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:48,303 INFO L93 Difference]: Finished difference Result 1653 states and 2111 transitions. [2025-03-08 21:06:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:06:48,304 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-08 21:06:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:48,318 INFO L225 Difference]: With dead ends: 1653 [2025-03-08 21:06:48,318 INFO L226 Difference]: Without dead ends: 1651 [2025-03-08 21:06:48,319 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-08 21:06:48,319 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-08 21:06:48,320 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-08 21:06:48,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2025-03-08 21:06:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1649. [2025-03-08 21:06:48,429 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-08 21:06:48,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2107 transitions. [2025-03-08 21:06:48,436 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2107 transitions. Word has length 164 [2025-03-08 21:06:48,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:48,437 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2107 transitions. [2025-03-08 21:06:48,437 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-08 21:06:48,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2107 transitions. [2025-03-08 21:06:48,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 21:06:48,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:48,440 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-08 21:06:48,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 21:06:48,440 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-08 21:06:48,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:48,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1529834684, now seen corresponding path program 1 times [2025-03-08 21:06:48,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:48,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594343805] [2025-03-08 21:06:48,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:48,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:49,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 21:06:49,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 21:06:49,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:49,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:49,571 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-08 21:06:49,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:49,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594343805] [2025-03-08 21:06:49,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594343805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:49,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:49,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:49,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501930582] [2025-03-08 21:06:49,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:49,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:49,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:49,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:49,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:49,573 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-08 21:06:49,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:49,899 INFO L93 Difference]: Finished difference Result 1649 states and 2107 transitions. [2025-03-08 21:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:49,899 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-08 21:06:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:49,910 INFO L225 Difference]: With dead ends: 1649 [2025-03-08 21:06:49,910 INFO L226 Difference]: Without dead ends: 1647 [2025-03-08 21:06:49,911 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-08 21:06:49,912 INFO L435 NwaCegarLoop]: 1794 mSDtfsCounter, 1766 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:49,912 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.2s Time] [2025-03-08 21:06:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2025-03-08 21:06:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2025-03-08 21:06:50,078 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-08 21:06:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2105 transitions. [2025-03-08 21:06:50,089 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2105 transitions. Word has length 133 [2025-03-08 21:06:50,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:50,091 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2105 transitions. [2025-03-08 21:06:50,091 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-08 21:06:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2105 transitions. [2025-03-08 21:06:50,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 21:06:50,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:50,094 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-08 21:06:50,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 21:06:50,094 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-08 21:06:50,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:50,095 INFO L85 PathProgramCache]: Analyzing trace with hash -800275160, now seen corresponding path program 1 times [2025-03-08 21:06:50,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:50,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645471087] [2025-03-08 21:06:50,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:50,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:51,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 21:06:51,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 21:06:51,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:51,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:51,421 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-08 21:06:51,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:51,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645471087] [2025-03-08 21:06:51,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645471087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:51,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:51,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:51,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840237167] [2025-03-08 21:06:51,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:51,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:51,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:51,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:51,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:51,422 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-08 21:06:51,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:51,718 INFO L93 Difference]: Finished difference Result 1647 states and 2105 transitions. [2025-03-08 21:06:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:51,718 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-08 21:06:51,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:51,726 INFO L225 Difference]: With dead ends: 1647 [2025-03-08 21:06:51,726 INFO L226 Difference]: Without dead ends: 1645 [2025-03-08 21:06:51,727 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-08 21:06:51,727 INFO L435 NwaCegarLoop]: 1792 mSDtfsCounter, 1763 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:51,727 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.2s Time] [2025-03-08 21:06:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2025-03-08 21:06:51,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1645. [2025-03-08 21:06:51,841 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-08 21:06:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2103 transitions. [2025-03-08 21:06:51,848 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2103 transitions. Word has length 139 [2025-03-08 21:06:51,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:51,849 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 2103 transitions. [2025-03-08 21:06:51,849 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-08 21:06:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2103 transitions. [2025-03-08 21:06:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 21:06:51,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:51,851 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-08 21:06:51,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 21:06:51,851 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-08 21:06:51,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:51,851 INFO L85 PathProgramCache]: Analyzing trace with hash -198478950, now seen corresponding path program 1 times [2025-03-08 21:06:51,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:51,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642683996] [2025-03-08 21:06:51,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:51,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:52,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 21:06:52,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 21:06:52,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:52,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:53,037 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-08 21:06:53,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:53,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642683996] [2025-03-08 21:06:53,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642683996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:53,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:53,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:53,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730036023] [2025-03-08 21:06:53,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:53,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:53,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:53,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:53,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:53,038 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-08 21:06:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:53,323 INFO L93 Difference]: Finished difference Result 1645 states and 2103 transitions. [2025-03-08 21:06:53,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:53,323 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-08 21:06:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:53,330 INFO L225 Difference]: With dead ends: 1645 [2025-03-08 21:06:53,330 INFO L226 Difference]: Without dead ends: 1643 [2025-03-08 21:06:53,330 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-08 21:06:53,331 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:53,331 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.1s Time] [2025-03-08 21:06:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2025-03-08 21:06:53,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1643. [2025-03-08 21:06:53,436 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-08 21:06:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2101 transitions. [2025-03-08 21:06:53,443 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2101 transitions. Word has length 145 [2025-03-08 21:06:53,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:53,443 INFO L471 AbstractCegarLoop]: Abstraction has 1643 states and 2101 transitions. [2025-03-08 21:06:53,443 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-08 21:06:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2101 transitions. [2025-03-08 21:06:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 21:06:53,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:53,445 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-08 21:06:53,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 21:06:53,445 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-08 21:06:53,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:53,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1115319793, now seen corresponding path program 1 times [2025-03-08 21:06:53,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:53,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928689417] [2025-03-08 21:06:53,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:53,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:54,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 21:06:54,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 21:06:54,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:54,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:54,598 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-08 21:06:54,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:54,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928689417] [2025-03-08 21:06:54,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928689417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:54,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:54,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:54,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569219406] [2025-03-08 21:06:54,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:54,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:54,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:54,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:54,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:54,599 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-08 21:06:54,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:54,919 INFO L93 Difference]: Finished difference Result 1643 states and 2101 transitions. [2025-03-08 21:06:54,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:54,920 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-08 21:06:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:54,926 INFO L225 Difference]: With dead ends: 1643 [2025-03-08 21:06:54,926 INFO L226 Difference]: Without dead ends: 1641 [2025-03-08 21:06:54,926 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-08 21:06:54,929 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:54,929 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.2s Time] [2025-03-08 21:06:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2025-03-08 21:06:55,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1641. [2025-03-08 21:06:55,072 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-08 21:06:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2099 transitions. [2025-03-08 21:06:55,078 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2099 transitions. Word has length 151 [2025-03-08 21:06:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:55,078 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2099 transitions. [2025-03-08 21:06:55,078 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-08 21:06:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2099 transitions. [2025-03-08 21:06:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 21:06:55,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:55,081 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-08 21:06:55,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 21:06:55,081 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-08 21:06:55,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:55,081 INFO L85 PathProgramCache]: Analyzing trace with hash 637303612, now seen corresponding path program 1 times [2025-03-08 21:06:55,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:55,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322702383] [2025-03-08 21:06:55,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:55,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:55,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 21:06:55,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 21:06:55,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:55,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:56,351 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-08 21:06:56,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:56,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322702383] [2025-03-08 21:06:56,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322702383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:56,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:56,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:06:56,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740530877] [2025-03-08 21:06:56,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:56,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:06:56,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:56,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:06:56,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:56,353 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-08 21:07:00,433 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-08 21:07:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:01,068 INFO L93 Difference]: Finished difference Result 1643 states and 2100 transitions. [2025-03-08 21:07:01,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:07:01,068 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-08 21:07:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:01,075 INFO L225 Difference]: With dead ends: 1643 [2025-03-08 21:07:01,075 INFO L226 Difference]: Without dead ends: 1641 [2025-03-08 21:07:01,076 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-08 21:07:01,077 INFO L435 NwaCegarLoop]: 1789 mSDtfsCounter, 43 mSDsluCounter, 5315 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:01,078 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.5s Time] [2025-03-08 21:07:01,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2025-03-08 21:07:01,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1641. [2025-03-08 21:07:01,206 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-08 21:07:01,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2097 transitions. [2025-03-08 21:07:01,213 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2097 transitions. Word has length 187 [2025-03-08 21:07:01,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:01,214 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2097 transitions. [2025-03-08 21:07:01,214 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-08 21:07:01,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2097 transitions. [2025-03-08 21:07:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 21:07:01,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:01,217 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-08 21:07:01,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 21:07:01,217 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-08 21:07:01,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:01,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1385860507, now seen corresponding path program 1 times [2025-03-08 21:07:01,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:01,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20429532] [2025-03-08 21:07:01,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:01,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:01,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 21:07:02,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 21:07:02,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:02,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:02,587 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-08 21:07:02,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:02,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20429532] [2025-03-08 21:07:02,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20429532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:02,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:02,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:02,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234346951] [2025-03-08 21:07:02,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:02,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:02,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:02,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:02,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:02,590 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-08 21:07:02,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:02,938 INFO L93 Difference]: Finished difference Result 1641 states and 2097 transitions. [2025-03-08 21:07:02,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:02,939 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-08 21:07:02,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:02,945 INFO L225 Difference]: With dead ends: 1641 [2025-03-08 21:07:02,945 INFO L226 Difference]: Without dead ends: 1639 [2025-03-08 21:07:02,946 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-08 21:07:02,947 INFO L435 NwaCegarLoop]: 1786 mSDtfsCounter, 1754 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:02,947 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.2s Time] [2025-03-08 21:07:02,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2025-03-08 21:07:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1639. [2025-03-08 21:07:03,066 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-08 21:07:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2095 transitions. [2025-03-08 21:07:03,073 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2095 transitions. Word has length 157 [2025-03-08 21:07:03,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:03,073 INFO L471 AbstractCegarLoop]: Abstraction has 1639 states and 2095 transitions. [2025-03-08 21:07:03,073 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-08 21:07:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2095 transitions. [2025-03-08 21:07:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 21:07:03,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:03,076 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-08 21:07:03,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 21:07:03,076 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-08 21:07:03,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:03,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1885038272, now seen corresponding path program 1 times [2025-03-08 21:07:03,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:03,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162423875] [2025-03-08 21:07:03,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:03,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:03,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 21:07:03,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 21:07:03,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:03,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:04,197 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-08 21:07:04,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:04,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162423875] [2025-03-08 21:07:04,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162423875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:04,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:04,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:04,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207864871] [2025-03-08 21:07:04,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:04,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:04,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:04,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:04,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:04,199 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-08 21:07:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:04,549 INFO L93 Difference]: Finished difference Result 1639 states and 2095 transitions. [2025-03-08 21:07:04,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:04,550 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-08 21:07:04,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:04,556 INFO L225 Difference]: With dead ends: 1639 [2025-03-08 21:07:04,556 INFO L226 Difference]: Without dead ends: 1637 [2025-03-08 21:07:04,557 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-08 21:07:04,557 INFO L435 NwaCegarLoop]: 1784 mSDtfsCounter, 1751 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:04,557 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.2s Time] [2025-03-08 21:07:04,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2025-03-08 21:07:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1637. [2025-03-08 21:07:04,703 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-08 21:07:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2093 transitions. [2025-03-08 21:07:04,708 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2093 transitions. Word has length 163 [2025-03-08 21:07:04,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:04,709 INFO L471 AbstractCegarLoop]: Abstraction has 1637 states and 2093 transitions. [2025-03-08 21:07:04,709 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-08 21:07:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2093 transitions. [2025-03-08 21:07:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 21:07:04,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:04,711 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-08 21:07:04,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 21:07:04,711 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-08 21:07:04,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:04,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1748505780, now seen corresponding path program 1 times [2025-03-08 21:07:04,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:04,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298893259] [2025-03-08 21:07:04,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:04,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:05,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 21:07:05,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 21:07:05,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:05,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat