./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--host--u132-hcd.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.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 59b1cfb91cc72e499bff6d8fc699fc231e5a5cccbbf2aefe05d1bfd2696fc05b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:06:15,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:06:15,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 21:06:15,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:06:15,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:06:15,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:06:15,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:06:15,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:06:15,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 21:06:16,000 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 21:06:16,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:06:16,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:06:16,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:06:16,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:06:16,001 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:06:16,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:06:16,001 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:06:16,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:06:16,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:06:16,001 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:06:16,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:06:16,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:06:16,002 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:06:16,002 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:06:16,002 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:06:16,002 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:06:16,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:06:16,002 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 21:06:16,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:06:16,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:06:16,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:06:16,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:06:16,003 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:06:16,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:06:16,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:06:16,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:06:16,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:06:16,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:06:16,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:06:16,004 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:06:16,004 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 -> 59b1cfb91cc72e499bff6d8fc699fc231e5a5cccbbf2aefe05d1bfd2696fc05b [2025-03-08 21:06:16,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:06:16,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:06:16,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:06:16,223 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:06:16,224 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:06:16,225 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--host--u132-hcd.ko.cil.i [2025-03-08 21:06:17,360 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4496071df/38a3e93e58514acf96be96e071fed32c/FLAG2b4caf0b8 [2025-03-08 21:06:17,874 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:06:17,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i [2025-03-08 21:06:17,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4496071df/38a3e93e58514acf96be96e071fed32c/FLAG2b4caf0b8 [2025-03-08 21:06:18,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4496071df/38a3e93e58514acf96be96e071fed32c [2025-03-08 21:06:18,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:06:18,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:06:18,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:06:18,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:06:18,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:06:18,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:06:18" (1/1) ... [2025-03-08 21:06:18,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709691d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:18, skipping insertion in model container [2025-03-08 21:06:18,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:06:18" (1/1) ... [2025-03-08 21:06:18,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:06:22,240 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434581,434594] [2025-03-08 21:06:22,242 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434726,434739] [2025-03-08 21:06:22,243 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434872,434885] [2025-03-08 21:06:22,243 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435037,435050] [2025-03-08 21:06:22,243 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435195,435208] [2025-03-08 21:06:22,243 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435353,435366] [2025-03-08 21:06:22,244 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435511,435524] [2025-03-08 21:06:22,244 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435671,435684] [2025-03-08 21:06:22,244 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435830,435843] [2025-03-08 21:06:22,244 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435969,435982] [2025-03-08 21:06:22,244 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436111,436124] [2025-03-08 21:06:22,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436260,436273] [2025-03-08 21:06:22,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436399,436412] [2025-03-08 21:06:22,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436554,436567] [2025-03-08 21:06:22,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436714,436727] [2025-03-08 21:06:22,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436865,436878] [2025-03-08 21:06:22,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437016,437029] [2025-03-08 21:06:22,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437168,437181] [2025-03-08 21:06:22,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437317,437330] [2025-03-08 21:06:22,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437465,437478] [2025-03-08 21:06:22,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437622,437635] [2025-03-08 21:06:22,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437771,437784] [2025-03-08 21:06:22,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437927,437940] [2025-03-08 21:06:22,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438080,438093] [2025-03-08 21:06:22,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438226,438239] [2025-03-08 21:06:22,248 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438369,438382] [2025-03-08 21:06:22,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438521,438534] [2025-03-08 21:06:22,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438667,438680] [2025-03-08 21:06:22,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438812,438825] [2025-03-08 21:06:22,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438966,438979] [2025-03-08 21:06:22,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439117,439130] [2025-03-08 21:06:22,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439272,439285] [2025-03-08 21:06:22,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439424,439437] [2025-03-08 21:06:22,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439579,439592] [2025-03-08 21:06:22,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439743,439756] [2025-03-08 21:06:22,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439899,439912] [2025-03-08 21:06:22,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440063,440076] [2025-03-08 21:06:22,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440205,440218] [2025-03-08 21:06:22,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440363,440376] [2025-03-08 21:06:22,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440530,440543] [2025-03-08 21:06:22,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440689,440702] [2025-03-08 21:06:22,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440848,440861] [2025-03-08 21:06:22,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440997,441010] [2025-03-08 21:06:22,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441144,441157] [2025-03-08 21:06:22,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441283,441296] [2025-03-08 21:06:22,273 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441446,441459] [2025-03-08 21:06:22,273 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441612,441625] [2025-03-08 21:06:22,273 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441776,441789] [2025-03-08 21:06:22,273 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441941,441954] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[442106,442119] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[442272,442285] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[442437,442450] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[442604,442617] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[442764,442777] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[442926,442939] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[443085,443098] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[443231,443244] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[443374,443387] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[443518,443531] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[443661,443674] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[443805,443818] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[443946,443959] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[444084,444097] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[444242,444255] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[444401,444414] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[444557,444570] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[444706,444719] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[444858,444871] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[445009,445022] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[445158,445171] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[445310,445323] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[445458,445471] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[445611,445624] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[445762,445775] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[445912,445925] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[446059,446072] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[446210,446223] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[446361,446374] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[446509,446522] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[446675,446688] [2025-03-08 21:06:22,287 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446844,446857] [2025-03-08 21:06:22,287 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447011,447024] [2025-03-08 21:06:22,287 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447179,447192] [2025-03-08 21:06:22,287 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447329,447342] [2025-03-08 21:06:22,287 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447476,447489] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[447637,447650] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[447807,447820] [2025-03-08 21:06:22,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--host--u132-hcd.ko.cil.i[447969,447982] [2025-03-08 21:06:22,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:06:22,321 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:06:22,382 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (804), "i" (12UL)); [4421-4422] [2025-03-08 21:06:22,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (44UL), [paravirt_opptr] "i" (& pv_irq_ops.save_fl.func), [paravirt_clobber] "i" (1): "memory", "cc"); [4427-4429] [2025-03-08 21:06:22,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434581,434594] [2025-03-08 21:06:22,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434726,434739] [2025-03-08 21:06:22,673 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434872,434885] [2025-03-08 21:06:22,673 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435037,435050] [2025-03-08 21:06:22,673 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435195,435208] [2025-03-08 21:06:22,673 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435353,435366] [2025-03-08 21:06:22,673 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435511,435524] [2025-03-08 21:06:22,674 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435671,435684] [2025-03-08 21:06:22,674 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435830,435843] [2025-03-08 21:06:22,674 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435969,435982] [2025-03-08 21:06:22,674 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436111,436124] [2025-03-08 21:06:22,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436260,436273] [2025-03-08 21:06:22,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436399,436412] [2025-03-08 21:06:22,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436554,436567] [2025-03-08 21:06:22,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436714,436727] [2025-03-08 21:06:22,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436865,436878] [2025-03-08 21:06:22,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437016,437029] [2025-03-08 21:06:22,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437168,437181] [2025-03-08 21:06:22,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437317,437330] [2025-03-08 21:06:22,678 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437465,437478] [2025-03-08 21:06:22,678 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437622,437635] [2025-03-08 21:06:22,678 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437771,437784] [2025-03-08 21:06:22,678 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437927,437940] [2025-03-08 21:06:22,678 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438080,438093] [2025-03-08 21:06:22,678 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438226,438239] [2025-03-08 21:06:22,679 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438369,438382] [2025-03-08 21:06:22,679 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438521,438534] [2025-03-08 21:06:22,679 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438667,438680] [2025-03-08 21:06:22,679 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438812,438825] [2025-03-08 21:06:22,679 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438966,438979] [2025-03-08 21:06:22,679 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439117,439130] [2025-03-08 21:06:22,679 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439272,439285] [2025-03-08 21:06:22,680 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439424,439437] [2025-03-08 21:06:22,680 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439579,439592] [2025-03-08 21:06:22,680 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439743,439756] [2025-03-08 21:06:22,680 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439899,439912] [2025-03-08 21:06:22,680 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440063,440076] [2025-03-08 21:06:22,680 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440205,440218] [2025-03-08 21:06:22,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440363,440376] [2025-03-08 21:06:22,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440530,440543] [2025-03-08 21:06:22,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440689,440702] [2025-03-08 21:06:22,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440848,440861] [2025-03-08 21:06:22,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440997,441010] [2025-03-08 21:06:22,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441144,441157] [2025-03-08 21:06:22,684 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441283,441296] [2025-03-08 21:06:22,684 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441446,441459] [2025-03-08 21:06:22,684 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441612,441625] [2025-03-08 21:06:22,685 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441776,441789] [2025-03-08 21:06:22,686 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441941,441954] [2025-03-08 21:06:22,686 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442106,442119] [2025-03-08 21:06:22,686 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442272,442285] [2025-03-08 21:06:22,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442437,442450] [2025-03-08 21:06:22,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442604,442617] [2025-03-08 21:06:22,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442764,442777] [2025-03-08 21:06:22,688 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442926,442939] [2025-03-08 21:06:22,688 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443085,443098] [2025-03-08 21:06:22,688 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443231,443244] [2025-03-08 21:06:22,688 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443374,443387] [2025-03-08 21:06:22,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443518,443531] [2025-03-08 21:06:22,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443661,443674] [2025-03-08 21:06:22,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443805,443818] [2025-03-08 21:06:22,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443946,443959] [2025-03-08 21:06:22,690 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444084,444097] [2025-03-08 21:06:22,690 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444242,444255] [2025-03-08 21:06:22,690 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444401,444414] [2025-03-08 21:06:22,690 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444557,444570] [2025-03-08 21:06:22,691 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444706,444719] [2025-03-08 21:06:22,691 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444858,444871] [2025-03-08 21:06:22,691 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445009,445022] [2025-03-08 21:06:22,691 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445158,445171] [2025-03-08 21:06:22,692 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445310,445323] [2025-03-08 21:06:22,692 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445458,445471] [2025-03-08 21:06:22,692 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445611,445624] [2025-03-08 21:06:22,693 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445762,445775] [2025-03-08 21:06:22,693 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445912,445925] [2025-03-08 21:06:22,693 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446059,446072] [2025-03-08 21:06:22,693 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446210,446223] [2025-03-08 21:06:22,693 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446361,446374] [2025-03-08 21:06:22,694 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446509,446522] [2025-03-08 21:06:22,694 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446675,446688] [2025-03-08 21:06:22,694 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446844,446857] [2025-03-08 21:06:22,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447011,447024] [2025-03-08 21:06:22,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447179,447192] [2025-03-08 21:06:22,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447329,447342] [2025-03-08 21:06:22,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447476,447489] [2025-03-08 21:06:22,696 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447637,447650] [2025-03-08 21:06:22,696 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447807,447820] [2025-03-08 21:06:22,696 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447969,447982] [2025-03-08 21:06:22,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:06:22,866 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:06:22,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:22 WrapperNode [2025-03-08 21:06:22,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:06:22,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:06:22,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:06:22,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:06:22,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:22" (1/1) ... [2025-03-08 21:06:22,945 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:22" (1/1) ... [2025-03-08 21:06:23,108 INFO L138 Inliner]: procedures = 751, calls = 3543, calls flagged for inlining = 402, calls inlined = 238, statements flattened = 7395 [2025-03-08 21:06:23,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:06:23,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:06:23,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:06:23,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:06:23,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:22" (1/1) ... [2025-03-08 21:06:23,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:22" (1/1) ... [2025-03-08 21:06:23,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:22" (1/1) ... [2025-03-08 21:06:24,071 INFO L175 MemorySlicer]: Split 1107 memory accesses to 23 slices as follows [4, 46, 23, 2, 2, 2, 905, 2, 3, 5, 1, 2, 12, 17, 7, 2, 17, 46, 2, 1, 3, 2, 1]. 82 percent of accesses are in the largest equivalence class. The 85 initializations are split as follows [0, 0, 23, 0, 0, 0, 32, 0, 3, 5, 1, 2, 12, 0, 7, 0, 0, 0, 0, 0, 0, 0, 0]. The 433 writes are split as follows [1, 0, 0, 1, 0, 1, 343, 1, 0, 0, 0, 0, 0, 17, 0, 1, 17, 46, 1, 0, 3, 1, 0]. [2025-03-08 21:06:24,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:22" (1/1) ... [2025-03-08 21:06:24,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:22" (1/1) ... [2025-03-08 21:06:24,175 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:22" (1/1) ... [2025-03-08 21:06:24,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:22" (1/1) ... [2025-03-08 21:06:24,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:22" (1/1) ... [2025-03-08 21:06:24,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:22" (1/1) ... [2025-03-08 21:06:24,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:06:24,300 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:06:24,300 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:06:24,300 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:06:24,301 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:22" (1/1) ... [2025-03-08 21:06:24,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:06:24,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:06:24,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:06:24,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:06:24,352 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-03-08 21:06:24,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-03-08 21:06:24,352 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 21:06:24,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 21:06:24,353 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-08 21:06:24,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-08 21:06:24,353 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_delayed_work [2025-03-08 21:06:24,353 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_delayed_work [2025-03-08 21:06:24,353 INFO L130 BoogieDeclarations]: Found specification of procedure u132_disable [2025-03-08 21:06:24,353 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_disable [2025-03-08 21:06:24,353 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-08 21:06:24,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-08 21:06:24,353 INFO L130 BoogieDeclarations]: Found specification of procedure u132_remove [2025-03-08 21:06:24,353 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_remove [2025-03-08 21:06:24,353 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_init_kref [2025-03-08 21:06:24,354 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_init_kref [2025-03-08 21:06:24,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-03-08 21:06:24,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-03-08 21:06:24,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-03-08 21:06:24,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-03-08 21:06:24,354 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-08 21:06:24,354 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-08 21:06:24,354 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_put_kref [2025-03-08 21:06:24,355 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_put_kref [2025-03-08 21:06:24,355 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_read_pcimem [2025-03-08 21:06:24,355 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_read_pcimem [2025-03-08 21:06:24,355 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_requeue_work [2025-03-08 21:06:24,355 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_requeue_work [2025-03-08 21:06:24,355 INFO L130 BoogieDeclarations]: Found specification of procedure u132_bus_suspend [2025-03-08 21:06:24,355 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_bus_suspend [2025-03-08 21:06:24,355 INFO L130 BoogieDeclarations]: Found specification of procedure u132_get_frame [2025-03-08 21:06:24,355 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_get_frame [2025-03-08 21:06:24,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-08 21:06:24,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-08 21:06:24,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure edset_output [2025-03-08 21:06:24,356 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_output [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-03-08 21:06:24,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure read_roothub_info [2025-03-08 21:06:24,356 INFO L138 BoogieDeclarations]: Found implementation of procedure read_roothub_info [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_scheduler_lock_of_u132 [2025-03-08 21:06:24,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_scheduler_lock_of_u132 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure edset_single [2025-03-08 21:06:24,356 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_single [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure edset_setup [2025-03-08 21:06:24,356 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_setup [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-03-08 21:06:24,356 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-08 21:06:24,356 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-03-08 21:06:24,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure u132_resume [2025-03-08 21:06:24,356 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_resume [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure ftdi_elan_gone_away [2025-03-08 21:06:24,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ftdi_elan_gone_away [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-08 21:06:24,356 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-08 21:06:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-03-08 21:06:24,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2025-03-08 21:06:24,357 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-08 21:06:24,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_cancel_work [2025-03-08 21:06:24,357 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_cancel_work [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure kref_get [2025-03-08 21:06:24,357 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_get [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-08 21:06:24,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_unlink_urb_from_ep [2025-03-08 21:06:24,357 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_unlink_urb_from_ep [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 21:06:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 21:06:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 21:06:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 21:06:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 21:06:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 21:06:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 21:06:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 21:06:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 21:06:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-08 21:06:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-08 21:06:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-08 21:06:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-08 21:06:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-08 21:06:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_ring_work_scheduler [2025-03-08 21:06:24,360 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_ring_work_scheduler [2025-03-08 21:06:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-03-08 21:06:24,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-03-08 21:06:24,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-03-08 21:06:24,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-03-08 21:06:24,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure u132_u132_put_kref [2025-03-08 21:06:24,361 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_u132_put_kref [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-03-08 21:06:24,361 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-03-08 21:06:24,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_endp_work_scheduler [2025-03-08 21:06:24,361 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_endp_work_scheduler [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2025-03-08 21:06:24,361 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-08 21:06:24,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_monitor_work [2025-03-08 21:06:24,361 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_monitor_work [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure u132_monitor_requeue_work [2025-03-08 21:06:24,361 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_monitor_requeue_work [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_stop [2025-03-08 21:06:24,361 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_stop [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-08 21:06:24,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_giveback_urb [2025-03-08 21:06:24,361 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_giveback_urb [2025-03-08 21:06:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 21:06:24,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 21:06:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_write_pcimem [2025-03-08 21:06:24,364 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_write_pcimem [2025-03-08 21:06:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-03-08 21:06:24,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-03-08 21:06:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_queue_work [2025-03-08 21:06:24,364 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_queue_work [2025-03-08 21:06:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_u132_module_lock [2025-03-08 21:06:24,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_u132_module_lock [2025-03-08 21:06:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_queue_work [2025-03-08 21:06:24,364 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_queue_work [2025-03-08 21:06:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2025-03-08 21:06:24,364 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2025-03-08 21:06:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2025-03-08 21:06:24,364 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2025-03-08 21:06:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-03-08 21:06:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_start [2025-03-08 21:06:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_start [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-03-08 21:06:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_edset_input [2025-03-08 21:06:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_edset_input [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure u132_to_hcd [2025-03-08 21:06:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_to_hcd [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure u132_probe [2025-03-08 21:06:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_probe [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sw_lock_of_u132 [2025-03-08 21:06:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sw_lock_of_u132 [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure queue_delayed_work [2025-03-08 21:06:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_delayed_work [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2025-03-08 21:06:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:06:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_init_kref [2025-03-08 21:06:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_init_kref [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_sw_lock_of_u132 [2025-03-08 21:06:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_sw_lock_of_u132 [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2025-03-08 21:06:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2025-03-08 21:06:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 21:06:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 21:06:24,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_get_kref [2025-03-08 21:06:24,366 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_get_kref [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-08 21:06:24,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure hcd_to_u132 [2025-03-08 21:06:24,366 INFO L138 BoogieDeclarations]: Found implementation of procedure hcd_to_u132 [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-03-08 21:06:24,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_giveback_urb [2025-03-08 21:06:24,366 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_giveback_urb [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure u132_bus_resume [2025-03-08 21:06:24,366 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_bus_resume [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_slock_of_u132_spin [2025-03-08 21:06:24,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_slock_of_u132_spin [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-03-08 21:06:24,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_delete [2025-03-08 21:06:24,366 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_delete [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_platdata [2025-03-08 21:06:24,366 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_platdata [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-08 21:06:24,366 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-08 21:06:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-08 21:06:24,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_put_kref [2025-03-08 21:06:24,367 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_put_kref [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-08 21:06:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_100 [2025-03-08 21:06:24,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_100 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-08 21:06:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_put_kref [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_put_kref [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_urb_dequeue [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_urb_dequeue [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_reset [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_reset [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure port_power [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure port_power [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-08 21:06:24,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 21:06:24,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 21:06:24,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 21:06:24,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 21:06:24,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 21:06:24,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 21:06:24,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 21:06:24,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 21:06:24,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 21:06:24,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 21:06:24,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 21:06:24,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 21:06:24,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-08 21:06:24,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_link_urb_to_ep [2025-03-08 21:06:24,373 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_link_urb_to_ep [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-08 21:06:24,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-08 21:06:24,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure kref_init [2025-03-08 21:06:24,373 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_init [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_scheduler_lock_of_u132 [2025-03-08 21:06:24,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_scheduler_lock_of_u132 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_cancel_work [2025-03-08 21:06:24,373 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_cancel_work [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-08 21:06:24,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-08 21:06:24,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2025-03-08 21:06:24,373 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2025-03-08 21:06:24,373 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_u132_module_lock [2025-03-08 21:06:24,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_u132_module_lock [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-08 21:06:24,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-08 21:06:25,144 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:06:25,146 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:06:25,262 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 21:06:25,287 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17123: havoc #t~nondet1580; [2025-03-08 21:06:25,433 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4756: havoc #t~mem81.base, #t~mem81.offset; [2025-03-08 21:06:25,447 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17230: havoc #t~nondet1595; [2025-03-08 21:06:25,535 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17218: havoc usb_ftdi_elan_edset_output_#t~nondet1592#1; [2025-03-08 21:06:25,591 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5214: call ULTIMATE.dealloc(~#revision~0.base, ~#revision~0.offset);havoc ~#revision~0.base, ~#revision~0.offset; [2025-03-08 21:06:25,605 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17226: havoc usb_ftdi_elan_edset_single_#t~nondet1594#1; [2025-03-08 21:06:25,608 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17184: havoc #t~nondet1584; [2025-03-08 21:06:25,628 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17222: havoc usb_ftdi_elan_edset_setup_#t~nondet1593#1; [2025-03-08 21:06:25,756 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17241: havoc usb_hcd_check_unlink_urb_#t~nondet1597#1; [2025-03-08 21:06:25,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6992: call ULTIMATE.dealloc(u132_init_~#control~0#1.base, u132_init_~#control~0#1.offset);havoc u132_init_~#control~0#1.base, u132_init_~#control~0#1.offset;call ULTIMATE.dealloc(u132_init_~#rh_a~0#1.base, u132_init_~#rh_a~0#1.offset);havoc u132_init_~#rh_a~0#1.base, u132_init_~#rh_a~0#1.offset; [2025-03-08 21:06:25,862 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4395: havoc #t~mem17.base, #t~mem17.offset; [2025-03-08 21:06:25,889 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12903: havoc ldv_linux_usb_dev_atomic_add_return_#t~mem1430#1; [2025-03-08 21:06:26,167 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17210: havoc usb_ftdi_elan_edset_flush_#t~nondet1590#1; [2025-03-08 21:06:26,173 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17248: havoc #t~nondet1598; [2025-03-08 21:06:26,289 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17234: havoc #t~nondet1596; [2025-03-08 21:06:26,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4750: havoc dev_get_drvdata_#t~mem80#1.base, dev_get_drvdata_#t~mem80#1.offset; [2025-03-08 21:06:26,736 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7040: call ULTIMATE.dealloc(u132_run_~#control~1#1.base, u132_run_~#control~1#1.offset);havoc u132_run_~#control~1#1.base, u132_run_~#control~1#1.offset;call ULTIMATE.dealloc(u132_run_~#status~0#1.base, u132_run_~#status~0#1.offset);havoc u132_run_~#status~0#1.base, u132_run_~#status~0#1.offset;call ULTIMATE.dealloc(u132_run_~#fminterval~1#1.base, u132_run_~#fminterval~1#1.offset);havoc u132_run_~#fminterval~1#1.base, u132_run_~#fminterval~1#1.offset;call ULTIMATE.dealloc(u132_run_~#periodicstart~0#1.base, u132_run_~#periodicstart~0#1.offset);havoc u132_run_~#periodicstart~0#1.base, u132_run_~#periodicstart~0#1.offset;call ULTIMATE.dealloc(u132_run_~#cmdstatus~0#1.base, u132_run_~#cmdstatus~0#1.offset);havoc u132_run_~#cmdstatus~0#1.base, u132_run_~#cmdstatus~0#1.offset;call ULTIMATE.dealloc(u132_run_~#roothub_a___0~0#1.base, u132_run_~#roothub_a___0~0#1.offset);havoc u132_run_~#roothub_a___0~0#1.base, u132_run_~#roothub_a___0~0#1.offset;call ULTIMATE.dealloc(u132_run_~#temp~0#1.base, u132_run_~#temp~0#1.offset);havoc u132_run_~#temp~0#1.base, u132_run_~#temp~0#1.offset; [2025-03-08 21:06:26,736 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6927: call ULTIMATE.dealloc(u132_periodic_reinit_~#fminterval~0#1.base, u132_periodic_reinit_~#fminterval~0#1.offset);havoc u132_periodic_reinit_~#fminterval~0#1.base, u132_periodic_reinit_~#fminterval~0#1.offset; [2025-03-08 21:06:26,738 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17167: havoc #t~nondet1582; [2025-03-08 21:06:26,742 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17214: havoc #t~nondet1591; [2025-03-08 21:06:26,897 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17198: havoc usb_create_hcd_#t~ret1587#1.base, usb_create_hcd_#t~ret1587#1.offset; [2025-03-08 21:06:26,897 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4729: havoc kobject_name_#t~mem75#1.base, kobject_name_#t~mem75#1.offset; [2025-03-08 21:06:26,897 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4738: havoc dev_name_#t~mem78#1.base, dev_name_#t~mem78#1.offset; [2025-03-08 21:06:26,897 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9489: call ULTIMATE.dealloc(u132_initialise_~#__key~3#1.base, u132_initialise_~#__key~3#1.offset);havoc u132_initialise_~#__key~3#1.base, u132_initialise_~#__key~3#1.offset;call ULTIMATE.dealloc(u132_initialise_~#__key___0~3#1.base, u132_initialise_~#__key___0~3#1.offset);havoc u132_initialise_~#__key___0~3#1.base, u132_initialise_~#__key___0~3#1.offset;call ULTIMATE.dealloc(u132_initialise_~#__key___1~3#1.base, u132_initialise_~#__key___1~3#1.offset);havoc u132_initialise_~#__key___1~3#1.base, u132_initialise_~#__key___1~3#1.offset;call ULTIMATE.dealloc(u132_initialise_~#__constr_expr_0~3#1.base, u132_initialise_~#__constr_expr_0~3#1.offset);havoc u132_initialise_~#__constr_expr_0~3#1.base, u132_initialise_~#__constr_expr_0~3#1.offset;call ULTIMATE.dealloc(u132_initialise_~#__key___2~0#1.base, u132_initialise_~#__key___2~0#1.offset);havoc u132_initialise_~#__key___2~0#1.base, u132_initialise_~#__key___2~0#1.offset;call ULTIMATE.dealloc(u132_initialise_~#__key___3~0#1.base, u132_initialise_~#__key___3~0#1.offset);havoc u132_initialise_~#__key___3~0#1.base, u132_initialise_~#__key___3~0#1.offset;call ULTIMATE.dealloc(u132_initialise_~#__constr_expr_1~0#1.base, u132_initialise_~#__constr_expr_1~0#1.offset);havoc u132_initialise_~#__constr_expr_1~0#1.base, u132_initialise_~#__constr_expr_1~0#1.offset;call ULTIMATE.dealloc(u132_initialise_~#__key___4~0#1.base, u132_initialise_~#__key___4~0#1.offset);havoc u132_initialise_~#__key___4~0#1.base, u132_initialise_~#__key___4~0#1.offset; [2025-03-08 21:06:26,897 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9646: call ULTIMATE.dealloc(~#control~2#1.base, ~#control~2#1.offset);havoc ~#control~2#1.base, ~#control~2#1.offset;call ULTIMATE.dealloc(~#rh_a~2#1.base, ~#rh_a~2#1.offset);havoc ~#rh_a~2#1.base, ~#rh_a~2#1.offset; [2025-03-08 21:06:26,897 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17136: havoc device_wakeup_enable_#t~nondet1581#1; [2025-03-08 21:06:26,897 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17195: havoc usb_add_hcd_#t~nondet1586#1; [2025-03-08 21:06:26,906 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17188: havoc queue_delayed_work_on_#t~nondet1585#1; [2025-03-08 21:06:33,737 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10412: call ULTIMATE.dealloc(ldv_platform_platform_instance_0_~#ldv_0_resource_struct_pm_message~0#1.base, ldv_platform_platform_instance_0_~#ldv_0_resource_struct_pm_message~0#1.offset);havoc ldv_platform_platform_instance_0_~#ldv_0_resource_struct_pm_message~0#1.base, ldv_platform_platform_instance_0_~#ldv_0_resource_struct_pm_message~0#1.offset; [2025-03-08 21:06:33,738 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10412-1: call ULTIMATE.dealloc(ldv_platform_platform_instance_0_~#ldv_0_resource_struct_pm_message~0#1.base, ldv_platform_platform_instance_0_~#ldv_0_resource_struct_pm_message~0#1.offset);havoc ldv_platform_platform_instance_0_~#ldv_0_resource_struct_pm_message~0#1.base, ldv_platform_platform_instance_0_~#ldv_0_resource_struct_pm_message~0#1.offset; [2025-03-08 21:06:33,738 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10412-2: call ULTIMATE.dealloc(ldv_platform_platform_instance_0_~#ldv_0_resource_struct_pm_message~0#1.base, ldv_platform_platform_instance_0_~#ldv_0_resource_struct_pm_message~0#1.offset);havoc ldv_platform_platform_instance_0_~#ldv_0_resource_struct_pm_message~0#1.base, ldv_platform_platform_instance_0_~#ldv_0_resource_struct_pm_message~0#1.offset; [2025-03-08 21:06:33,738 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17085: havoc __alloc_workqueue_key_#t~ret1578#1.base, __alloc_workqueue_key_#t~ret1578#1.offset; [2025-03-08 21:06:33,738 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10083-1: ldv___platform_driver_register_#res#1 := ldv___platform_driver_register_~arg0#1; [2025-03-08 21:06:33,738 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8833: call ULTIMATE.dealloc(u132_roothub_portreset_~#fmnumber~0#1.base, u132_roothub_portreset_~#fmnumber~0#1.offset);havoc u132_roothub_portreset_~#fmnumber~0#1.base, u132_roothub_portreset_~#fmnumber~0#1.offset;call ULTIMATE.dealloc(u132_roothub_portreset_~#portstat~0#1.base, u132_roothub_portreset_~#portstat~0#1.offset);havoc u132_roothub_portreset_~#portstat~0#1.base, u132_roothub_portreset_~#portstat~0#1.offset; [2025-03-08 21:06:33,738 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9900: call ULTIMATE.dealloc(u132_hcd_exit_~#__wait~0#1.base, u132_hcd_exit_~#__wait~0#1.offset);havoc u132_hcd_exit_~#__wait~0#1.base, u132_hcd_exit_~#__wait~0#1.offset; [2025-03-08 21:06:33,738 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10367: call ULTIMATE.dealloc(ldv_platform_instance_callback_0_20_~#arg2#1.base, ldv_platform_instance_callback_0_20_~#arg2#1.offset);havoc ldv_platform_instance_callback_0_20_~#arg2#1.base, ldv_platform_instance_callback_0_20_~#arg2#1.offset; [2025-03-08 21:06:33,738 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17110: havoc __platform_driver_register_#t~nondet1579#1; [2025-03-08 21:06:33,738 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8788: call ULTIMATE.dealloc(u132_roothub_status_~#rh_status~0#1.base, u132_roothub_status_~#rh_status~0#1.offset);havoc u132_roothub_status_~#rh_status~0#1.base, u132_roothub_status_~#rh_status~0#1.offset; [2025-03-08 21:06:33,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7731: call ULTIMATE.dealloc(create_endpoint_and_queue_bulk_~#__key~1#1.base, create_endpoint_and_queue_bulk_~#__key~1#1.offset);havoc create_endpoint_and_queue_bulk_~#__key~1#1.base, create_endpoint_and_queue_bulk_~#__key~1#1.offset;call ULTIMATE.dealloc(create_endpoint_and_queue_bulk_~#__key___0~1#1.base, create_endpoint_and_queue_bulk_~#__key___0~1#1.offset);havoc create_endpoint_and_queue_bulk_~#__key___0~1#1.base, create_endpoint_and_queue_bulk_~#__key___0~1#1.offset;call ULTIMATE.dealloc(create_endpoint_and_queue_bulk_~#__constr_expr_0~1#1.base, create_endpoint_and_queue_bulk_~#__constr_expr_0~1#1.offset);havoc create_endpoint_and_queue_bulk_~#__constr_expr_0~1#1.base, create_endpoint_and_queue_bulk_~#__constr_expr_0~1#1.offset;call ULTIMATE.dealloc(create_endpoint_and_queue_bulk_~#__key___1~1#1.base, create_endpoint_and_queue_bulk_~#__key___1~1#1.offset);havoc create_endpoint_and_queue_bulk_~#__key___1~1#1.base, create_endpoint_and_queue_bulk_~#__key___1~1#1.offset; [2025-03-08 21:06:33,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8195: call ULTIMATE.dealloc(u132_urb_enqueue_~#data~0#1.base, u132_urb_enqueue_~#data~0#1.offset);havoc u132_urb_enqueue_~#data~0#1.base, u132_urb_enqueue_~#data~0#1.offset; [2025-03-08 21:06:33,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17180: havoc prepare_to_wait_event_#t~nondet1583#1; [2025-03-08 21:06:33,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8731: call ULTIMATE.dealloc(u132_roothub_descriptor_~#rh_a~1#1.base, u132_roothub_descriptor_~#rh_a~1#1.offset);havoc u132_roothub_descriptor_~#rh_a~1#1.base, u132_roothub_descriptor_~#rh_a~1#1.offset;call ULTIMATE.dealloc(u132_roothub_descriptor_~#rh_b~0#1.base, u132_roothub_descriptor_~#rh_b~0#1.offset);havoc u132_roothub_descriptor_~#rh_b~0#1.base, u132_roothub_descriptor_~#rh_b~0#1.offset; [2025-03-08 21:06:33,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4437: havoc arch_irqs_disabled_flags_#t~bitwise25#1; [2025-03-08 21:06:33,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12565-1: ldv___platform_driver_register_252_#res#1 := ldv___platform_driver_register_252_~ldv_func_res~0#1; [2025-03-08 21:06:33,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8804: call ULTIMATE.dealloc(u132_roothub_portstatus_~#rh_portstatus~0#1.base, u132_roothub_portstatus_~#rh_portstatus~0#1.offset);havoc u132_roothub_portstatus_~#rh_portstatus~0#1.base, u132_roothub_portstatus_~#rh_portstatus~0#1.offset; [2025-03-08 21:06:33,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9731: call ULTIMATE.dealloc(u132_suspend_~#state#1.base, u132_suspend_~#state#1.offset);havoc u132_suspend_~#state#1.base, u132_suspend_~#state#1.offset; [2025-03-08 21:06:33,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9866: call ULTIMATE.dealloc(u132_hcd_init_~#__key~4#1.base, u132_hcd_init_~#__key~4#1.offset);havoc u132_hcd_init_~#__key~4#1.base, u132_hcd_init_~#__key~4#1.offset;call ULTIMATE.dealloc(u132_hcd_init_~#__key___0~4#1.base, u132_hcd_init_~#__key___0~4#1.offset);havoc u132_hcd_init_~#__key___0~4#1.base, u132_hcd_init_~#__key___0~4#1.offset; [2025-03-08 21:06:33,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17202: havoc usb_disabled_#t~nondet1588#1; [2025-03-08 21:06:33,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7888: call ULTIMATE.dealloc(create_endpoint_and_queue_control_~#__key~2#1.base, create_endpoint_and_queue_control_~#__key~2#1.offset);havoc create_endpoint_and_queue_control_~#__key~2#1.base, create_endpoint_and_queue_control_~#__key~2#1.offset;call ULTIMATE.dealloc(create_endpoint_and_queue_control_~#__key___0~2#1.base, create_endpoint_and_queue_control_~#__key___0~2#1.offset);havoc create_endpoint_and_queue_control_~#__key___0~2#1.base, create_endpoint_and_queue_control_~#__key___0~2#1.offset;call ULTIMATE.dealloc(create_endpoint_and_queue_control_~#__constr_expr_0~2#1.base, create_endpoint_and_queue_control_~#__constr_expr_0~2#1.offset);havoc create_endpoint_and_queue_control_~#__constr_expr_0~2#1.base, create_endpoint_and_queue_control_~#__constr_expr_0~2#1.offset;call ULTIMATE.dealloc(create_endpoint_and_queue_control_~#__key___1~2#1.base, create_endpoint_and_queue_control_~#__key___1~2#1.offset);havoc create_endpoint_and_queue_control_~#__key___1~2#1.base, create_endpoint_and_queue_control_~#__key___1~2#1.offset; [2025-03-08 21:06:33,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7560: call ULTIMATE.dealloc(create_endpoint_and_queue_int_~#__key~0#1.base, create_endpoint_and_queue_int_~#__key~0#1.offset);havoc create_endpoint_and_queue_int_~#__key~0#1.base, create_endpoint_and_queue_int_~#__key~0#1.offset;call ULTIMATE.dealloc(create_endpoint_and_queue_int_~#__key___0~0#1.base, create_endpoint_and_queue_int_~#__key___0~0#1.offset);havoc create_endpoint_and_queue_int_~#__key___0~0#1.base, create_endpoint_and_queue_int_~#__key___0~0#1.offset;call ULTIMATE.dealloc(create_endpoint_and_queue_int_~#__constr_expr_0~0#1.base, create_endpoint_and_queue_int_~#__constr_expr_0~0#1.offset);havoc create_endpoint_and_queue_int_~#__constr_expr_0~0#1.base, create_endpoint_and_queue_int_~#__constr_expr_0~0#1.offset;call ULTIMATE.dealloc(create_endpoint_and_queue_int_~#__key___1~0#1.base, create_endpoint_and_queue_int_~#__key___1~0#1.offset);havoc create_endpoint_and_queue_int_~#__key___1~0#1.base, create_endpoint_and_queue_int_~#__key___1~0#1.offset; [2025-03-08 21:06:34,610 INFO L? ?]: Removed 2727 outVars from TransFormulas that were not future-live. [2025-03-08 21:06:34,610 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:06:34,684 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:06:34,687 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:06:34,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:06:34 BoogieIcfgContainer [2025-03-08 21:06:34,688 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:06:34,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:06:34,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:06:34,693 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:06:34,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:06:18" (1/3) ... [2025-03-08 21:06:34,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d66193c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:06:34, skipping insertion in model container [2025-03-08 21:06:34,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:22" (2/3) ... [2025-03-08 21:06:34,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d66193c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:06:34, skipping insertion in model container [2025-03-08 21:06:34,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:06:34" (3/3) ... [2025-03-08 21:06:34,696 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i [2025-03-08 21:06:34,709 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:06:34,712 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i that has 120 procedures, 2457 locations, 1 initial locations, 3 loop locations, and 29 error locations. [2025-03-08 21:06:34,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:06:34,818 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;@23baa760, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:06:34,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-08 21:06:34,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 2456 states, 1685 states have (on average 1.3394658753709199) internal successors, (2257), 1777 states have internal predecessors, (2257), 623 states have call successors, (623), 119 states have call predecessors, (623), 118 states have return successors, (617), 585 states have call predecessors, (617), 617 states have call successors, (617) [2025-03-08 21:06:34,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 21:06:34,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:34,838 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:06:34,838 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 27 more)] === [2025-03-08 21:06:34,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:34,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1046906396, now seen corresponding path program 1 times [2025-03-08 21:06:34,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:34,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087749772] [2025-03-08 21:06:34,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:34,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:35,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 21:06:35,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 21:06:35,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:35,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:06:36,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:36,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087749772] [2025-03-08 21:06:36,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087749772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:36,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:36,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:36,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269185268] [2025-03-08 21:06:36,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:36,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:36,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:36,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:36,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:36,671 INFO L87 Difference]: Start difference. First operand has 2456 states, 1685 states have (on average 1.3394658753709199) internal successors, (2257), 1777 states have internal predecessors, (2257), 623 states have call successors, (623), 119 states have call predecessors, (623), 118 states have return successors, (617), 585 states have call predecessors, (617), 617 states have call successors, (617) Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 21:06:37,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:37,390 INFO L93 Difference]: Finished difference Result 4870 states and 7161 transitions. [2025-03-08 21:06:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:37,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2025-03-08 21:06:37,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:37,421 INFO L225 Difference]: With dead ends: 4870 [2025-03-08 21:06:37,421 INFO L226 Difference]: Without dead ends: 2436 [2025-03-08 21:06:37,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:37,438 INFO L435 NwaCegarLoop]: 3390 mSDtfsCounter, 3426 mSDsluCounter, 3389 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3426 SdHoareTripleChecker+Valid, 6779 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:37,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3426 Valid, 6779 Invalid, 124 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:06:37,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2025-03-08 21:06:37,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2436. [2025-03-08 21:06:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2436 states, 1674 states have (on average 1.3142174432497014) internal successors, (2200), 1761 states have internal predecessors, (2200), 617 states have call successors, (617), 118 states have call predecessors, (617), 117 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-03-08 21:06:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2436 states and 3432 transitions. [2025-03-08 21:06:37,634 INFO L78 Accepts]: Start accepts. Automaton has 2436 states and 3432 transitions. Word has length 61 [2025-03-08 21:06:37,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:37,637 INFO L471 AbstractCegarLoop]: Abstraction has 2436 states and 3432 transitions. [2025-03-08 21:06:37,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 21:06:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 3432 transitions. [2025-03-08 21:06:37,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 21:06:37,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:37,643 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:06:37,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:06:37,643 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 27 more)] === [2025-03-08 21:06:37,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:37,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1750356117, now seen corresponding path program 1 times [2025-03-08 21:06:37,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:37,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866938660] [2025-03-08 21:06:37,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:37,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:38,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 21:06:38,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 21:06:38,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:38,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:06:38,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:38,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866938660] [2025-03-08 21:06:38,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866938660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:38,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:38,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:38,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495915286] [2025-03-08 21:06:38,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:38,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:38,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:38,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:38,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:38,958 INFO L87 Difference]: Start difference. First operand 2436 states and 3432 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 21:06:39,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:39,557 INFO L93 Difference]: Finished difference Result 2436 states and 3432 transitions. [2025-03-08 21:06:39,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:39,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (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 67 [2025-03-08 21:06:39,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:39,575 INFO L225 Difference]: With dead ends: 2436 [2025-03-08 21:06:39,575 INFO L226 Difference]: Without dead ends: 2434 [2025-03-08 21:06:39,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:39,578 INFO L435 NwaCegarLoop]: 3368 mSDtfsCounter, 3403 mSDsluCounter, 3367 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3403 SdHoareTripleChecker+Valid, 6735 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:39,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3403 Valid, 6735 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:06:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2025-03-08 21:06:39,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2025-03-08 21:06:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 1673 states have (on average 1.3138075313807531) internal successors, (2198), 1759 states have internal predecessors, (2198), 617 states have call successors, (617), 118 states have call predecessors, (617), 117 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-03-08 21:06:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3430 transitions. [2025-03-08 21:06:39,687 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3430 transitions. Word has length 67 [2025-03-08 21:06:39,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:39,687 INFO L471 AbstractCegarLoop]: Abstraction has 2434 states and 3430 transitions. [2025-03-08 21:06:39,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 21:06:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3430 transitions. [2025-03-08 21:06:39,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 21:06:39,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:39,691 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-08 21:06:39,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:06:39,691 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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 27 more)] === [2025-03-08 21:06:39,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:39,691 INFO L85 PathProgramCache]: Analyzing trace with hash 307323487, now seen corresponding path program 1 times [2025-03-08 21:06:39,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:39,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181690409] [2025-03-08 21:06:39,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:39,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:40,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:06:40,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:06:40,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:40,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 21:06:41,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:41,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181690409] [2025-03-08 21:06:41,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181690409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:41,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:41,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:06:41,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801462525] [2025-03-08 21:06:41,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:41,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:06:41,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:41,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:06:41,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:41,146 INFO L87 Difference]: Start difference. First operand 2434 states and 3430 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 21:06:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:42,115 INFO L93 Difference]: Finished difference Result 2453 states and 3445 transitions. [2025-03-08 21:06:42,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:06:42,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2025-03-08 21:06:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:42,131 INFO L225 Difference]: With dead ends: 2453 [2025-03-08 21:06:42,131 INFO L226 Difference]: Without dead ends: 2451 [2025-03-08 21:06:42,134 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-08 21:06:42,135 INFO L435 NwaCegarLoop]: 3375 mSDtfsCounter, 3383 mSDsluCounter, 6775 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3384 SdHoareTripleChecker+Valid, 10150 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:42,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3384 Valid, 10150 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 21:06:42,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2025-03-08 21:06:42,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2449. [2025-03-08 21:06:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2449 states, 1684 states have (on average 1.312351543942993) internal successors, (2210), 1770 states have internal predecessors, (2210), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-03-08 21:06:42,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 3442 transitions. [2025-03-08 21:06:42,239 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 3442 transitions. Word has length 69 [2025-03-08 21:06:42,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:42,240 INFO L471 AbstractCegarLoop]: Abstraction has 2449 states and 3442 transitions. [2025-03-08 21:06:42,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 21:06:42,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 3442 transitions. [2025-03-08 21:06:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 21:06:42,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:42,242 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:06:42,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:06:42,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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 27 more)] === [2025-03-08 21:06:42,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1791335952, now seen corresponding path program 1 times [2025-03-08 21:06:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:42,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438185940] [2025-03-08 21:06:42,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:42,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:42,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 21:06:42,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 21:06:42,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:42,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:43,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:06:43,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:43,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438185940] [2025-03-08 21:06:43,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438185940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:43,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:43,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:43,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469407725] [2025-03-08 21:06:43,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:43,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:43,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:43,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:43,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:43,205 INFO L87 Difference]: Start difference. First operand 2449 states and 3442 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 21:06:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:43,927 INFO L93 Difference]: Finished difference Result 2449 states and 3442 transitions. [2025-03-08 21:06:43,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:43,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (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 73 [2025-03-08 21:06:43,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:43,952 INFO L225 Difference]: With dead ends: 2449 [2025-03-08 21:06:43,952 INFO L226 Difference]: Without dead ends: 2447 [2025-03-08 21:06:43,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:43,958 INFO L435 NwaCegarLoop]: 3366 mSDtfsCounter, 3400 mSDsluCounter, 3365 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3400 SdHoareTripleChecker+Valid, 6731 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:43,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3400 Valid, 6731 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:06:43,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2025-03-08 21:06:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2447. [2025-03-08 21:06:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 1683 states have (on average 1.3119429590017826) internal successors, (2208), 1768 states have internal predecessors, (2208), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-03-08 21:06:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3440 transitions. [2025-03-08 21:06:44,185 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3440 transitions. Word has length 73 [2025-03-08 21:06:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:44,185 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 3440 transitions. [2025-03-08 21:06:44,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 21:06:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3440 transitions. [2025-03-08 21:06:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 21:06:44,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:44,191 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:06:44,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:06:44,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-03-08 21:06:44,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:44,192 INFO L85 PathProgramCache]: Analyzing trace with hash -556959073, now seen corresponding path program 1 times [2025-03-08 21:06:44,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:44,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531203153] [2025-03-08 21:06:44,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:44,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:44,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 21:06:44,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 21:06:44,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:44,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:06:45,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:45,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531203153] [2025-03-08 21:06:45,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531203153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:45,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:45,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:45,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495243668] [2025-03-08 21:06:45,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:45,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:45,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:45,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:45,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:45,185 INFO L87 Difference]: Start difference. First operand 2447 states and 3440 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 21:06:45,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:45,613 INFO L93 Difference]: Finished difference Result 2447 states and 3440 transitions. [2025-03-08 21:06:45,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:45,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (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 79 [2025-03-08 21:06:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:45,624 INFO L225 Difference]: With dead ends: 2447 [2025-03-08 21:06:45,624 INFO L226 Difference]: Without dead ends: 2445 [2025-03-08 21:06:45,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:45,625 INFO L435 NwaCegarLoop]: 3364 mSDtfsCounter, 3397 mSDsluCounter, 3363 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3397 SdHoareTripleChecker+Valid, 6727 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:45,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3397 Valid, 6727 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:06:45,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2025-03-08 21:06:45,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2445. [2025-03-08 21:06:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 1682 states have (on average 1.3115338882282996) internal successors, (2206), 1766 states have internal predecessors, (2206), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-03-08 21:06:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3438 transitions. [2025-03-08 21:06:45,707 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3438 transitions. Word has length 79 [2025-03-08 21:06:45,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:45,707 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 3438 transitions. [2025-03-08 21:06:45,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 21:06:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3438 transitions. [2025-03-08 21:06:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 21:06:45,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:45,708 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-08 21:06:45,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:06:45,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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 27 more)] === [2025-03-08 21:06:45,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:45,709 INFO L85 PathProgramCache]: Analyzing trace with hash 844469831, now seen corresponding path program 1 times [2025-03-08 21:06:45,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:45,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680590219] [2025-03-08 21:06:45,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:45,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:46,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 21:06:46,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 21:06:46,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:46,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 21:06:47,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:47,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680590219] [2025-03-08 21:06:47,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680590219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:47,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:47,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:06:47,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926367355] [2025-03-08 21:06:47,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:47,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:06:47,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:47,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:06:47,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:47,053 INFO L87 Difference]: Start difference. First operand 2445 states and 3438 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, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 21:06:51,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 21:06:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:52,267 INFO L93 Difference]: Finished difference Result 2447 states and 3439 transitions. [2025-03-08 21:06:52,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:06:52,271 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, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2025-03-08 21:06:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:52,289 INFO L225 Difference]: With dead ends: 2447 [2025-03-08 21:06:52,289 INFO L226 Difference]: Without dead ends: 2445 [2025-03-08 21:06:52,292 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-08 21:06:52,292 INFO L435 NwaCegarLoop]: 3365 mSDtfsCounter, 25 mSDsluCounter, 10068 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 13433 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:52,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 13433 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-03-08 21:06:52,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2025-03-08 21:06:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2445. [2025-03-08 21:06:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 1682 states have (on average 1.3109393579072532) internal successors, (2205), 1766 states have internal predecessors, (2205), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-03-08 21:06:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3437 transitions. [2025-03-08 21:06:52,400 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3437 transitions. Word has length 80 [2025-03-08 21:06:52,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:52,402 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 3437 transitions. [2025-03-08 21:06:52,402 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, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 21:06:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3437 transitions. [2025-03-08 21:06:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 21:06:52,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:52,405 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:06:52,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:06:52,405 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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 27 more)] === [2025-03-08 21:06:52,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:52,405 INFO L85 PathProgramCache]: Analyzing trace with hash -906979327, now seen corresponding path program 1 times [2025-03-08 21:06:52,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:52,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820108719] [2025-03-08 21:06:52,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:52,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:53,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 21:06:53,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 21:06:53,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:53,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:53,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:06:53,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:53,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820108719] [2025-03-08 21:06:53,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820108719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:53,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:53,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:53,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404773985] [2025-03-08 21:06:53,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:53,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:53,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:53,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:53,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:53,349 INFO L87 Difference]: Start difference. First operand 2445 states and 3437 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 21:06:53,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:53,921 INFO L93 Difference]: Finished difference Result 2445 states and 3437 transitions. [2025-03-08 21:06:53,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:53,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (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 85 [2025-03-08 21:06:53,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:53,933 INFO L225 Difference]: With dead ends: 2445 [2025-03-08 21:06:53,933 INFO L226 Difference]: Without dead ends: 2443 [2025-03-08 21:06:53,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:53,936 INFO L435 NwaCegarLoop]: 3362 mSDtfsCounter, 3394 mSDsluCounter, 3361 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3394 SdHoareTripleChecker+Valid, 6723 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:53,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3394 Valid, 6723 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:06:53,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2443 states. [2025-03-08 21:06:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2443 to 2443. [2025-03-08 21:06:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 1681 states have (on average 1.3105294467578823) internal successors, (2203), 1764 states have internal predecessors, (2203), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-03-08 21:06:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3435 transitions. [2025-03-08 21:06:54,029 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3435 transitions. Word has length 85 [2025-03-08 21:06:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:54,029 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 3435 transitions. [2025-03-08 21:06:54,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 21:06:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3435 transitions. [2025-03-08 21:06:54,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 21:06:54,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:54,032 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:06:54,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:06:54,032 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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 27 more)] === [2025-03-08 21:06:54,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:54,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1439166935, now seen corresponding path program 1 times [2025-03-08 21:06:54,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:54,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210901048] [2025-03-08 21:06:54,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:54,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:54,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 21:06:54,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 21:06:54,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:54,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:06:54,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:54,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210901048] [2025-03-08 21:06:54,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210901048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:54,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:54,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:54,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959585125] [2025-03-08 21:06:54,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:54,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:54,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:54,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:54,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:54,922 INFO L87 Difference]: Start difference. First operand 2443 states and 3435 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 21:06:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:55,432 INFO L93 Difference]: Finished difference Result 2443 states and 3435 transitions. [2025-03-08 21:06:55,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:55,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (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 91 [2025-03-08 21:06:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:55,444 INFO L225 Difference]: With dead ends: 2443 [2025-03-08 21:06:55,444 INFO L226 Difference]: Without dead ends: 2441 [2025-03-08 21:06:55,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:55,446 INFO L435 NwaCegarLoop]: 3360 mSDtfsCounter, 3391 mSDsluCounter, 3359 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3391 SdHoareTripleChecker+Valid, 6719 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:55,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3391 Valid, 6719 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:06:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2025-03-08 21:06:55,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2441. [2025-03-08 21:06:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2441 states, 1680 states have (on average 1.3101190476190476) internal successors, (2201), 1762 states have internal predecessors, (2201), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-03-08 21:06:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3433 transitions. [2025-03-08 21:06:55,536 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3433 transitions. Word has length 91 [2025-03-08 21:06:55,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:55,537 INFO L471 AbstractCegarLoop]: Abstraction has 2441 states and 3433 transitions. [2025-03-08 21:06:55,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 21:06:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3433 transitions. [2025-03-08 21:06:55,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 21:06:55,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:55,539 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:06:55,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:06:55,539 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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 27 more)] === [2025-03-08 21:06:55,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:55,539 INFO L85 PathProgramCache]: Analyzing trace with hash 773695790, now seen corresponding path program 1 times [2025-03-08 21:06:55,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:55,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866637035] [2025-03-08 21:06:55,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:55,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:56,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 21:06:56,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 21:06:56,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:56,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:56,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:06:56,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:56,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866637035] [2025-03-08 21:06:56,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866637035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:56,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:56,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:56,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621882043] [2025-03-08 21:06:56,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:56,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:56,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:56,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:56,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:56,641 INFO L87 Difference]: Start difference. First operand 2441 states and 3433 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 21:06:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:57,273 INFO L93 Difference]: Finished difference Result 2441 states and 3433 transitions. [2025-03-08 21:06:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:57,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (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 97 [2025-03-08 21:06:57,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:57,285 INFO L225 Difference]: With dead ends: 2441 [2025-03-08 21:06:57,285 INFO L226 Difference]: Without dead ends: 2439 [2025-03-08 21:06:57,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:57,289 INFO L435 NwaCegarLoop]: 3358 mSDtfsCounter, 3388 mSDsluCounter, 3357 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3388 SdHoareTripleChecker+Valid, 6715 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:57,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3388 Valid, 6715 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:06:57,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2025-03-08 21:06:57,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 2439. [2025-03-08 21:06:57,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2439 states, 1679 states have (on average 1.3097081596188207) internal successors, (2199), 1760 states have internal predecessors, (2199), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-03-08 21:06:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 3431 transitions. [2025-03-08 21:06:57,391 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 3431 transitions. Word has length 97 [2025-03-08 21:06:57,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:57,394 INFO L471 AbstractCegarLoop]: Abstraction has 2439 states and 3431 transitions. [2025-03-08 21:06:57,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 21:06:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 3431 transitions. [2025-03-08 21:06:57,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 21:06:57,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:57,398 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:06:57,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:06:57,399 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-03-08 21:06:57,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:57,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1326203674, now seen corresponding path program 1 times [2025-03-08 21:06:57,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:57,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167086437] [2025-03-08 21:06:57,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:57,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:58,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 21:06:58,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 21:06:58,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:58,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:06:58,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:58,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167086437] [2025-03-08 21:06:58,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167086437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:58,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:58,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:58,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776400866] [2025-03-08 21:06:58,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:58,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:58,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:58,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:58,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:58,342 INFO L87 Difference]: Start difference. First operand 2439 states and 3431 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 21:06:58,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:58,948 INFO L93 Difference]: Finished difference Result 2439 states and 3431 transitions. [2025-03-08 21:06:58,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:58,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (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 103 [2025-03-08 21:06:58,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:58,966 INFO L225 Difference]: With dead ends: 2439 [2025-03-08 21:06:58,966 INFO L226 Difference]: Without dead ends: 2437 [2025-03-08 21:06:58,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:58,969 INFO L435 NwaCegarLoop]: 3356 mSDtfsCounter, 3385 mSDsluCounter, 3355 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3385 SdHoareTripleChecker+Valid, 6711 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:58,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3385 Valid, 6711 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:06:58,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2025-03-08 21:06:59,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2437. [2025-03-08 21:06:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2437 states, 1678 states have (on average 1.3092967818831942) internal successors, (2197), 1758 states have internal predecessors, (2197), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-03-08 21:06:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3429 transitions. [2025-03-08 21:06:59,072 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3429 transitions. Word has length 103 [2025-03-08 21:06:59,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:59,073 INFO L471 AbstractCegarLoop]: Abstraction has 2437 states and 3429 transitions. [2025-03-08 21:06:59,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 21:06:59,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3429 transitions. [2025-03-08 21:06:59,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 21:06:59,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:59,075 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:06:59,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:06:59,075 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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 27 more)] === [2025-03-08 21:06:59,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:59,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1123502731, now seen corresponding path program 1 times [2025-03-08 21:06:59,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:59,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921388315] [2025-03-08 21:06:59,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:59,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:59,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 21:06:59,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 21:06:59,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:59,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:59,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:06:59,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:59,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921388315] [2025-03-08 21:06:59,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921388315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:59,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:59,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:59,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324864505] [2025-03-08 21:06:59,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:59,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:59,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:59,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:59,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:59,952 INFO L87 Difference]: Start difference. First operand 2437 states and 3429 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 21:07:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:00,512 INFO L93 Difference]: Finished difference Result 2437 states and 3429 transitions. [2025-03-08 21:07:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:00,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 105 [2025-03-08 21:07:00,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:00,523 INFO L225 Difference]: With dead ends: 2437 [2025-03-08 21:07:00,524 INFO L226 Difference]: Without dead ends: 2435 [2025-03-08 21:07:00,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:00,526 INFO L435 NwaCegarLoop]: 3354 mSDtfsCounter, 3381 mSDsluCounter, 3353 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3381 SdHoareTripleChecker+Valid, 6707 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:00,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3381 Valid, 6707 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:07:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2025-03-08 21:07:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2435. [2025-03-08 21:07:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2435 states, 1677 states have (on average 1.3088849135360763) internal successors, (2195), 1756 states have internal predecessors, (2195), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-03-08 21:07:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3427 transitions. [2025-03-08 21:07:00,629 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3427 transitions. Word has length 105 [2025-03-08 21:07:00,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:00,630 INFO L471 AbstractCegarLoop]: Abstraction has 2435 states and 3427 transitions. [2025-03-08 21:07:00,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 21:07:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3427 transitions. [2025-03-08 21:07:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 21:07:00,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:00,631 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:07:00,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:07:00,631 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-03-08 21:07:00,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:00,632 INFO L85 PathProgramCache]: Analyzing trace with hash 682714151, now seen corresponding path program 1 times [2025-03-08 21:07:00,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:00,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381565197] [2025-03-08 21:07:00,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:00,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:01,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 21:07:01,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 21:07:01,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:01,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:07:01,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:01,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381565197] [2025-03-08 21:07:01,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381565197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:01,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:01,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:01,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784249594] [2025-03-08 21:07:01,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:01,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:01,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:01,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:01,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:01,753 INFO L87 Difference]: Start difference. First operand 2435 states and 3427 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 21:07:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:02,276 INFO L93 Difference]: Finished difference Result 2435 states and 3427 transitions. [2025-03-08 21:07:02,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:02,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (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 111 [2025-03-08 21:07:02,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:02,288 INFO L225 Difference]: With dead ends: 2435 [2025-03-08 21:07:02,288 INFO L226 Difference]: Without dead ends: 2433 [2025-03-08 21:07:02,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:02,291 INFO L435 NwaCegarLoop]: 3352 mSDtfsCounter, 3380 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3380 SdHoareTripleChecker+Valid, 6703 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:02,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3380 Valid, 6703 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:07:02,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2025-03-08 21:07:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 2433. [2025-03-08 21:07:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2433 states, 1676 states have (on average 1.308472553699284) internal successors, (2193), 1754 states have internal predecessors, (2193), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-03-08 21:07:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3425 transitions. [2025-03-08 21:07:02,396 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3425 transitions. Word has length 111 [2025-03-08 21:07:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:02,397 INFO L471 AbstractCegarLoop]: Abstraction has 2433 states and 3425 transitions. [2025-03-08 21:07:02,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 21:07:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3425 transitions. [2025-03-08 21:07:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 21:07:02,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:02,400 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:02,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:07:02,400 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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 27 more)] === [2025-03-08 21:07:02,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1739217486, now seen corresponding path program 1 times [2025-03-08 21:07:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:02,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126790031] [2025-03-08 21:07:02,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:02,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:03,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 21:07:03,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 21:07:03,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:03,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-08 21:07:03,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:03,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126790031] [2025-03-08 21:07:03,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126790031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:03,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:03,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:03,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938794871] [2025-03-08 21:07:03,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:03,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:03,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:03,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:03,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:03,289 INFO L87 Difference]: Start difference. First operand 2433 states and 3425 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 21:07:07,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 21:07:11,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:11,754 INFO L93 Difference]: Finished difference Result 4972 states and 6943 transitions. [2025-03-08 21:07:11,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:11,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2025-03-08 21:07:11,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:11,766 INFO L225 Difference]: With dead ends: 4972 [2025-03-08 21:07:11,767 INFO L226 Difference]: Without dead ends: 2569 [2025-03-08 21:07:11,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:11,776 INFO L435 NwaCegarLoop]: 3464 mSDtfsCounter, 3495 mSDsluCounter, 2228 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3495 SdHoareTripleChecker+Valid, 5692 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:11,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3495 Valid, 5692 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1359 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2025-03-08 21:07:11,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2025-03-08 21:07:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2545. [2025-03-08 21:07:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 1764 states have (on average 1.2981859410430838) internal successors, (2290), 1842 states have internal predecessors, (2290), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2025-03-08 21:07:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 3524 transitions. [2025-03-08 21:07:11,924 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 3524 transitions. Word has length 125 [2025-03-08 21:07:11,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:11,925 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 3524 transitions. [2025-03-08 21:07:11,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 21:07:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 3524 transitions. [2025-03-08 21:07:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 21:07:11,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:11,927 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:07:11,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 21:07:11,927 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-03-08 21:07:11,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:11,928 INFO L85 PathProgramCache]: Analyzing trace with hash -316538042, now seen corresponding path program 1 times [2025-03-08 21:07:11,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:11,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444598759] [2025-03-08 21:07:11,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:11,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:12,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 21:07:12,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 21:07:12,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:12,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:07:12,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:12,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444598759] [2025-03-08 21:07:12,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444598759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:12,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:12,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:12,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949575823] [2025-03-08 21:07:12,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:12,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:12,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:12,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:12,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:12,819 INFO L87 Difference]: Start difference. First operand 2545 states and 3524 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 21:07:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:13,269 INFO L93 Difference]: Finished difference Result 2545 states and 3524 transitions. [2025-03-08 21:07:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:13,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (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 117 [2025-03-08 21:07:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:13,277 INFO L225 Difference]: With dead ends: 2545 [2025-03-08 21:07:13,277 INFO L226 Difference]: Without dead ends: 2543 [2025-03-08 21:07:13,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:13,278 INFO L435 NwaCegarLoop]: 3349 mSDtfsCounter, 3376 mSDsluCounter, 3348 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3376 SdHoareTripleChecker+Valid, 6697 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:13,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3376 Valid, 6697 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:07:13,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2025-03-08 21:07:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2543. [2025-03-08 21:07:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2543 states, 1763 states have (on average 1.2972206466250709) internal successors, (2287), 1840 states have internal predecessors, (2287), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2025-03-08 21:07:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 3521 transitions. [2025-03-08 21:07:13,376 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 3521 transitions. Word has length 117 [2025-03-08 21:07:13,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:13,376 INFO L471 AbstractCegarLoop]: Abstraction has 2543 states and 3521 transitions. [2025-03-08 21:07:13,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 21:07:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3521 transitions. [2025-03-08 21:07:13,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 21:07:13,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:13,378 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:13,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:07:13,378 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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 27 more)] === [2025-03-08 21:07:13,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:13,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1115790989, now seen corresponding path program 1 times [2025-03-08 21:07:13,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:13,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431483389] [2025-03-08 21:07:13,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:13,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:14,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 21:07:14,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 21:07:14,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:14,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-08 21:07:14,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:14,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431483389] [2025-03-08 21:07:14,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431483389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:14,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:14,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:07:14,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513657804] [2025-03-08 21:07:14,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:14,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:07:14,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:14,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:07:14,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:07:14,247 INFO L87 Difference]: Start difference. First operand 2543 states and 3521 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 21:07:14,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:14,627 INFO L93 Difference]: Finished difference Result 5052 states and 6994 transitions. [2025-03-08 21:07:14,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:07:14,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 131 [2025-03-08 21:07:14,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:14,637 INFO L225 Difference]: With dead ends: 5052 [2025-03-08 21:07:14,637 INFO L226 Difference]: Without dead ends: 2539 [2025-03-08 21:07:14,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:07:14,645 INFO L435 NwaCegarLoop]: 3345 mSDtfsCounter, 3395 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3395 SdHoareTripleChecker+Valid, 3345 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:14,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3395 Valid, 3345 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:07:14,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2025-03-08 21:07:14,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2539. [2025-03-08 21:07:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2539 states, 1760 states have (on average 1.2965909090909091) internal successors, (2282), 1836 states have internal predecessors, (2282), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2025-03-08 21:07:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 3516 transitions. [2025-03-08 21:07:14,766 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 3516 transitions. Word has length 131 [2025-03-08 21:07:14,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:14,767 INFO L471 AbstractCegarLoop]: Abstraction has 2539 states and 3516 transitions. [2025-03-08 21:07:14,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 21:07:14,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 3516 transitions. [2025-03-08 21:07:14,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 21:07:14,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:14,769 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:07:14,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:07:14,769 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-03-08 21:07:14,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:14,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1478385315, now seen corresponding path program 1 times [2025-03-08 21:07:14,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:14,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461228527] [2025-03-08 21:07:14,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:14,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:15,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 21:07:15,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 21:07:15,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:15,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:07:15,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:15,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461228527] [2025-03-08 21:07:15,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461228527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:15,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:15,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:15,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561866977] [2025-03-08 21:07:15,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:15,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:15,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:15,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:15,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:15,684 INFO L87 Difference]: Start difference. First operand 2539 states and 3516 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 21:07:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:16,204 INFO L93 Difference]: Finished difference Result 2539 states and 3516 transitions. [2025-03-08 21:07:16,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:16,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (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 123 [2025-03-08 21:07:16,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:16,213 INFO L225 Difference]: With dead ends: 2539 [2025-03-08 21:07:16,213 INFO L226 Difference]: Without dead ends: 2537 [2025-03-08 21:07:16,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:16,214 INFO L435 NwaCegarLoop]: 3342 mSDtfsCounter, 3368 mSDsluCounter, 3341 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3368 SdHoareTripleChecker+Valid, 6683 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:16,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3368 Valid, 6683 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:07:16,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2025-03-08 21:07:16,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2537. [2025-03-08 21:07:16,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 1759 states have (on average 1.2956225127913588) internal successors, (2279), 1834 states have internal predecessors, (2279), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2025-03-08 21:07:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 3513 transitions. [2025-03-08 21:07:16,336 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 3513 transitions. Word has length 123 [2025-03-08 21:07:16,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:16,337 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 3513 transitions. [2025-03-08 21:07:16,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 21:07:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3513 transitions. [2025-03-08 21:07:16,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 21:07:16,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:16,339 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:16,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:07:16,340 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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 27 more)] === [2025-03-08 21:07:16,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:16,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1009705262, now seen corresponding path program 1 times [2025-03-08 21:07:16,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:16,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403292770] [2025-03-08 21:07:16,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:16,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:17,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 21:07:17,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 21:07:17,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:17,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 21:07:17,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:17,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403292770] [2025-03-08 21:07:17,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403292770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:07:17,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370566364] [2025-03-08 21:07:17,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:17,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:07:17,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:07:17,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:07:17,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 21:07:18,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 21:07:18,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 21:07:18,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:18,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:18,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 2575 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 21:07:18,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:07:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-08 21:07:19,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:07:19,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370566364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:19,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:07:19,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 21:07:19,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267680974] [2025-03-08 21:07:19,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:19,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:07:19,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:19,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:07:19,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:07:19,107 INFO L87 Difference]: Start difference. First operand 2537 states and 3513 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 21:07:19,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:19,381 INFO L93 Difference]: Finished difference Result 5040 states and 6978 transitions. [2025-03-08 21:07:19,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:07:19,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 137 [2025-03-08 21:07:19,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:19,389 INFO L225 Difference]: With dead ends: 5040 [2025-03-08 21:07:19,389 INFO L226 Difference]: Without dead ends: 2533 [2025-03-08 21:07:19,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:07:19,395 INFO L435 NwaCegarLoop]: 3338 mSDtfsCounter, 3369 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3369 SdHoareTripleChecker+Valid, 3338 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:19,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3369 Valid, 3338 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:07:19,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2025-03-08 21:07:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 2533. [2025-03-08 21:07:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2533 states, 1756 states have (on average 1.29498861047836) internal successors, (2274), 1830 states have internal predecessors, (2274), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2025-03-08 21:07:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 3508 transitions. [2025-03-08 21:07:19,508 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 3508 transitions. Word has length 137 [2025-03-08 21:07:19,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:19,509 INFO L471 AbstractCegarLoop]: Abstraction has 2533 states and 3508 transitions. [2025-03-08 21:07:19,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 21:07:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 3508 transitions. [2025-03-08 21:07:19,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 21:07:19,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:19,511 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:19,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 21:07:19,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 21:07:19,712 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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 27 more)] === [2025-03-08 21:07:19,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:19,712 INFO L85 PathProgramCache]: Analyzing trace with hash -2037648712, now seen corresponding path program 1 times [2025-03-08 21:07:19,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:19,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958496874] [2025-03-08 21:07:19,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:19,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:20,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 21:07:20,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 21:07:20,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:20,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:07:20,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:20,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958496874] [2025-03-08 21:07:20,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958496874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:20,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:20,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:20,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054909202] [2025-03-08 21:07:20,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:20,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:20,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:20,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:20,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:20,549 INFO L87 Difference]: Start difference. First operand 2533 states and 3508 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 21:07:21,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:21,009 INFO L93 Difference]: Finished difference Result 2533 states and 3508 transitions. [2025-03-08 21:07:21,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:21,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (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 129 [2025-03-08 21:07:21,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:21,017 INFO L225 Difference]: With dead ends: 2533 [2025-03-08 21:07:21,017 INFO L226 Difference]: Without dead ends: 2531 [2025-03-08 21:07:21,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:21,018 INFO L435 NwaCegarLoop]: 3335 mSDtfsCounter, 3360 mSDsluCounter, 3334 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3360 SdHoareTripleChecker+Valid, 6669 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:21,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3360 Valid, 6669 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:07:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2025-03-08 21:07:21,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2531. [2025-03-08 21:07:21,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 1755 states have (on average 1.294017094017094) internal successors, (2271), 1828 states have internal predecessors, (2271), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2025-03-08 21:07:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 3505 transitions. [2025-03-08 21:07:21,141 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 3505 transitions. Word has length 129 [2025-03-08 21:07:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:21,142 INFO L471 AbstractCegarLoop]: Abstraction has 2531 states and 3505 transitions. [2025-03-08 21:07:21,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 21:07:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3505 transitions. [2025-03-08 21:07:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 21:07:21,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:21,144 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:21,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 21:07:21,144 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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 27 more)] === [2025-03-08 21:07:21,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:21,144 INFO L85 PathProgramCache]: Analyzing trace with hash 295396143, now seen corresponding path program 1 times [2025-03-08 21:07:21,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:21,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493232200] [2025-03-08 21:07:21,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:21,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:21,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 21:07:21,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 21:07:21,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:21,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-08 21:07:22,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:22,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493232200] [2025-03-08 21:07:22,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493232200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:22,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:22,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:07:22,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038050268] [2025-03-08 21:07:22,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:22,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:07:22,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:22,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:07:22,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:22,234 INFO L87 Difference]: Start difference. First operand 2531 states and 3505 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 21:07:23,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:23,121 INFO L93 Difference]: Finished difference Result 3037 states and 4195 transitions. [2025-03-08 21:07:23,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:07:23,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 178 [2025-03-08 21:07:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:23,136 INFO L225 Difference]: With dead ends: 3037 [2025-03-08 21:07:23,136 INFO L226 Difference]: Without dead ends: 3035 [2025-03-08 21:07:23,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-08 21:07:23,138 INFO L435 NwaCegarLoop]: 3437 mSDtfsCounter, 2519 mSDsluCounter, 8310 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2520 SdHoareTripleChecker+Valid, 11747 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:23,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2520 Valid, 11747 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 21:07:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2025-03-08 21:07:23,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 3025. [2025-03-08 21:07:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3025 states, 2055 states have (on average 1.2832116788321168) internal successors, (2637), 2165 states have internal predecessors, (2637), 751 states have call successors, (751), 207 states have call predecessors, (751), 205 states have return successors, (799), 689 states have call predecessors, (799), 749 states have call successors, (799) [2025-03-08 21:07:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 4187 transitions. [2025-03-08 21:07:23,303 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 4187 transitions. Word has length 178 [2025-03-08 21:07:23,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:23,304 INFO L471 AbstractCegarLoop]: Abstraction has 3025 states and 4187 transitions. [2025-03-08 21:07:23,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 21:07:23,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 4187 transitions. [2025-03-08 21:07:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 21:07:23,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:23,306 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:23,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 21:07:23,306 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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 27 more)] === [2025-03-08 21:07:23,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:23,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1082013454, now seen corresponding path program 1 times [2025-03-08 21:07:23,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:23,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430978025] [2025-03-08 21:07:23,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:23,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:23,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 21:07:23,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 21:07:23,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:23,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:07:24,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:24,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430978025] [2025-03-08 21:07:24,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430978025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:24,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:24,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:24,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870795355] [2025-03-08 21:07:24,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:24,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:24,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:24,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:24,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:24,190 INFO L87 Difference]: Start difference. First operand 3025 states and 4187 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 21:07:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:24,778 INFO L93 Difference]: Finished difference Result 3025 states and 4187 transitions. [2025-03-08 21:07:24,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:24,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (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 135 [2025-03-08 21:07:24,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:24,788 INFO L225 Difference]: With dead ends: 3025 [2025-03-08 21:07:24,788 INFO L226 Difference]: Without dead ends: 3023 [2025-03-08 21:07:24,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:24,793 INFO L435 NwaCegarLoop]: 3333 mSDtfsCounter, 3357 mSDsluCounter, 3332 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3357 SdHoareTripleChecker+Valid, 6665 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:24,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3357 Valid, 6665 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:07:24,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2025-03-08 21:07:24,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 3023. [2025-03-08 21:07:24,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3023 states, 2054 states have (on average 1.2823758519961053) internal successors, (2634), 2163 states have internal predecessors, (2634), 751 states have call successors, (751), 207 states have call predecessors, (751), 205 states have return successors, (799), 689 states have call predecessors, (799), 749 states have call successors, (799) [2025-03-08 21:07:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3023 states to 3023 states and 4184 transitions. [2025-03-08 21:07:24,988 INFO L78 Accepts]: Start accepts. Automaton has 3023 states and 4184 transitions. Word has length 135 [2025-03-08 21:07:24,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:24,989 INFO L471 AbstractCegarLoop]: Abstraction has 3023 states and 4184 transitions. [2025-03-08 21:07:24,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 21:07:24,989 INFO L276 IsEmpty]: Start isEmpty. Operand 3023 states and 4184 transitions. [2025-03-08 21:07:24,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 21:07:24,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:24,990 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:24,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 21:07:24,990 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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 27 more)] === [2025-03-08 21:07:24,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:24,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1073936123, now seen corresponding path program 1 times [2025-03-08 21:07:24,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:24,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551282761] [2025-03-08 21:07:24,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:24,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:25,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 21:07:25,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 21:07:25,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:25,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:07:25,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:25,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551282761] [2025-03-08 21:07:25,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551282761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:25,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:25,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:25,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344037659] [2025-03-08 21:07:25,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:25,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:25,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:25,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:25,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:25,841 INFO L87 Difference]: Start difference. First operand 3023 states and 4184 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 21:07:26,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:26,355 INFO L93 Difference]: Finished difference Result 3023 states and 4184 transitions. [2025-03-08 21:07:26,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:26,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (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 141 [2025-03-08 21:07:26,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:26,366 INFO L225 Difference]: With dead ends: 3023 [2025-03-08 21:07:26,366 INFO L226 Difference]: Without dead ends: 3021 [2025-03-08 21:07:26,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:26,368 INFO L435 NwaCegarLoop]: 3331 mSDtfsCounter, 3354 mSDsluCounter, 3330 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3354 SdHoareTripleChecker+Valid, 6661 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:26,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3354 Valid, 6661 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:07:26,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2025-03-08 21:07:26,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 3021. [2025-03-08 21:07:26,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3021 states, 2053 states have (on average 1.281539210910862) internal successors, (2631), 2161 states have internal predecessors, (2631), 751 states have call successors, (751), 207 states have call predecessors, (751), 205 states have return successors, (799), 689 states have call predecessors, (799), 749 states have call successors, (799) [2025-03-08 21:07:26,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 3021 states and 4181 transitions. [2025-03-08 21:07:26,562 INFO L78 Accepts]: Start accepts. Automaton has 3021 states and 4181 transitions. Word has length 141 [2025-03-08 21:07:26,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:26,562 INFO L471 AbstractCegarLoop]: Abstraction has 3021 states and 4181 transitions. [2025-03-08 21:07:26,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 21:07:26,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 4181 transitions. [2025-03-08 21:07:26,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 21:07:26,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:26,564 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:26,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 21:07:26,564 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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 27 more)] === [2025-03-08 21:07:26,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:26,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1442731069, now seen corresponding path program 1 times [2025-03-08 21:07:26,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:26,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924278506] [2025-03-08 21:07:26,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:26,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:27,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 21:07:27,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 21:07:27,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:27,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:27,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:07:27,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:27,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924278506] [2025-03-08 21:07:27,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924278506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:27,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:27,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:27,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430941483] [2025-03-08 21:07:27,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:27,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:27,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:27,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:27,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:27,467 INFO L87 Difference]: Start difference. First operand 3021 states and 4181 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 21:07:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:27,872 INFO L93 Difference]: Finished difference Result 3021 states and 4181 transitions. [2025-03-08 21:07:27,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:27,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (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 147 [2025-03-08 21:07:27,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:27,888 INFO L225 Difference]: With dead ends: 3021 [2025-03-08 21:07:27,888 INFO L226 Difference]: Without dead ends: 3019 [2025-03-08 21:07:27,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:27,890 INFO L435 NwaCegarLoop]: 3329 mSDtfsCounter, 3351 mSDsluCounter, 3328 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3351 SdHoareTripleChecker+Valid, 6657 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:27,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3351 Valid, 6657 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:07:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2025-03-08 21:07:28,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3019. [2025-03-08 21:07:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 2052 states have (on average 1.280701754385965) internal successors, (2628), 2159 states have internal predecessors, (2628), 751 states have call successors, (751), 207 states have call predecessors, (751), 205 states have return successors, (799), 689 states have call predecessors, (799), 749 states have call successors, (799) [2025-03-08 21:07:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 4178 transitions. [2025-03-08 21:07:28,083 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 4178 transitions. Word has length 147 [2025-03-08 21:07:28,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:28,084 INFO L471 AbstractCegarLoop]: Abstraction has 3019 states and 4178 transitions. [2025-03-08 21:07:28,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 21:07:28,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 4178 transitions. [2025-03-08 21:07:28,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 21:07:28,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:28,086 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:28,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 21:07:28,086 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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 27 more)] === [2025-03-08 21:07:28,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:28,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1108835890, now seen corresponding path program 1 times [2025-03-08 21:07:28,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:28,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138015491] [2025-03-08 21:07:28,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:28,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:28,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 21:07:28,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 21:07:28,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:28,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:07:29,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:29,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138015491] [2025-03-08 21:07:29,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138015491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:29,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:29,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:29,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658829609] [2025-03-08 21:07:29,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:29,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:29,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:29,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:29,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:29,118 INFO L87 Difference]: Start difference. First operand 3019 states and 4178 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 21:07:29,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:29,602 INFO L93 Difference]: Finished difference Result 3019 states and 4178 transitions. [2025-03-08 21:07:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:29,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (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 153 [2025-03-08 21:07:29,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:29,612 INFO L225 Difference]: With dead ends: 3019 [2025-03-08 21:07:29,612 INFO L226 Difference]: Without dead ends: 3017 [2025-03-08 21:07:29,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:29,614 INFO L435 NwaCegarLoop]: 3327 mSDtfsCounter, 3348 mSDsluCounter, 3326 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3348 SdHoareTripleChecker+Valid, 6653 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:29,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3348 Valid, 6653 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:07:29,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2025-03-08 21:07:29,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 3017. [2025-03-08 21:07:29,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 2051 states have (on average 1.2798634812286689) internal successors, (2625), 2157 states have internal predecessors, (2625), 751 states have call successors, (751), 207 states have call predecessors, (751), 205 states have return successors, (799), 689 states have call predecessors, (799), 749 states have call successors, (799) [2025-03-08 21:07:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 4175 transitions. [2025-03-08 21:07:29,809 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 4175 transitions. Word has length 153 [2025-03-08 21:07:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:29,809 INFO L471 AbstractCegarLoop]: Abstraction has 3017 states and 4175 transitions. [2025-03-08 21:07:29,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 21:07:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 4175 transitions. [2025-03-08 21:07:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 21:07:29,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:29,811 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:29,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 21:07:29,811 INFO L396 AbstractCegarLoop]: === Iteration 24 === 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 27 more)] === [2025-03-08 21:07:29,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:29,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1684156839, now seen corresponding path program 1 times [2025-03-08 21:07:29,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:29,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711026000] [2025-03-08 21:07:29,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:29,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:30,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 21:07:30,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 21:07:30,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:30,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:07:30,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:30,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711026000] [2025-03-08 21:07:30,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711026000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:30,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:30,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:30,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897312578] [2025-03-08 21:07:30,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:30,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:30,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:30,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:30,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:30,592 INFO L87 Difference]: Start difference. First operand 3017 states and 4175 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 21:07:31,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:31,102 INFO L93 Difference]: Finished difference Result 3017 states and 4175 transitions. [2025-03-08 21:07:31,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:31,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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 159 [2025-03-08 21:07:31,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:31,112 INFO L225 Difference]: With dead ends: 3017 [2025-03-08 21:07:31,113 INFO L226 Difference]: Without dead ends: 3015 [2025-03-08 21:07:31,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:31,114 INFO L435 NwaCegarLoop]: 3325 mSDtfsCounter, 3345 mSDsluCounter, 3324 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3345 SdHoareTripleChecker+Valid, 6649 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:31,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3345 Valid, 6649 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:07:31,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2025-03-08 21:07:31,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 3015. [2025-03-08 21:07:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3015 states, 2050 states have (on average 1.2790243902439025) internal successors, (2622), 2155 states have internal predecessors, (2622), 751 states have call successors, (751), 207 states have call predecessors, (751), 205 states have return successors, (799), 689 states have call predecessors, (799), 749 states have call successors, (799) [2025-03-08 21:07:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 3015 states and 4172 transitions. [2025-03-08 21:07:31,318 INFO L78 Accepts]: Start accepts. Automaton has 3015 states and 4172 transitions. Word has length 159 [2025-03-08 21:07:31,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:31,318 INFO L471 AbstractCegarLoop]: Abstraction has 3015 states and 4172 transitions. [2025-03-08 21:07:31,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 21:07:31,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 4172 transitions. [2025-03-08 21:07:31,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 21:07:31,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:31,320 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:31,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 21:07:31,320 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-03-08 21:07:31,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:31,320 INFO L85 PathProgramCache]: Analyzing trace with hash 950805685, now seen corresponding path program 1 times [2025-03-08 21:07:31,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:31,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50311919] [2025-03-08 21:07:31,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:31,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms