./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 10:13:14,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:13:14,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 10:13:14,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:13:14,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:13:14,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:13:14,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:13:14,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:13:14,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:13:14,752 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:13:14,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:13:14,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:13:14,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:13:14,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:13:14,753 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:13:14,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:13:14,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:13:14,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:13:14,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:13:14,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:13:14,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:13:14,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:13:14,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:13:14,754 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:13:14,754 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:13:14,754 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:13:14,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:13:14,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:13:14,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:13:14,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:13:14,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:13:14,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:13:14,755 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:13:14,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:13:14,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:13:14,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:13:14,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:13:14,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:13:14,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:13:14,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:13:14,755 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-17 10:13:14,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:13:14,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:13:14,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:13:14,982 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:13:14,982 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:13:14,983 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-17 10:13:16,093 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a54a3246/4dc3b5d490b84084b072eb68e9f8e74a/FLAG0c67167e5 [2025-03-17 10:13:16,693 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:13:16,694 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-17 10:13:16,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a54a3246/4dc3b5d490b84084b072eb68e9f8e74a/FLAG0c67167e5 [2025-03-17 10:13:17,171 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a54a3246/4dc3b5d490b84084b072eb68e9f8e74a [2025-03-17 10:13:17,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:13:17,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:13:17,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:13:17,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:13:17,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:13:17,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:13:17" (1/1) ... [2025-03-17 10:13:17,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a5fe92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:17, skipping insertion in model container [2025-03-17 10:13:17,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:13:17" (1/1) ... [2025-03-17 10:13:17,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:13:19,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,007 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,007 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,007 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,007 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,014 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,014 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,014 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,014 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,016 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,016 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,019 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,019 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,019 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,019 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,019 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,020 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,021 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,021 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,021 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,022 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,022 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,022 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,022 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,026 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,026 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,026 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,026 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,026 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,027 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,027 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,027 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,027 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,028 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,028 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,028 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,028 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:13:19,069 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:13:19,161 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-17 10:13:19,163 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-17 10:13:19,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [4191] [2025-03-17 10:13:19,274 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,275 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,275 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,275 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,275 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,276 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,276 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,277 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,277 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,277 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,277 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,279 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,280 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,281 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,281 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,281 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,283 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,283 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,283 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,283 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,284 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,285 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,286 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,286 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,290 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,290 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,290 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,290 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,293 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,293 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,293 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,293 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,293 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,293 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,293 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,293 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,297 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,297 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,297 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,297 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,297 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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-17 10:13:19,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:13:19,418 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:13:19,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:19 WrapperNode [2025-03-17 10:13:19,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:13:19,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:13:19,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:13:19,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:13:19,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:19" (1/1) ... [2025-03-17 10:13:19,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:19" (1/1) ... [2025-03-17 10:13:19,587 INFO L138 Inliner]: procedures = 592, calls = 1952, calls flagged for inlining = 265, calls inlined = 171, statements flattened = 3426 [2025-03-17 10:13:19,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:13:19,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:13:19,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:13:19,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:13:19,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:19" (1/1) ... [2025-03-17 10:13:19,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:19" (1/1) ... [2025-03-17 10:13:19,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:19" (1/1) ... [2025-03-17 10:13:20,043 INFO L175 MemorySlicer]: Split 593 memory accesses to 24 slices as follows [10, 2, 8, 8, 31, 8, 8, 2, 8, 8, 7, 8, 1, 2, 305, 23, 4, 49, 8, 56, 4, 3, 22, 8]. 51 percent of accesses are in the largest equivalence class. The 181 initializations are split as follows [10, 0, 8, 8, 0, 8, 8, 0, 8, 8, 0, 8, 1, 2, 36, 0, 0, 0, 8, 56, 4, 0, 0, 8]. The 239 writes are split as follows [0, 1, 0, 0, 31, 0, 0, 0, 0, 0, 6, 0, 0, 0, 113, 23, 1, 42, 0, 0, 0, 0, 22, 0]. [2025-03-17 10:13:20,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:19" (1/1) ... [2025-03-17 10:13:20,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:19" (1/1) ... [2025-03-17 10:13:20,130 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:19" (1/1) ... [2025-03-17 10:13:20,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:19" (1/1) ... [2025-03-17 10:13:20,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:19" (1/1) ... [2025-03-17 10:13:20,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:19" (1/1) ... [2025-03-17 10:13:20,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:13:20,195 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:13:20,195 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:13:20,195 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:13:20,195 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:19" (1/1) ... [2025-03-17 10:13:20,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:13:20,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:13:20,223 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-17 10:13:20,228 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-17 10:13:20,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-03-17 10:13:20,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-03-17 10:13:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-17 10:13:20,245 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-17 10:13:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure recover_from_urb_loss [2025-03-17 10:13:20,245 INFO L138 BoogieDeclarations]: Found implementation of procedure recover_from_urb_loss [2025-03-17 10:13:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_control_urb [2025-03-17 10:13:20,245 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_control_urb [2025-03-17 10:13:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 10:13:20,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 10:13:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-17 10:13:20,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-17 10:13:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2025-03-17 10:13:20,246 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2025-03-17 10:13:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2025-03-17 10:13:20,246 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2025-03-17 10:13:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-17 10:13:20,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-17 10:13:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-17 10:13:20,246 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-17 10:13:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-03-17 10:13:20,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-03-17 10:13:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-03-17 10:13:20,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-03-17 10:13:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_ioctl [2025-03-17 10:13:20,247 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_ioctl [2025-03-17 10:13:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-17 10:13:20,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-17 10:13:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2025-03-17 10:13:20,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2025-03-17 10:13:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-17 10:13:20,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-17 10:13:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-03-17 10:13:20,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-03-17 10:13:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:13:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2025-03-17 10:13:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2025-03-17 10:13:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-03-17 10:13:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-03-17 10:13:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-17 10:13:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-17 10:13:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-03-17 10:13:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-03-17 10:13:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-17 10:13:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-17 10:13:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2025-03-17 10:13:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2025-03-17 10:13:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-17 10:13:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-17 10:13:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2025-03-17 10:13:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2025-03-17 10:13:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-03-17 10:13:20,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-17 10:13:20,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_111 [2025-03-17 10:13:20,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_111 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-17 10:13:20,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2025-03-17 10:13:20,249 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 10:13:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 10:13:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 10:13:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 10:13:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 10:13:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-17 10:13:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-17 10:13:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-17 10:13:20,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-17 10:13:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-03-17 10:13:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-03-17 10:13:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-03-17 10:13:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2025-03-17 10:13:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2025-03-17 10:13:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-03-17 10:13:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure kill_urbs [2025-03-17 10:13:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_urbs [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2025-03-17 10:13:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-03-17 10:13:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-03-17 10:13:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-03-17 10:13:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-03-17 10:13:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-17 10:13:20,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2025-03-17 10:13:20,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-17 10:13:20,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-03-17 10:13:20,254 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-17 10:13:20,254 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-03-17 10:13:20,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-03-17 10:13:20,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-03-17 10:13:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_find_device [2025-03-17 10:13:20,254 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_find_device [2025-03-17 10:13:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-17 10:13:20,255 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-17 10:13:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2025-03-17 10:13:20,255 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2025-03-17 10:13:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-03-17 10:13:20,255 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-03-17 10:13:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:13:20,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:13:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure usb_translate_errors [2025-03-17 10:13:20,255 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_translate_errors [2025-03-17 10:13:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 10:13:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 10:13:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 10:13:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 10:13:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 10:13:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 10:13:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-17 10:13:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-17 10:13:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-17 10:13:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-17 10:13:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-17 10:13:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-17 10:13:20,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-17 10:13:20,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_create [2025-03-17 10:13:20,256 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_create [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_128 [2025-03-17 10:13:20,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_128 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-03-17 10:13:20,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2025-03-17 10:13:20,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure clear_wdm_read_flag [2025-03-17 10:13:20,256 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_wdm_read_flag [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-03-17 10:13:20,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-17 10:13:20,256 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-17 10:13:20,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_disconnect [2025-03-17 10:13:20,256 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_disconnect [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-17 10:13:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-17 10:13:20,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-17 10:13:20,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-17 10:13:20,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-17 10:13:20,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-17 10:13:20,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-17 10:13:20,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-17 10:13:20,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2025-03-17 10:13:20,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-17 10:13:20,260 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-17 10:13:20,260 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-03-17 10:13:20,260 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-17 10:13:20,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2025-03-17 10:13:20,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-17 10:13:20,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-17 10:13:20,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-03-17 10:13:20,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-03-17 10:13:20,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-17 10:13:20,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-17 10:13:20,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-17 10:13:20,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-03-17 10:13:20,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-03-17 10:13:20,261 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-03-17 10:13:20,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-03-17 10:13:20,261 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-17 10:13:20,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-17 10:13:20,261 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-17 10:13:20,261 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-17 10:13:20,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2025-03-17 10:13:20,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2025-03-17 10:13:20,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-17 10:13:20,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-17 10:13:20,261 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-17 10:13:20,261 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-17 10:13:20,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-17 10:13:20,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-17 10:13:20,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_95 [2025-03-17 10:13:20,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_95 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_resume [2025-03-17 10:13:20,262 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_resume [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-17 10:13:20,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_96 [2025-03-17 10:13:20,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_96 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2025-03-17 10:13:20,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-03-17 10:13:20,262 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-17 10:13:20,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-17 10:13:20,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-17 10:13:20,262 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 10:13:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 10:13:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 10:13:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 10:13:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 10:13:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-17 10:13:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-17 10:13:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-17 10:13:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-17 10:13:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-17 10:13:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-17 10:13:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-17 10:13:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-17 10:13:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-17 10:13:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-17 10:13:20,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-17 10:13:20,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2025-03-17 10:13:20,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2025-03-17 10:13:20,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_110 [2025-03-17 10:13:20,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_110 [2025-03-17 10:13:20,848 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:13:20,853 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:13:20,907 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-17 10:13:20,946 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7795: havoc ldv_usb_submit_urb_171_#t~nondet522#1; [2025-03-17 10:13:21,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12674: havoc #t~nondet708; [2025-03-17 10:13:21,427 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4389: havoc usb_endpoint_dir_in_#t~mem61#1; [2025-03-17 10:13:21,427 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12690: havoc usb_register_dev_#t~nondet709#1; [2025-03-17 10:13:21,427 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4383: havoc kobject_name_#t~mem60#1.base, kobject_name_#t~mem60#1.offset; [2025-03-17 10:13:21,427 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4425: havoc usb_endpoint_maxp_#t~mem65#1; [2025-03-17 10:13:21,427 INFO L1322 $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-17 10:13:21,427 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4501: havoc dev_name_#t~mem81#1.base, dev_name_#t~mem81#1.offset; [2025-03-17 10:13:21,428 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4395: havoc usb_endpoint_xfer_int_#t~mem62#1; [2025-03-17 10:13:21,475 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7486: havoc ldv_usb_submit_urb_116_#t~nondet512#1; [2025-03-17 10:13:21,526 INFO L1322 $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-17 10:13:21,548 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12631: havoc #t~nondet704; [2025-03-17 10:13:21,585 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12605: havoc #t~nondet702; [2025-03-17 10:13:21,653 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4618: havoc #t~mem107;havoc #t~bitwise108; [2025-03-17 10:13:21,661 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4199: havoc #t~mem5;havoc #t~bitwise6; [2025-03-17 10:13:21,682 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12663: havoc #t~nondet706; [2025-03-17 10:13:21,742 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6487: call ULTIMATE.dealloc(~#descriptor~8.base, ~#descriptor~8.offset);havoc ~#descriptor~8.base, ~#descriptor~8.offset; [2025-03-17 10:13:21,754 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12609: havoc #t~nondet703; [2025-03-17 10:13:26,799 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7468: havoc ldv_usb_submit_urb_113_#t~nondet511#1; [2025-03-17 10:13:26,799 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12659: havoc noop_llseek_#t~nondet705#1; [2025-03-17 10:13:26,799 INFO L1322 $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-17 10:13:26,800 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12694: havoc usb_register_driver_#t~nondet710#1; [2025-03-17 10:13:26,800 INFO L1322 $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-17 10:13:26,800 INFO L1322 $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-17 10:13:26,800 INFO L1322 $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-17 10:13:26,800 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7552: havoc ldv_usb_submit_urb_132_#t~nondet514#1; [2025-03-17 10:13:26,800 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4515: havoc iminor_#t~mem87#1; [2025-03-17 10:13:26,800 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7198-1: ldv_usb_register_driver_#res#1 := ldv_usb_register_driver_~arg0#1; [2025-03-17 10:13:26,800 INFO L1322 $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-17 10:13:26,800 INFO L1322 $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-17 10:13:26,801 INFO L1322 $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-17 10:13:27,145 INFO L? ?]: Removed 1307 outVars from TransFormulas that were not future-live. [2025-03-17 10:13:27,145 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:13:27,188 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:13:27,188 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 10:13:27,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:13:27 BoogieIcfgContainer [2025-03-17 10:13:27,188 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:13:27,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:13:27,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:13:27,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:13:27,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:13:17" (1/3) ... [2025-03-17 10:13:27,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5330a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:13:27, skipping insertion in model container [2025-03-17 10:13:27,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:19" (2/3) ... [2025-03-17 10:13:27,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5330a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:13:27, skipping insertion in model container [2025-03-17 10:13:27,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:13:27" (3/3) ... [2025-03-17 10:13:27,196 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2025-03-17 10:13:27,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:13:27,212 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i that has 98 procedures, 1336 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2025-03-17 10:13:27,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:13:27,372 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;@3d7b232, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:13:27,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-17 10:13:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 1335 states, 809 states have (on average 1.276885043263288) internal successors, (1033), 863 states have internal predecessors, (1033), 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-17 10:13:27,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 10:13:27,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:27,388 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] [2025-03-17 10:13:27,388 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-17 10:13:27,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:27,392 INFO L85 PathProgramCache]: Analyzing trace with hash 315672330, now seen corresponding path program 1 times [2025-03-17 10:13:27,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:27,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897111530] [2025-03-17 10:13:27,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:27,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:28,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 10:13:28,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 10:13:28,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:28,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:29,490 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-17 10:13:29,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:29,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897111530] [2025-03-17 10:13:29,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897111530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:29,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:29,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:29,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823576137] [2025-03-17 10:13:29,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:29,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:29,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:29,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:29,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:29,512 INFO L87 Difference]: Start difference. First operand has 1335 states, 809 states have (on average 1.276885043263288) internal successors, (1033), 863 states have internal predecessors, (1033), 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 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-17 10:13:29,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:29,892 INFO L93 Difference]: Finished difference Result 2609 states and 3715 transitions. [2025-03-17 10:13:29,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:29,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 65 [2025-03-17 10:13:29,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:29,916 INFO L225 Difference]: With dead ends: 2609 [2025-03-17 10:13:29,918 INFO L226 Difference]: Without dead ends: 1318 [2025-03-17 10:13:29,929 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-17 10:13:29,933 INFO L435 NwaCegarLoop]: 1774 mSDtfsCounter, 1762 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 3547 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-17 10:13:29,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1762 Valid, 3547 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:13:29,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-03-17 10:13:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1318. [2025-03-17 10:13:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 800 states have (on average 1.23) internal successors, (984), 849 states have internal predecessors, (984), 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-17 10:13:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1770 transitions. [2025-03-17 10:13:30,061 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1770 transitions. Word has length 65 [2025-03-17 10:13:30,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:30,062 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1770 transitions. [2025-03-17 10:13:30,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-17 10:13:30,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1770 transitions. [2025-03-17 10:13:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 10:13:30,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:30,066 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-17 10:13:30,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:13:30,066 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-17 10:13:30,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:30,067 INFO L85 PathProgramCache]: Analyzing trace with hash -398054052, now seen corresponding path program 1 times [2025-03-17 10:13:30,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:30,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17464605] [2025-03-17 10:13:30,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:30,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:30,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 10:13:31,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 10:13:31,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:31,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:31,505 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-17 10:13:31,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:31,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17464605] [2025-03-17 10:13:31,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17464605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:31,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:31,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:31,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151748837] [2025-03-17 10:13:31,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:31,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:31,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:31,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:31,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:31,509 INFO L87 Difference]: Start difference. First operand 1318 states and 1770 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-17 10:13:31,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:31,749 INFO L93 Difference]: Finished difference Result 1318 states and 1770 transitions. [2025-03-17 10:13:31,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:31,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 71 [2025-03-17 10:13:31,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:31,761 INFO L225 Difference]: With dead ends: 1318 [2025-03-17 10:13:31,761 INFO L226 Difference]: Without dead ends: 1316 [2025-03-17 10:13:31,762 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-17 10:13:31,762 INFO L435 NwaCegarLoop]: 1754 mSDtfsCounter, 1741 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 3507 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-17 10:13:31,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 3507 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:13:31,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2025-03-17 10:13:31,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1316. [2025-03-17 10:13:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 799 states have (on average 1.2290362953692116) internal successors, (982), 847 states have internal predecessors, (982), 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-17 10:13:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1768 transitions. [2025-03-17 10:13:31,843 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1768 transitions. Word has length 71 [2025-03-17 10:13:31,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:31,844 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1768 transitions. [2025-03-17 10:13:31,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-17 10:13:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1768 transitions. [2025-03-17 10:13:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 10:13:31,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:31,846 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-17 10:13:31,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:13:31,846 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-17 10:13:31,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:31,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1775204937, now seen corresponding path program 1 times [2025-03-17 10:13:31,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:31,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628932554] [2025-03-17 10:13:31,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:31,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:32,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 10:13:32,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 10:13:32,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:32,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:33,131 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-17 10:13:33,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:33,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628932554] [2025-03-17 10:13:33,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628932554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:33,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:33,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:33,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534126369] [2025-03-17 10:13:33,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:33,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:33,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:33,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:33,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:33,134 INFO L87 Difference]: Start difference. First operand 1316 states and 1768 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-17 10:13:33,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:33,379 INFO L93 Difference]: Finished difference Result 1316 states and 1768 transitions. [2025-03-17 10:13:33,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:33,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 77 [2025-03-17 10:13:33,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:33,389 INFO L225 Difference]: With dead ends: 1316 [2025-03-17 10:13:33,390 INFO L226 Difference]: Without dead ends: 1314 [2025-03-17 10:13:33,390 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-17 10:13:33,391 INFO L435 NwaCegarLoop]: 1752 mSDtfsCounter, 1738 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 3503 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-17 10:13:33,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 3503 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:13:33,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-03-17 10:13:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1314. [2025-03-17 10:13:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 798 states have (on average 1.2280701754385965) internal successors, (980), 845 states have internal predecessors, (980), 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-17 10:13:33,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1766 transitions. [2025-03-17 10:13:33,457 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1766 transitions. Word has length 77 [2025-03-17 10:13:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:33,457 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1766 transitions. [2025-03-17 10:13:33,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-17 10:13:33,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1766 transitions. [2025-03-17 10:13:33,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 10:13:33,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:33,462 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-17 10:13:33,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:13:33,462 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-17 10:13:33,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:33,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1087859716, now seen corresponding path program 1 times [2025-03-17 10:13:33,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:33,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721114945] [2025-03-17 10:13:33,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:33,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:34,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 10:13:34,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:13:34,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:34,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:34,628 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-17 10:13:34,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:34,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721114945] [2025-03-17 10:13:34,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721114945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:34,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:34,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:34,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765269633] [2025-03-17 10:13:34,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:34,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:34,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:34,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:34,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:34,630 INFO L87 Difference]: Start difference. First operand 1314 states and 1766 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-17 10:13:34,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:34,875 INFO L93 Difference]: Finished difference Result 1314 states and 1766 transitions. [2025-03-17 10:13:34,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:34,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 83 [2025-03-17 10:13:34,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:34,882 INFO L225 Difference]: With dead ends: 1314 [2025-03-17 10:13:34,882 INFO L226 Difference]: Without dead ends: 1312 [2025-03-17 10:13:34,883 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-17 10:13:34,883 INFO L435 NwaCegarLoop]: 1750 mSDtfsCounter, 1735 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1735 SdHoareTripleChecker+Valid, 3499 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-17 10:13:34,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1735 Valid, 3499 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:13:34,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2025-03-17 10:13:34,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1312. [2025-03-17 10:13:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 797 states have (on average 1.2271016311166876) internal successors, (978), 843 states have internal predecessors, (978), 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-17 10:13:34,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1764 transitions. [2025-03-17 10:13:34,943 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1764 transitions. Word has length 83 [2025-03-17 10:13:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:34,944 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1764 transitions. [2025-03-17 10:13:34,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-17 10:13:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1764 transitions. [2025-03-17 10:13:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 10:13:34,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:34,946 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-17 10:13:34,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:13:34,946 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-17 10:13:34,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1776260710, now seen corresponding path program 1 times [2025-03-17 10:13:34,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:34,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106867027] [2025-03-17 10:13:34,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:34,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:35,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 10:13:35,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 10:13:35,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:35,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:36,232 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-17 10:13:36,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:36,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106867027] [2025-03-17 10:13:36,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106867027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:36,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:36,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:36,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950981568] [2025-03-17 10:13:36,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:36,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:36,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:36,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:36,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:36,235 INFO L87 Difference]: Start difference. First operand 1312 states and 1764 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-17 10:13:36,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:36,466 INFO L93 Difference]: Finished difference Result 1312 states and 1764 transitions. [2025-03-17 10:13:36,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:36,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 89 [2025-03-17 10:13:36,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:36,474 INFO L225 Difference]: With dead ends: 1312 [2025-03-17 10:13:36,474 INFO L226 Difference]: Without dead ends: 1310 [2025-03-17 10:13:36,474 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-17 10:13:36,475 INFO L435 NwaCegarLoop]: 1748 mSDtfsCounter, 1732 mSDsluCounter, 1747 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 3495 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-17 10:13:36,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1732 Valid, 3495 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:13:36,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2025-03-17 10:13:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1310. [2025-03-17 10:13:36,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 796 states have (on average 1.2261306532663316) internal successors, (976), 841 states have internal predecessors, (976), 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-17 10:13:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1762 transitions. [2025-03-17 10:13:36,571 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1762 transitions. Word has length 89 [2025-03-17 10:13:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:36,571 INFO L471 AbstractCegarLoop]: Abstraction has 1310 states and 1762 transitions. [2025-03-17 10:13:36,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-17 10:13:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1762 transitions. [2025-03-17 10:13:36,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 10:13:36,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:36,572 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-17 10:13:36,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:13:36,572 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-17 10:13:36,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:36,574 INFO L85 PathProgramCache]: Analyzing trace with hash 901492864, now seen corresponding path program 1 times [2025-03-17 10:13:36,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:36,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139579523] [2025-03-17 10:13:36,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:36,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:37,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 10:13:37,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 10:13:37,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:37,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:37,691 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-17 10:13:37,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:37,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139579523] [2025-03-17 10:13:37,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139579523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:37,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:37,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:37,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320838216] [2025-03-17 10:13:37,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:37,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:37,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:37,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:37,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:37,692 INFO L87 Difference]: Start difference. First operand 1310 states and 1762 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-17 10:13:37,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:37,944 INFO L93 Difference]: Finished difference Result 1310 states and 1762 transitions. [2025-03-17 10:13:37,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:37,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 95 [2025-03-17 10:13:37,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:37,952 INFO L225 Difference]: With dead ends: 1310 [2025-03-17 10:13:37,953 INFO L226 Difference]: Without dead ends: 1308 [2025-03-17 10:13:37,954 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-17 10:13:37,954 INFO L435 NwaCegarLoop]: 1746 mSDtfsCounter, 1729 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 3491 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-17 10:13:37,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 3491 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:13:37,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2025-03-17 10:13:38,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1308. [2025-03-17 10:13:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 795 states have (on average 1.2251572327044025) internal successors, (974), 839 states have internal predecessors, (974), 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-17 10:13:38,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1760 transitions. [2025-03-17 10:13:38,022 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1760 transitions. Word has length 95 [2025-03-17 10:13:38,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:38,023 INFO L471 AbstractCegarLoop]: Abstraction has 1308 states and 1760 transitions. [2025-03-17 10:13:38,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-17 10:13:38,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1760 transitions. [2025-03-17 10:13:38,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 10:13:38,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:38,025 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-17 10:13:38,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:13:38,025 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-17 10:13:38,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:38,025 INFO L85 PathProgramCache]: Analyzing trace with hash 812514083, now seen corresponding path program 1 times [2025-03-17 10:13:38,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:38,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127870280] [2025-03-17 10:13:38,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:38,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:38,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 10:13:38,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 10:13:38,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:38,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:39,222 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-17 10:13:39,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:39,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127870280] [2025-03-17 10:13:39,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127870280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:39,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:39,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:39,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445062415] [2025-03-17 10:13:39,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:39,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:39,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:39,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:39,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:39,223 INFO L87 Difference]: Start difference. First operand 1308 states and 1760 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-17 10:13:39,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:39,529 INFO L93 Difference]: Finished difference Result 1308 states and 1760 transitions. [2025-03-17 10:13:39,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:39,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 101 [2025-03-17 10:13:39,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:39,538 INFO L225 Difference]: With dead ends: 1308 [2025-03-17 10:13:39,538 INFO L226 Difference]: Without dead ends: 1306 [2025-03-17 10:13:39,539 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-17 10:13:39,540 INFO L435 NwaCegarLoop]: 1744 mSDtfsCounter, 1726 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 3487 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-17 10:13:39,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1726 Valid, 3487 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:13:39,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2025-03-17 10:13:39,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1306. [2025-03-17 10:13:39,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 794 states have (on average 1.2241813602015112) internal successors, (972), 837 states have internal predecessors, (972), 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-17 10:13:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1758 transitions. [2025-03-17 10:13:39,643 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1758 transitions. Word has length 101 [2025-03-17 10:13:39,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:39,643 INFO L471 AbstractCegarLoop]: Abstraction has 1306 states and 1758 transitions. [2025-03-17 10:13:39,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-17 10:13:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1758 transitions. [2025-03-17 10:13:39,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 10:13:39,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:39,646 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-17 10:13:39,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:13:39,646 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-17 10:13:39,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:39,646 INFO L85 PathProgramCache]: Analyzing trace with hash -4654287, now seen corresponding path program 1 times [2025-03-17 10:13:39,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:39,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750712450] [2025-03-17 10:13:39,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:39,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:40,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 10:13:40,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 10:13:40,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:40,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:40,836 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-17 10:13:40,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:40,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750712450] [2025-03-17 10:13:40,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750712450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:40,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:40,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:40,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10089190] [2025-03-17 10:13:40,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:40,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:40,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:40,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:40,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:40,837 INFO L87 Difference]: Start difference. First operand 1306 states and 1758 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-17 10:13:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:41,091 INFO L93 Difference]: Finished difference Result 1306 states and 1758 transitions. [2025-03-17 10:13:41,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:41,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 107 [2025-03-17 10:13:41,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:41,099 INFO L225 Difference]: With dead ends: 1306 [2025-03-17 10:13:41,100 INFO L226 Difference]: Without dead ends: 1304 [2025-03-17 10:13:41,102 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-17 10:13:41,102 INFO L435 NwaCegarLoop]: 1742 mSDtfsCounter, 1723 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1723 SdHoareTripleChecker+Valid, 3483 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-17 10:13:41,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1723 Valid, 3483 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:13:41,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2025-03-17 10:13:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2025-03-17 10:13:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 793 states have (on average 1.223203026481715) internal successors, (970), 835 states have internal predecessors, (970), 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-17 10:13:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1756 transitions. [2025-03-17 10:13:41,166 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1756 transitions. Word has length 107 [2025-03-17 10:13:41,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:41,166 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1756 transitions. [2025-03-17 10:13:41,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-17 10:13:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1756 transitions. [2025-03-17 10:13:41,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 10:13:41,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:41,169 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] [2025-03-17 10:13:41,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:13:41,170 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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-17 10:13:41,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:41,170 INFO L85 PathProgramCache]: Analyzing trace with hash -177755731, now seen corresponding path program 1 times [2025-03-17 10:13:41,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:41,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900479581] [2025-03-17 10:13:41,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:41,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:41,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 10:13:41,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 10:13:41,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:41,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:42,275 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-17 10:13:42,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:42,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900479581] [2025-03-17 10:13:42,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900479581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:42,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:42,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:42,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935131471] [2025-03-17 10:13:42,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:42,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:42,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:42,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:42,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:42,276 INFO L87 Difference]: Start difference. First operand 1304 states and 1756 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, (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-17 10:13:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:42,525 INFO L93 Difference]: Finished difference Result 1304 states and 1756 transitions. [2025-03-17 10:13:42,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:42,526 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, (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 109 [2025-03-17 10:13:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:42,534 INFO L225 Difference]: With dead ends: 1304 [2025-03-17 10:13:42,535 INFO L226 Difference]: Without dead ends: 1302 [2025-03-17 10:13:42,535 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-17 10:13:42,539 INFO L435 NwaCegarLoop]: 1740 mSDtfsCounter, 1719 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1719 SdHoareTripleChecker+Valid, 3479 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-17 10:13:42,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1719 Valid, 3479 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:13:42,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2025-03-17 10:13:42,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2025-03-17 10:13:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 792 states have (on average 1.2222222222222223) internal successors, (968), 833 states have internal predecessors, (968), 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-17 10:13:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1754 transitions. [2025-03-17 10:13:42,616 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1754 transitions. Word has length 109 [2025-03-17 10:13:42,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:42,617 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1754 transitions. [2025-03-17 10:13:42,617 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, (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-17 10:13:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1754 transitions. [2025-03-17 10:13:42,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:13:42,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:42,621 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] [2025-03-17 10:13:42,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:13:42,621 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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-17 10:13:42,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:42,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1763831499, now seen corresponding path program 1 times [2025-03-17 10:13:42,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:42,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027031107] [2025-03-17 10:13:42,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:42,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:43,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:13:43,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:13:43,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:43,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:43,821 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-17 10:13:43,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:43,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027031107] [2025-03-17 10:13:43,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027031107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:43,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:43,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:13:43,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958102401] [2025-03-17 10:13:43,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:43,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:13:43,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:43,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:13:43,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:13:43,823 INFO L87 Difference]: Start difference. First operand 1302 states and 1754 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-17 10:13:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:44,004 INFO L93 Difference]: Finished difference Result 2411 states and 3222 transitions. [2025-03-17 10:13:44,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:13:44,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 150 [2025-03-17 10:13:44,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:44,012 INFO L225 Difference]: With dead ends: 2411 [2025-03-17 10:13:44,012 INFO L226 Difference]: Without dead ends: 1298 [2025-03-17 10:13:44,016 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-17 10:13:44,017 INFO L435 NwaCegarLoop]: 1736 mSDtfsCounter, 1740 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 1736 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-17 10:13:44,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 1736 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:13:44,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-03-17 10:13:44,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2025-03-17 10:13:44,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 789 states have (on average 1.220532319391635) internal successors, (963), 829 states have internal predecessors, (963), 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-17 10:13:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1749 transitions. [2025-03-17 10:13:44,133 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1749 transitions. Word has length 150 [2025-03-17 10:13:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:44,137 INFO L471 AbstractCegarLoop]: Abstraction has 1298 states and 1749 transitions. [2025-03-17 10:13:44,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-17 10:13:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1749 transitions. [2025-03-17 10:13:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 10:13:44,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:44,143 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-17 10:13:44,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:13:44,143 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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-17 10:13:44,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:44,144 INFO L85 PathProgramCache]: Analyzing trace with hash 911743965, now seen corresponding path program 1 times [2025-03-17 10:13:44,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:44,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323752828] [2025-03-17 10:13:44,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:44,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:45,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 10:13:45,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 10:13:45,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:45,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:45,647 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-17 10:13:45,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:45,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323752828] [2025-03-17 10:13:45,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323752828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:45,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:45,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:45,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828657905] [2025-03-17 10:13:45,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:45,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:45,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:45,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:45,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:45,649 INFO L87 Difference]: Start difference. First operand 1298 states and 1749 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, (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-17 10:13:45,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:45,948 INFO L93 Difference]: Finished difference Result 1298 states and 1749 transitions. [2025-03-17 10:13:45,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:45,949 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, (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 115 [2025-03-17 10:13:45,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:45,956 INFO L225 Difference]: With dead ends: 1298 [2025-03-17 10:13:45,957 INFO L226 Difference]: Without dead ends: 1296 [2025-03-17 10:13:45,958 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-17 10:13:45,959 INFO L435 NwaCegarLoop]: 1733 mSDtfsCounter, 1713 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1713 SdHoareTripleChecker+Valid, 3465 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-17 10:13:45,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1713 Valid, 3465 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:13:45,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2025-03-17 10:13:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2025-03-17 10:13:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 788 states have (on average 1.2195431472081217) internal successors, (961), 827 states have internal predecessors, (961), 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-17 10:13:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1747 transitions. [2025-03-17 10:13:46,072 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1747 transitions. Word has length 115 [2025-03-17 10:13:46,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:46,072 INFO L471 AbstractCegarLoop]: Abstraction has 1296 states and 1747 transitions. [2025-03-17 10:13:46,072 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, (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-17 10:13:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1747 transitions. [2025-03-17 10:13:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 10:13:46,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:46,075 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] [2025-03-17 10:13:46,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:13:46,076 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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-17 10:13:46,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:46,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1144258463, now seen corresponding path program 1 times [2025-03-17 10:13:46,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:46,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313859128] [2025-03-17 10:13:46,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:46,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:46,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 10:13:46,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 10:13:46,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:46,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:47,685 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-17 10:13:47,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:47,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313859128] [2025-03-17 10:13:47,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313859128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:47,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:47,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:13:47,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222460509] [2025-03-17 10:13:47,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:47,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:13:47,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:47,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:13:47,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:13:47,687 INFO L87 Difference]: Start difference. First operand 1296 states and 1747 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-17 10:13:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:48,203 INFO L93 Difference]: Finished difference Result 1513 states and 1963 transitions. [2025-03-17 10:13:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:13:48,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 147 [2025-03-17 10:13:48,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:48,212 INFO L225 Difference]: With dead ends: 1513 [2025-03-17 10:13:48,212 INFO L226 Difference]: Without dead ends: 1511 [2025-03-17 10:13:48,213 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-17 10:13:48,214 INFO L435 NwaCegarLoop]: 1815 mSDtfsCounter, 1536 mSDsluCounter, 4006 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 5821 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-17 10:13:48,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 5821 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:13:48,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2025-03-17 10:13:48,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1497. [2025-03-17 10:13:48,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 916 states have (on average 1.205240174672489) internal successors, (1104), 955 states have internal predecessors, (1104), 426 states have call successors, (426), 137 states have call predecessors, (426), 136 states have return successors, (424), 421 states have call predecessors, (424), 424 states have call successors, (424) [2025-03-17 10:13:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1954 transitions. [2025-03-17 10:13:48,380 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1954 transitions. Word has length 147 [2025-03-17 10:13:48,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:48,381 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 1954 transitions. [2025-03-17 10:13:48,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-17 10:13:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1954 transitions. [2025-03-17 10:13:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 10:13:48,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:48,385 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] [2025-03-17 10:13:48,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:13:48,385 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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-17 10:13:48,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:48,385 INFO L85 PathProgramCache]: Analyzing trace with hash 215928170, now seen corresponding path program 1 times [2025-03-17 10:13:48,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:48,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618447484] [2025-03-17 10:13:48,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:48,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:49,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 10:13:49,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 10:13:49,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:49,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:49,644 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-17 10:13:49,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:49,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618447484] [2025-03-17 10:13:49,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618447484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:13:49,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520907755] [2025-03-17 10:13:49,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:49,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:13:49,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:13:49,647 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-17 10:13:49,648 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-17 10:13:51,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 10:13:51,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 10:13:51,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:51,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:51,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 2858 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 10:13:51,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:13:51,544 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-17 10:13:51,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:13:51,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520907755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:51,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:13:51,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-17 10:13:51,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903098130] [2025-03-17 10:13:51,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:51,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:13:51,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:51,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:13:51,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:13:51,546 INFO L87 Difference]: Start difference. First operand 1497 states and 1954 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-17 10:13:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:51,769 INFO L93 Difference]: Finished difference Result 2823 states and 3649 transitions. [2025-03-17 10:13:51,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:13:51,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 156 [2025-03-17 10:13:51,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:51,777 INFO L225 Difference]: With dead ends: 2823 [2025-03-17 10:13:51,777 INFO L226 Difference]: Without dead ends: 1547 [2025-03-17 10:13:51,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 156 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-17 10:13:51,781 INFO L435 NwaCegarLoop]: 1790 mSDtfsCounter, 1727 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 1855 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-17 10:13:51,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 1855 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:13:51,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2025-03-17 10:13:51,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1544. [2025-03-17 10:13:51,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 943 states have (on average 1.200424178154825) internal successors, (1132), 985 states have internal predecessors, (1132), 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-17 10:13:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2012 transitions. [2025-03-17 10:13:51,920 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2012 transitions. Word has length 156 [2025-03-17 10:13:51,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:51,921 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2012 transitions. [2025-03-17 10:13:51,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-17 10:13:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2012 transitions. [2025-03-17 10:13:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 10:13:51,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:51,925 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] [2025-03-17 10:13:51,939 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-17 10:13:52,125 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,SelfDestructingSolverStorable12 [2025-03-17 10:13:52,126 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-17 10:13:52,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:52,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2075301741, now seen corresponding path program 1 times [2025-03-17 10:13:52,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:52,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210999223] [2025-03-17 10:13:52,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:52,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:53,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 10:13:53,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 10:13:53,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:53,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:54,384 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-17 10:13:54,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:54,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210999223] [2025-03-17 10:13:54,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210999223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:54,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:54,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:13:54,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366091850] [2025-03-17 10:13:54,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:54,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:13:54,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:54,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:13:54,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:13:54,387 INFO L87 Difference]: Start difference. First operand 1544 states and 2012 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 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-17 10:13:58,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:14:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:04,048 INFO L93 Difference]: Finished difference Result 2984 states and 3901 transitions. [2025-03-17 10:14:04,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:14:04,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 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 162 [2025-03-17 10:14:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:04,057 INFO L225 Difference]: With dead ends: 2984 [2025-03-17 10:14:04,057 INFO L226 Difference]: Without dead ends: 1544 [2025-03-17 10:14:04,062 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-17 10:14:04,063 INFO L435 NwaCegarLoop]: 1726 mSDtfsCounter, 1702 mSDsluCounter, 4388 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 6114 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:04,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 6114 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 845 Invalid, 1 Unknown, 0 Unchecked, 9.2s Time] [2025-03-17 10:14:04,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2025-03-17 10:14:04,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2025-03-17 10:14:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 943 states have (on average 1.1983032873806998) internal successors, (1130), 985 states have internal predecessors, (1130), 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-17 10:14:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2010 transitions. [2025-03-17 10:14:04,160 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2010 transitions. Word has length 162 [2025-03-17 10:14:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:04,161 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2010 transitions. [2025-03-17 10:14:04,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 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-17 10:14:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2010 transitions. [2025-03-17 10:14:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 10:14:04,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:04,164 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] [2025-03-17 10:14:04,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:14:04,164 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-17 10:14:04,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:04,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2075331532, now seen corresponding path program 1 times [2025-03-17 10:14:04,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:04,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239220433] [2025-03-17 10:14:04,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:04,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:04,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 10:14:04,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 10:14:04,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:04,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:05,390 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-17 10:14:05,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:05,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239220433] [2025-03-17 10:14:05,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239220433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:05,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:05,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:05,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181853522] [2025-03-17 10:14:05,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:05,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:05,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:05,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:05,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:05,393 INFO L87 Difference]: Start difference. First operand 1544 states and 2010 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-17 10:14:05,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:05,725 INFO L93 Difference]: Finished difference Result 1544 states and 2010 transitions. [2025-03-17 10:14:05,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:05,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 162 [2025-03-17 10:14:05,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:05,738 INFO L225 Difference]: With dead ends: 1544 [2025-03-17 10:14:05,738 INFO L226 Difference]: Without dead ends: 1542 [2025-03-17 10:14:05,741 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-17 10:14:05,741 INFO L435 NwaCegarLoop]: 1725 mSDtfsCounter, 0 mSDsluCounter, 3447 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5172 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:05,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5172 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:14:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2025-03-17 10:14:05,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1542. [2025-03-17 10:14:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 942 states have (on average 1.1963906581740977) internal successors, (1127), 983 states have internal predecessors, (1127), 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-17 10:14:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2007 transitions. [2025-03-17 10:14:05,852 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2007 transitions. Word has length 162 [2025-03-17 10:14:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:05,853 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2007 transitions. [2025-03-17 10:14:05,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-17 10:14:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2007 transitions. [2025-03-17 10:14:05,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 10:14:05,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:05,855 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-17 10:14:05,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:14:05,856 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-17 10:14:05,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:05,856 INFO L85 PathProgramCache]: Analyzing trace with hash 986336281, now seen corresponding path program 1 times [2025-03-17 10:14:05,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:05,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582837212] [2025-03-17 10:14:05,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:05,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:06,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 10:14:06,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 10:14:06,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:06,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:07,090 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-17 10:14:07,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:07,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582837212] [2025-03-17 10:14:07,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582837212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:07,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:07,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:07,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647760936] [2025-03-17 10:14:07,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:07,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:07,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:07,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:07,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:07,093 INFO L87 Difference]: Start difference. First operand 1542 states and 2007 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-17 10:14:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:07,393 INFO L93 Difference]: Finished difference Result 1542 states and 2007 transitions. [2025-03-17 10:14:07,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:07,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 121 [2025-03-17 10:14:07,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:07,401 INFO L225 Difference]: With dead ends: 1542 [2025-03-17 10:14:07,401 INFO L226 Difference]: Without dead ends: 1540 [2025-03-17 10:14:07,401 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-17 10:14:07,402 INFO L435 NwaCegarLoop]: 1723 mSDtfsCounter, 1702 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 3445 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-17 10:14:07,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1702 Valid, 3445 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:14:07,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2025-03-17 10:14:07,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1540. [2025-03-17 10:14:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 941 states have (on average 1.1955366631243358) internal successors, (1125), 981 states have internal predecessors, (1125), 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-17 10:14:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2005 transitions. [2025-03-17 10:14:07,496 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2005 transitions. Word has length 121 [2025-03-17 10:14:07,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:07,496 INFO L471 AbstractCegarLoop]: Abstraction has 1540 states and 2005 transitions. [2025-03-17 10:14:07,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-17 10:14:07,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2005 transitions. [2025-03-17 10:14:07,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 10:14:07,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:07,498 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] [2025-03-17 10:14:07,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:14:07,498 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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-17 10:14:07,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:07,499 INFO L85 PathProgramCache]: Analyzing trace with hash 928120191, now seen corresponding path program 1 times [2025-03-17 10:14:07,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:07,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357601094] [2025-03-17 10:14:07,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:07,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:08,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 10:14:08,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 10:14:08,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:08,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:08,791 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-17 10:14:08,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:08,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357601094] [2025-03-17 10:14:08,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357601094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:08,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:08,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:14:08,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697804828] [2025-03-17 10:14:08,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:08,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:14:08,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:08,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:14:08,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:08,792 INFO L87 Difference]: Start difference. First operand 1540 states and 2005 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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-17 10:14:09,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:09,192 INFO L93 Difference]: Finished difference Result 1568 states and 2029 transitions. [2025-03-17 10:14:09,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:14:09,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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 158 [2025-03-17 10:14:09,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:09,200 INFO L225 Difference]: With dead ends: 1568 [2025-03-17 10:14:09,200 INFO L226 Difference]: Without dead ends: 1566 [2025-03-17 10:14:09,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:14:09,201 INFO L435 NwaCegarLoop]: 1726 mSDtfsCounter, 1658 mSDsluCounter, 3492 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 5218 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:09,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1659 Valid, 5218 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:14:09,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2025-03-17 10:14:09,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1564. [2025-03-17 10:14:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 959 states have (on average 1.1939520333680917) internal successors, (1145), 999 states have internal predecessors, (1145), 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-17 10:14:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2025 transitions. [2025-03-17 10:14:09,302 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2025 transitions. Word has length 158 [2025-03-17 10:14:09,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:09,303 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2025 transitions. [2025-03-17 10:14:09,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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-17 10:14:09,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2025 transitions. [2025-03-17 10:14:09,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 10:14:09,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:09,305 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] [2025-03-17 10:14:09,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 10:14:09,306 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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-17 10:14:09,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:09,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1652044693, now seen corresponding path program 1 times [2025-03-17 10:14:09,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:09,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482450766] [2025-03-17 10:14:09,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:09,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:10,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 10:14:10,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 10:14:10,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:10,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:10,278 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-17 10:14:10,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:10,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482450766] [2025-03-17 10:14:10,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482450766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:10,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:10,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:14:10,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694551038] [2025-03-17 10:14:10,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:10,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:14:10,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:10,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:14:10,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:14:10,280 INFO L87 Difference]: Start difference. First operand 1564 states and 2025 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-17 10:14:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:10,506 INFO L93 Difference]: Finished difference Result 3018 states and 3920 transitions. [2025-03-17 10:14:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:14:10,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 169 [2025-03-17 10:14:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:10,519 INFO L225 Difference]: With dead ends: 3018 [2025-03-17 10:14:10,519 INFO L226 Difference]: Without dead ends: 1558 [2025-03-17 10:14:10,524 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-17 10:14:10,525 INFO L435 NwaCegarLoop]: 1719 mSDtfsCounter, 1693 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1693 SdHoareTripleChecker+Valid, 1719 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-17 10:14:10,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1693 Valid, 1719 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2025-03-17 10:14:10,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1558. [2025-03-17 10:14:10,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 954 states have (on average 1.1907756813417192) internal successors, (1136), 993 states have internal predecessors, (1136), 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-17 10:14:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2016 transitions. [2025-03-17 10:14:10,635 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2016 transitions. Word has length 169 [2025-03-17 10:14:10,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:10,635 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2016 transitions. [2025-03-17 10:14:10,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-17 10:14:10,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2016 transitions. [2025-03-17 10:14:10,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 10:14:10,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:10,637 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-17 10:14:10,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 10:14:10,637 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-17 10:14:10,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:10,638 INFO L85 PathProgramCache]: Analyzing trace with hash -467432781, now seen corresponding path program 1 times [2025-03-17 10:14:10,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:10,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566377809] [2025-03-17 10:14:10,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:10,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:11,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 10:14:11,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 10:14:11,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:11,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:11,863 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-17 10:14:11,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:11,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566377809] [2025-03-17 10:14:11,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566377809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:11,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:11,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:11,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077069592] [2025-03-17 10:14:11,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:11,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:11,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:11,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:11,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:11,864 INFO L87 Difference]: Start difference. First operand 1558 states and 2016 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (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-17 10:14:12,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:12,121 INFO L93 Difference]: Finished difference Result 1558 states and 2016 transitions. [2025-03-17 10:14:12,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:12,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (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 127 [2025-03-17 10:14:12,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:12,129 INFO L225 Difference]: With dead ends: 1558 [2025-03-17 10:14:12,129 INFO L226 Difference]: Without dead ends: 1556 [2025-03-17 10:14:12,129 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-17 10:14:12,130 INFO L435 NwaCegarLoop]: 1716 mSDtfsCounter, 1694 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 3431 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-17 10:14:12,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1694 Valid, 3431 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:12,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2025-03-17 10:14:12,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2025-03-17 10:14:12,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 953 states have (on average 1.1899265477439664) internal successors, (1134), 991 states have internal predecessors, (1134), 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-17 10:14:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2014 transitions. [2025-03-17 10:14:12,232 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2014 transitions. Word has length 127 [2025-03-17 10:14:12,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:12,233 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2014 transitions. [2025-03-17 10:14:12,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (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-17 10:14:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2014 transitions. [2025-03-17 10:14:12,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 10:14:12,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:12,235 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-17 10:14:12,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 10:14:12,236 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-17 10:14:12,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:12,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1927253550, now seen corresponding path program 1 times [2025-03-17 10:14:12,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:12,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133919807] [2025-03-17 10:14:12,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:12,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:13,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 10:14:13,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 10:14:13,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:13,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:13,490 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-17 10:14:13,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:13,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133919807] [2025-03-17 10:14:13,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133919807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:13,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:13,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:13,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134739529] [2025-03-17 10:14:13,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:13,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:13,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:13,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:13,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:13,491 INFO L87 Difference]: Start difference. First operand 1556 states and 2014 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-17 10:14:13,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:13,770 INFO L93 Difference]: Finished difference Result 1556 states and 2014 transitions. [2025-03-17 10:14:13,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:13,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 133 [2025-03-17 10:14:13,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:13,781 INFO L225 Difference]: With dead ends: 1556 [2025-03-17 10:14:13,781 INFO L226 Difference]: Without dead ends: 1554 [2025-03-17 10:14:13,782 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-17 10:14:13,782 INFO L435 NwaCegarLoop]: 1714 mSDtfsCounter, 1691 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1691 SdHoareTripleChecker+Valid, 3427 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-17 10:14:13,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1691 Valid, 3427 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-03-17 10:14:13,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1554. [2025-03-17 10:14:13,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 952 states have (on average 1.1890756302521008) internal successors, (1132), 989 states have internal predecessors, (1132), 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-17 10:14:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2012 transitions. [2025-03-17 10:14:13,907 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2012 transitions. Word has length 133 [2025-03-17 10:14:13,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:13,908 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2012 transitions. [2025-03-17 10:14:13,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-17 10:14:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2012 transitions. [2025-03-17 10:14:13,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 10:14:13,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:13,910 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-17 10:14:13,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 10:14:13,910 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-17 10:14:13,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:13,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1636517929, now seen corresponding path program 1 times [2025-03-17 10:14:13,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:13,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291074470] [2025-03-17 10:14:13,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:13,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:14,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 10:14:14,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 10:14:14,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:14,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:14,933 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-17 10:14:14,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:14,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291074470] [2025-03-17 10:14:14,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291074470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:14,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:14,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:14,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654626074] [2025-03-17 10:14:14,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:14,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:14,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:14,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:14,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:14,934 INFO L87 Difference]: Start difference. First operand 1554 states and 2012 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-17 10:14:15,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:15,217 INFO L93 Difference]: Finished difference Result 1554 states and 2012 transitions. [2025-03-17 10:14:15,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:15,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 139 [2025-03-17 10:14:15,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:15,228 INFO L225 Difference]: With dead ends: 1554 [2025-03-17 10:14:15,228 INFO L226 Difference]: Without dead ends: 1552 [2025-03-17 10:14:15,228 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-17 10:14:15,229 INFO L435 NwaCegarLoop]: 1712 mSDtfsCounter, 1688 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 3423 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-17 10:14:15,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1688 Valid, 3423 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:14:15,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2025-03-17 10:14:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1552. [2025-03-17 10:14:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 951 states have (on average 1.188222923238696) internal successors, (1130), 987 states have internal predecessors, (1130), 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-17 10:14:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2010 transitions. [2025-03-17 10:14:15,346 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2010 transitions. Word has length 139 [2025-03-17 10:14:15,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:15,347 INFO L471 AbstractCegarLoop]: Abstraction has 1552 states and 2010 transitions. [2025-03-17 10:14:15,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-17 10:14:15,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2010 transitions. [2025-03-17 10:14:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 10:14:15,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:15,349 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-17 10:14:15,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 10:14:15,349 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-17 10:14:15,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:15,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1093123725, now seen corresponding path program 1 times [2025-03-17 10:14:15,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:15,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344766535] [2025-03-17 10:14:15,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:15,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:16,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 10:14:16,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 10:14:16,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:16,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:16,543 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-17 10:14:16,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:16,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344766535] [2025-03-17 10:14:16,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344766535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:16,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:16,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:16,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520837779] [2025-03-17 10:14:16,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:16,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:16,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:16,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:16,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:16,545 INFO L87 Difference]: Start difference. First operand 1552 states and 2010 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-17 10:14:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:16,863 INFO L93 Difference]: Finished difference Result 1552 states and 2010 transitions. [2025-03-17 10:14:16,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:16,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 145 [2025-03-17 10:14:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:16,870 INFO L225 Difference]: With dead ends: 1552 [2025-03-17 10:14:16,871 INFO L226 Difference]: Without dead ends: 1550 [2025-03-17 10:14:16,871 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-17 10:14:16,873 INFO L435 NwaCegarLoop]: 1710 mSDtfsCounter, 1685 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1685 SdHoareTripleChecker+Valid, 3419 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-17 10:14:16,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1685 Valid, 3419 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:14:16,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2025-03-17 10:14:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1550. [2025-03-17 10:14:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 950 states have (on average 1.1873684210526316) internal successors, (1128), 985 states have internal predecessors, (1128), 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-17 10:14:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2008 transitions. [2025-03-17 10:14:16,991 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2008 transitions. Word has length 145 [2025-03-17 10:14:16,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:16,991 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2008 transitions. [2025-03-17 10:14:16,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-17 10:14:16,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2008 transitions. [2025-03-17 10:14:16,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-17 10:14:16,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:16,994 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] [2025-03-17 10:14:16,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 10:14:16,994 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-17 10:14:16,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:16,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1183147954, now seen corresponding path program 1 times [2025-03-17 10:14:16,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:16,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082675456] [2025-03-17 10:14:16,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:16,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:17,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 10:14:17,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 10:14:17,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:17,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:18,225 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-17 10:14:18,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:18,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082675456] [2025-03-17 10:14:18,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082675456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:18,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:18,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:14:18,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560273386] [2025-03-17 10:14:18,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:18,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:14:18,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:18,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:14:18,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:18,226 INFO L87 Difference]: Start difference. First operand 1550 states and 2008 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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-17 10:14:22,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:14:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:22,956 INFO L93 Difference]: Finished difference Result 1552 states and 2009 transitions. [2025-03-17 10:14:22,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:14:22,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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 179 [2025-03-17 10:14:22,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:22,962 INFO L225 Difference]: With dead ends: 1552 [2025-03-17 10:14:22,962 INFO L226 Difference]: Without dead ends: 1550 [2025-03-17 10:14:22,963 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-17 10:14:22,963 INFO L435 NwaCegarLoop]: 1711 mSDtfsCounter, 40 mSDsluCounter, 5085 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 6796 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-17 10:14:22,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 6796 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-17 10:14:22,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2025-03-17 10:14:23,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1550. [2025-03-17 10:14:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 950 states have (on average 1.1852631578947368) internal successors, (1126), 985 states have internal predecessors, (1126), 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-17 10:14:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2006 transitions. [2025-03-17 10:14:23,079 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2006 transitions. Word has length 179 [2025-03-17 10:14:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:23,079 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2006 transitions. [2025-03-17 10:14:23,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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-17 10:14:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2006 transitions. [2025-03-17 10:14:23,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 10:14:23,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:23,081 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-17 10:14:23,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 10:14:23,081 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-17 10:14:23,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:23,082 INFO L85 PathProgramCache]: Analyzing trace with hash 13825964, now seen corresponding path program 1 times [2025-03-17 10:14:23,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:23,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776526875] [2025-03-17 10:14:23,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:23,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:23,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 10:14:23,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 10:14:23,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:23,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:24,296 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-17 10:14:24,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:24,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776526875] [2025-03-17 10:14:24,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776526875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:24,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:24,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:24,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025873821] [2025-03-17 10:14:24,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:24,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:24,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:24,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:24,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:24,297 INFO L87 Difference]: Start difference. First operand 1550 states and 2006 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-17 10:14:24,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:24,606 INFO L93 Difference]: Finished difference Result 1550 states and 2006 transitions. [2025-03-17 10:14:24,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:24,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 151 [2025-03-17 10:14:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:24,612 INFO L225 Difference]: With dead ends: 1550 [2025-03-17 10:14:24,612 INFO L226 Difference]: Without dead ends: 1548 [2025-03-17 10:14:24,613 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-17 10:14:24,613 INFO L435 NwaCegarLoop]: 1708 mSDtfsCounter, 1682 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1682 SdHoareTripleChecker+Valid, 3415 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-17 10:14:24,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1682 Valid, 3415 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:14:24,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2025-03-17 10:14:24,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1548. [2025-03-17 10:14:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 949 states have (on average 1.184404636459431) internal successors, (1124), 983 states have internal predecessors, (1124), 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-17 10:14:24,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2004 transitions. [2025-03-17 10:14:24,731 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2004 transitions. Word has length 151 [2025-03-17 10:14:24,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:24,731 INFO L471 AbstractCegarLoop]: Abstraction has 1548 states and 2004 transitions. [2025-03-17 10:14:24,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-17 10:14:24,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2004 transitions. [2025-03-17 10:14:24,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 10:14:24,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:24,733 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-17 10:14:24,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 10:14:24,734 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-17 10:14:24,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:24,734 INFO L85 PathProgramCache]: Analyzing trace with hash 734280309, now seen corresponding path program 1 times [2025-03-17 10:14:24,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:24,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580898284] [2025-03-17 10:14:24,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:24,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:25,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 10:14:25,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 10:14:25,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:25,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:25,808 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-17 10:14:25,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:25,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580898284] [2025-03-17 10:14:25,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580898284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:25,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:25,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:25,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74086723] [2025-03-17 10:14:25,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:25,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:25,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:25,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:25,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:25,809 INFO L87 Difference]: Start difference. First operand 1548 states and 2004 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-17 10:14:26,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:26,138 INFO L93 Difference]: Finished difference Result 1548 states and 2004 transitions. [2025-03-17 10:14:26,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:26,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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 157 [2025-03-17 10:14:26,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:26,144 INFO L225 Difference]: With dead ends: 1548 [2025-03-17 10:14:26,144 INFO L226 Difference]: Without dead ends: 1546 [2025-03-17 10:14:26,144 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-17 10:14:26,145 INFO L435 NwaCegarLoop]: 1706 mSDtfsCounter, 1679 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 3411 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-17 10:14:26,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 3411 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:14:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2025-03-17 10:14:26,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1546. [2025-03-17 10:14:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 948 states have (on average 1.1835443037974684) internal successors, (1122), 981 states have internal predecessors, (1122), 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-17 10:14:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2002 transitions. [2025-03-17 10:14:26,270 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2002 transitions. Word has length 157 [2025-03-17 10:14:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:26,271 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2002 transitions. [2025-03-17 10:14:26,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-17 10:14:26,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2002 transitions. [2025-03-17 10:14:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 10:14:26,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:26,274 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-17 10:14:26,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 10:14:26,274 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-17 10:14:26,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:26,274 INFO L85 PathProgramCache]: Analyzing trace with hash -313509128, now seen corresponding path program 1 times [2025-03-17 10:14:26,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:26,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083957041] [2025-03-17 10:14:26,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:27,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 10:14:27,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 10:14:27,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:27,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:27,359 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-17 10:14:27,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:27,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083957041] [2025-03-17 10:14:27,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083957041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:27,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:27,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:27,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971716691] [2025-03-17 10:14:27,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:27,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:27,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:27,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:27,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:27,360 INFO L87 Difference]: Start difference. First operand 1546 states and 2002 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 10:14:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:27,657 INFO L93 Difference]: Finished difference Result 1546 states and 2002 transitions. [2025-03-17 10:14:27,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:27,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2025-03-17 10:14:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:27,664 INFO L225 Difference]: With dead ends: 1546 [2025-03-17 10:14:27,665 INFO L226 Difference]: Without dead ends: 1544 [2025-03-17 10:14:27,665 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-17 10:14:27,666 INFO L435 NwaCegarLoop]: 1704 mSDtfsCounter, 1676 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1676 SdHoareTripleChecker+Valid, 3407 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-17 10:14:27,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1676 Valid, 3407 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:27,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2025-03-17 10:14:27,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2025-03-17 10:14:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 947 states have (on average 1.1826821541710666) internal successors, (1120), 979 states have internal predecessors, (1120), 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-17 10:14:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2000 transitions. [2025-03-17 10:14:27,797 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2000 transitions. Word has length 163 [2025-03-17 10:14:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:27,797 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2000 transitions. [2025-03-17 10:14:27,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 10:14:27,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2000 transitions. [2025-03-17 10:14:27,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-17 10:14:27,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:27,799 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:27,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 10:14:27,800 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:27,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:27,801 INFO L85 PathProgramCache]: Analyzing trace with hash -754538163, now seen corresponding path program 1 times [2025-03-17 10:14:27,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:27,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248515264] [2025-03-17 10:14:27,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:27,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:28,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 10:14:28,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 10:14:28,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:28,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-03-17 10:14:30,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:30,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248515264] [2025-03-17 10:14:30,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248515264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:30,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:30,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:14:30,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643474879] [2025-03-17 10:14:30,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:30,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:14:30,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:30,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:14:30,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:30,564 INFO L87 Difference]: Start difference. First operand 1544 states and 2000 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29)