./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--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-?-798a7b3-m [2025-03-04 05:54:15,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 05:54:15,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 05:54:15,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 05:54:15,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 05:54:15,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 05:54:15,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 05:54:15,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 05:54:15,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 05:54:15,471 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 05:54:15,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 05:54:15,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 05:54:15,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 05:54:15,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 05:54:15,472 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 05:54:15,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 05:54:15,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 05:54:15,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 05:54:15,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 05:54:15,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 05:54:15,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 05:54:15,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 05:54:15,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 05:54:15,475 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 05:54:15,475 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 05:54:15,475 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 05:54:15,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 05:54:15,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 05:54:15,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 05:54:15,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:54:15,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 05:54:15,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 05:54:15,476 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 05:54:15,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 05:54:15,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 05:54:15,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 05:54:15,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 05:54:15,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 05:54:15,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 05:54:15,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 05:54:15,476 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-04 05:54:15,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 05:54:15,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 05:54:15,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 05:54:15,713 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 05:54:15,714 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 05:54:15,715 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-04 05:54:16,933 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/410d18b35/0e3c3c1a006042e0907ef8f03f089ea2/FLAG08ceeaa7c [2025-03-04 05:54:17,428 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 05:54:17,429 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-04 05:54:17,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/410d18b35/0e3c3c1a006042e0907ef8f03f089ea2/FLAG08ceeaa7c [2025-03-04 05:54:17,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/410d18b35/0e3c3c1a006042e0907ef8f03f089ea2 [2025-03-04 05:54:17,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 05:54:17,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 05:54:17,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 05:54:17,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 05:54:17,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 05:54:17,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:54:17" (1/1) ... [2025-03-04 05:54:17,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436c86d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:54:17, skipping insertion in model container [2025-03-04 05:54:17,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:54:17" (1/1) ... [2025-03-04 05:54:17,598 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 05:54:20,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434581,434594] [2025-03-04 05:54:20,836 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,836 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,840 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,841 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,841 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,841 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,841 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,841 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,842 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,842 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,842 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,842 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,842 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,845 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,845 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,845 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,845 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,845 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,848 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,851 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,851 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,851 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,851 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,851 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,851 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:20,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:54:20,896 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 05:54:20,965 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-04 05:54:20,967 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-04 05:54:21,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,239 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,239 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,239 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,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[435671,435684] [2025-03-04 05:54:21,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[435830,435843] [2025-03-04 05:54:21,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,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[436714,436727] [2025-03-04 05:54:21,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[436865,436878] [2025-03-04 05:54:21,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[437016,437029] [2025-03-04 05:54:21,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[437168,437181] [2025-03-04 05:54:21,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[437317,437330] [2025-03-04 05:54:21,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[437465,437478] [2025-03-04 05:54:21,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[437622,437635] [2025-03-04 05:54:21,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[437771,437784] [2025-03-04 05:54:21,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[437927,437940] [2025-03-04 05:54:21,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[438080,438093] [2025-03-04 05:54:21,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[438226,438239] [2025-03-04 05:54:21,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[438369,438382] [2025-03-04 05:54:21,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[438521,438534] [2025-03-04 05:54:21,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[438667,438680] [2025-03-04 05:54:21,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[438812,438825] [2025-03-04 05:54:21,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[438966,438979] [2025-03-04 05:54:21,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[439117,439130] [2025-03-04 05:54:21,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[439272,439285] [2025-03-04 05:54:21,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[439424,439437] [2025-03-04 05:54:21,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[439579,439592] [2025-03-04 05:54:21,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[439743,439756] [2025-03-04 05:54:21,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[439899,439912] [2025-03-04 05:54:21,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[440063,440076] [2025-03-04 05:54:21,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[440205,440218] [2025-03-04 05:54:21,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[440363,440376] [2025-03-04 05:54:21,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[440530,440543] [2025-03-04 05:54:21,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[440689,440702] [2025-03-04 05:54:21,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[440848,440861] [2025-03-04 05:54:21,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[440997,441010] [2025-03-04 05:54:21,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[441144,441157] [2025-03-04 05:54:21,249 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,249 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,249 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,249 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,253 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,253 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,253 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,253 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,256 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,256 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,256 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,256 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-04 05:54:21,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:54:21,458 INFO L204 MainTranslator]: Completed translation [2025-03-04 05:54:21,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:54:21 WrapperNode [2025-03-04 05:54:21,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 05:54:21,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 05:54:21,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 05:54:21,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 05:54:21,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:54:21" (1/1) ... [2025-03-04 05:54:21,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:54:21" (1/1) ... [2025-03-04 05:54:21,772 INFO L138 Inliner]: procedures = 751, calls = 3543, calls flagged for inlining = 402, calls inlined = 238, statements flattened = 7395 [2025-03-04 05:54:21,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 05:54:21,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 05:54:21,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 05:54:21,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 05:54:21,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:54:21" (1/1) ... [2025-03-04 05:54:21,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:54:21" (1/1) ... [2025-03-04 05:54:21,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:54:21" (1/1) ... [2025-03-04 05:54:22,814 INFO L175 MemorySlicer]: Split 1107 memory accesses to 23 slices as follows [1, 2, 23, 2, 2, 3, 5, 1, 3, 905, 1, 2, 17, 46, 12, 4, 46, 7, 2, 17, 2, 2, 2]. 82 percent of accesses are in the largest equivalence class. The 85 initializations are split as follows [0, 0, 23, 0, 0, 3, 5, 0, 0, 32, 1, 2, 0, 0, 12, 0, 0, 7, 0, 0, 0, 0, 0]. The 433 writes are split as follows [0, 1, 0, 1, 1, 0, 0, 0, 3, 343, 0, 0, 17, 46, 0, 1, 0, 0, 0, 17, 1, 1, 1]. [2025-03-04 05:54:22,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:54:21" (1/1) ... [2025-03-04 05:54:22,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:54:21" (1/1) ... [2025-03-04 05:54:22,952 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:54:21" (1/1) ... [2025-03-04 05:54:22,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:54:21" (1/1) ... [2025-03-04 05:54:23,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:54:21" (1/1) ... [2025-03-04 05:54:23,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:54:21" (1/1) ... [2025-03-04 05:54:23,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 05:54:23,096 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 05:54:23,096 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 05:54:23,096 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 05:54:23,097 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:54:21" (1/1) ... [2025-03-04 05:54:23,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:54:23,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:54:23,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 05:54:23,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 05:54:23,155 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-03-04 05:54:23,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-03-04 05:54:23,156 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 05:54:23,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 05:54:23,156 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-04 05:54:23,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-04 05:54:23,156 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_delayed_work [2025-03-04 05:54:23,156 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_delayed_work [2025-03-04 05:54:23,156 INFO L130 BoogieDeclarations]: Found specification of procedure u132_disable [2025-03-04 05:54:23,157 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_disable [2025-03-04 05:54:23,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-04 05:54:23,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-04 05:54:23,157 INFO L130 BoogieDeclarations]: Found specification of procedure u132_remove [2025-03-04 05:54:23,157 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_remove [2025-03-04 05:54:23,157 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_init_kref [2025-03-04 05:54:23,157 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_init_kref [2025-03-04 05:54:23,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-03-04 05:54:23,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-03-04 05:54:23,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-03-04 05:54:23,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-03-04 05:54:23,158 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-04 05:54:23,158 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-04 05:54:23,158 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_put_kref [2025-03-04 05:54:23,158 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_put_kref [2025-03-04 05:54:23,158 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_read_pcimem [2025-03-04 05:54:23,158 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_read_pcimem [2025-03-04 05:54:23,158 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_requeue_work [2025-03-04 05:54:23,158 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_requeue_work [2025-03-04 05:54:23,158 INFO L130 BoogieDeclarations]: Found specification of procedure u132_bus_suspend [2025-03-04 05:54:23,158 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_bus_suspend [2025-03-04 05:54:23,158 INFO L130 BoogieDeclarations]: Found specification of procedure u132_get_frame [2025-03-04 05:54:23,158 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_get_frame [2025-03-04 05:54:23,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-04 05:54:23,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-04 05:54:23,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure edset_output [2025-03-04 05:54:23,159 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_output [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-03-04 05:54:23,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure read_roothub_info [2025-03-04 05:54:23,159 INFO L138 BoogieDeclarations]: Found implementation of procedure read_roothub_info [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_scheduler_lock_of_u132 [2025-03-04 05:54:23,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_scheduler_lock_of_u132 [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure edset_single [2025-03-04 05:54:23,159 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_single [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure edset_setup [2025-03-04 05:54:23,159 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_setup [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-03-04 05:54:23,159 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-04 05:54:23,159 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-03-04 05:54:23,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure u132_resume [2025-03-04 05:54:23,159 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_resume [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure ftdi_elan_gone_away [2025-03-04 05:54:23,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ftdi_elan_gone_away [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-04 05:54:23,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 05:54:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 05:54:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 05:54:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 05:54:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 05:54:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 05:54:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 05:54:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 05:54:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-04 05:54:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-04 05:54:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-04 05:54:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-03-04 05:54:23,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-03-04 05:54:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2025-03-04 05:54:23,161 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2025-03-04 05:54:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-04 05:54:23,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-04 05:54:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_cancel_work [2025-03-04 05:54:23,161 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_cancel_work [2025-03-04 05:54:23,162 INFO L130 BoogieDeclarations]: Found specification of procedure kref_get [2025-03-04 05:54:23,162 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_get [2025-03-04 05:54:23,162 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-04 05:54:23,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-04 05:54:23,162 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_unlink_urb_from_ep [2025-03-04 05:54:23,162 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_unlink_urb_from_ep [2025-03-04 05:54:23,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 05:54:23,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 05:54:23,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 05:54:23,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 05:54:23,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 05:54:23,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 05:54:23,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 05:54:23,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 05:54:23,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 05:54:23,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 05:54:23,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 05:54:23,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 05:54:23,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_ring_work_scheduler [2025-03-04 05:54:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_ring_work_scheduler [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-03-04 05:54:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-03-04 05:54:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-03-04 05:54:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-03-04 05:54:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure u132_u132_put_kref [2025-03-04 05:54:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_u132_put_kref [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-03-04 05:54:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-03-04 05:54:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_endp_work_scheduler [2025-03-04 05:54:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_endp_work_scheduler [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2025-03-04 05:54:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-04 05:54:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_monitor_work [2025-03-04 05:54:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_monitor_work [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure u132_monitor_requeue_work [2025-03-04 05:54:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_monitor_requeue_work [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_stop [2025-03-04 05:54:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_stop [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-04 05:54:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 05:54:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 05:54:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 05:54:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 05:54:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 05:54:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 05:54:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 05:54:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 05:54:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 05:54:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 05:54:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 05:54:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-04 05:54:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-04 05:54:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-04 05:54:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_giveback_urb [2025-03-04 05:54:23,167 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_giveback_urb [2025-03-04 05:54:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 05:54:23,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 05:54:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_write_pcimem [2025-03-04 05:54:23,167 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_write_pcimem [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_queue_work [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_queue_work [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_u132_module_lock [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_u132_module_lock [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_queue_work [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_queue_work [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_start [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_start [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_edset_input [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_edset_input [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure u132_to_hcd [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_to_hcd [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure u132_probe [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_probe [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sw_lock_of_u132 [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sw_lock_of_u132 [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure queue_delayed_work [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_delayed_work [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_init_kref [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_init_kref [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_sw_lock_of_u132 [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_sw_lock_of_u132 [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2025-03-04 05:54:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 05:54:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 05:54:23,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 05:54:23,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 05:54:23,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 05:54:23,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 05:54:23,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-04 05:54:23,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-04 05:54:23,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-04 05:54:23,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 05:54:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_get_kref [2025-03-04 05:54:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_get_kref [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-04 05:54:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure hcd_to_u132 [2025-03-04 05:54:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure hcd_to_u132 [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-03-04 05:54:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_giveback_urb [2025-03-04 05:54:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_giveback_urb [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure u132_bus_resume [2025-03-04 05:54:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_bus_resume [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_slock_of_u132_spin [2025-03-04 05:54:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_slock_of_u132_spin [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-03-04 05:54:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_delete [2025-03-04 05:54:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_delete [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_platdata [2025-03-04 05:54:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_platdata [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-04 05:54:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-04 05:54:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_put_kref [2025-03-04 05:54:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_put_kref [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 05:54:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_100 [2025-03-04 05:54:23,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_100 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-03-04 05:54:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 05:54:23,173 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 05:54:23,174 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_put_kref [2025-03-04 05:54:23,174 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_put_kref [2025-03-04 05:54:23,174 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-04 05:54:23,174 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-04 05:54:23,174 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-03-04 05:54:23,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-03-04 05:54:23,175 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_urb_dequeue [2025-03-04 05:54:23,175 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_urb_dequeue [2025-03-04 05:54:23,175 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-04 05:54:23,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-04 05:54:23,175 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-04 05:54:23,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-04 05:54:23,175 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2025-03-04 05:54:23,175 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2025-03-04 05:54:23,175 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_reset [2025-03-04 05:54:23,175 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_reset [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2025-03-04 05:54:23,176 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-04 05:54:23,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-04 05:54:23,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-03-04 05:54:23,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure port_power [2025-03-04 05:54:23,176 INFO L138 BoogieDeclarations]: Found implementation of procedure port_power [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-03-04 05:54:23,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-04 05:54:23,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 05:54:23,176 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-04 05:54:23,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-04 05:54:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-04 05:54:23,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_link_urb_to_ep [2025-03-04 05:54:23,177 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_link_urb_to_ep [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 05:54:23,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-04 05:54:23,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure kref_init [2025-03-04 05:54:23,177 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_init [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_scheduler_lock_of_u132 [2025-03-04 05:54:23,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_scheduler_lock_of_u132 [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_cancel_work [2025-03-04 05:54:23,177 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_cancel_work [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-04 05:54:23,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-04 05:54:23,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2025-03-04 05:54:23,177 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2025-03-04 05:54:23,177 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_u132_module_lock [2025-03-04 05:54:23,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_u132_module_lock [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 05:54:23,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 05:54:23,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 05:54:23,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 05:54:23,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 05:54:23,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 05:54:23,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 05:54:23,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 05:54:23,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 05:54:23,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 05:54:23,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 05:54:23,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-04 05:54:23,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-04 05:54:23,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-04 05:54:24,015 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 05:54:24,018 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 05:54:24,114 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 05:54:24,153 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17123: havoc #t~nondet1580; [2025-03-04 05:54:24,333 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4756: havoc #t~mem81.base, #t~mem81.offset; [2025-03-04 05:54:24,346 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17230: havoc #t~nondet1595; [2025-03-04 05:54:24,431 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17218: havoc usb_ftdi_elan_edset_output_#t~nondet1592#1; [2025-03-04 05:54:24,497 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5214: call ULTIMATE.dealloc(~#revision~0.base, ~#revision~0.offset);havoc ~#revision~0.base, ~#revision~0.offset; [2025-03-04 05:54:24,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17226: havoc usb_ftdi_elan_edset_single_#t~nondet1594#1; [2025-03-04 05:54:24,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17184: havoc #t~nondet1584; [2025-03-04 05:54:24,536 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17222: havoc usb_ftdi_elan_edset_setup_#t~nondet1593#1; [2025-03-04 05:54:24,680 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17241: havoc usb_hcd_check_unlink_urb_#t~nondet1597#1; [2025-03-04 05:54:24,783 INFO L1325 $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-04 05:54:24,789 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4395: havoc #t~mem17.base, #t~mem17.offset; [2025-03-04 05:54:24,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12903: havoc ldv_linux_usb_dev_atomic_add_return_#t~mem1430#1; [2025-03-04 05:54:25,090 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17210: havoc usb_ftdi_elan_edset_flush_#t~nondet1590#1; [2025-03-04 05:54:25,100 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17248: havoc #t~nondet1598; [2025-03-04 05:54:25,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17234: havoc #t~nondet1596; [2025-03-04 05:54:25,288 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4750: havoc dev_get_drvdata_#t~mem80#1.base, dev_get_drvdata_#t~mem80#1.offset; [2025-03-04 05:54:25,736 INFO L1325 $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-04 05:54:25,736 INFO L1325 $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-04 05:54:25,737 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17167: havoc #t~nondet1582; [2025-03-04 05:54:25,744 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17214: havoc #t~nondet1591; [2025-03-04 05:54:25,906 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17198: havoc usb_create_hcd_#t~ret1587#1.base, usb_create_hcd_#t~ret1587#1.offset; [2025-03-04 05:54:25,906 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4729: havoc kobject_name_#t~mem75#1.base, kobject_name_#t~mem75#1.offset; [2025-03-04 05:54:25,906 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4738: havoc dev_name_#t~mem78#1.base, dev_name_#t~mem78#1.offset; [2025-03-04 05:54:25,907 INFO L1325 $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-04 05:54:25,907 INFO L1325 $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-04 05:54:25,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17136: havoc device_wakeup_enable_#t~nondet1581#1; [2025-03-04 05:54:25,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17195: havoc usb_add_hcd_#t~nondet1586#1; [2025-03-04 05:54:25,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17188: havoc queue_delayed_work_on_#t~nondet1585#1; [2025-03-04 05:54:32,634 INFO L1325 $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-04 05:54:32,634 INFO L1325 $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-04 05:54:32,635 INFO L1325 $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-04 05:54:32,635 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17085: havoc __alloc_workqueue_key_#t~ret1578#1.base, __alloc_workqueue_key_#t~ret1578#1.offset; [2025-03-04 05:54:32,635 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10083-1: ldv___platform_driver_register_#res#1 := ldv___platform_driver_register_~arg0#1; [2025-03-04 05:54:32,635 INFO L1325 $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-04 05:54:32,635 INFO L1325 $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-04 05:54:32,635 INFO L1325 $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-04 05:54:32,635 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17110: havoc __platform_driver_register_#t~nondet1579#1; [2025-03-04 05:54:32,635 INFO L1325 $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-04 05:54:32,635 INFO L1325 $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-04 05:54:32,635 INFO L1325 $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-04 05:54:32,635 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17180: havoc prepare_to_wait_event_#t~nondet1583#1; [2025-03-04 05:54:32,635 INFO L1325 $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-04 05:54:32,635 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4437: havoc arch_irqs_disabled_flags_#t~bitwise25#1; [2025-03-04 05:54:32,635 INFO L1325 $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-04 05:54:32,635 INFO L1325 $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-04 05:54:32,635 INFO L1325 $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-04 05:54:32,635 INFO L1325 $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-04 05:54:32,635 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17202: havoc usb_disabled_#t~nondet1588#1; [2025-03-04 05:54:32,635 INFO L1325 $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-04 05:54:32,635 INFO L1325 $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-04 05:54:33,391 INFO L? ?]: Removed 2727 outVars from TransFormulas that were not future-live. [2025-03-04 05:54:33,391 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 05:54:33,478 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 05:54:33,478 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 05:54:33,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:54:33 BoogieIcfgContainer [2025-03-04 05:54:33,478 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 05:54:33,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 05:54:33,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 05:54:33,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 05:54:33,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 05:54:17" (1/3) ... [2025-03-04 05:54:33,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278079d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:54:33, skipping insertion in model container [2025-03-04 05:54:33,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:54:21" (2/3) ... [2025-03-04 05:54:33,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278079d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:54:33, skipping insertion in model container [2025-03-04 05:54:33,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:54:33" (3/3) ... [2025-03-04 05:54:33,491 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i [2025-03-04 05:54:33,503 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 05:54:33,507 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-04 05:54:33,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 05:54:33,690 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;@511d4171, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 05:54:33,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-04 05:54:33,701 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-04 05:54:33,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 05:54:33,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:33,708 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-04 05:54:33,708 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-04 05:54:33,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:33,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1046906396, now seen corresponding path program 1 times [2025-03-04 05:54:33,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:33,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749929819] [2025-03-04 05:54:33,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:33,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:34,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 05:54:34,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 05:54:34,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:34,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:35,319 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-04 05:54:35,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:35,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749929819] [2025-03-04 05:54:35,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749929819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:35,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:35,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:35,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930954498] [2025-03-04 05:54:35,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:35,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:35,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:35,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:35,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:35,347 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-04 05:54:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:35,986 INFO L93 Difference]: Finished difference Result 4870 states and 7161 transitions. [2025-03-04 05:54:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:35,989 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-04 05:54:35,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:36,009 INFO L225 Difference]: With dead ends: 4870 [2025-03-04 05:54:36,010 INFO L226 Difference]: Without dead ends: 2436 [2025-03-04 05:54:36,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:36,027 INFO L435 NwaCegarLoop]: 3390 mSDtfsCounter, 3426 mSDsluCounter, 3389 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3426 SdHoareTripleChecker+Valid, 6779 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-04 05:54:36,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3426 Valid, 6779 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:54:36,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2025-03-04 05:54:36,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2436. [2025-03-04 05:54:36,197 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-04 05:54:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2436 states and 3432 transitions. [2025-03-04 05:54:36,221 INFO L78 Accepts]: Start accepts. Automaton has 2436 states and 3432 transitions. Word has length 61 [2025-03-04 05:54:36,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:36,223 INFO L471 AbstractCegarLoop]: Abstraction has 2436 states and 3432 transitions. [2025-03-04 05:54:36,223 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-04 05:54:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 3432 transitions. [2025-03-04 05:54:36,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 05:54:36,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:36,226 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-04 05:54:36,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 05:54:36,226 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-04 05:54:36,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:36,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1750356117, now seen corresponding path program 1 times [2025-03-04 05:54:36,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:36,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023528890] [2025-03-04 05:54:36,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:36,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:36,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 05:54:36,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 05:54:36,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:36,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:37,309 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-04 05:54:37,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:37,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023528890] [2025-03-04 05:54:37,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023528890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:37,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:37,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:37,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506002558] [2025-03-04 05:54:37,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:37,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:37,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:37,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:37,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:37,312 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-04 05:54:37,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:37,917 INFO L93 Difference]: Finished difference Result 2436 states and 3432 transitions. [2025-03-04 05:54:37,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:37,918 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-04 05:54:37,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:37,936 INFO L225 Difference]: With dead ends: 2436 [2025-03-04 05:54:37,936 INFO L226 Difference]: Without dead ends: 2434 [2025-03-04 05:54:37,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:37,939 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.5s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:37,939 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.5s Time] [2025-03-04 05:54:37,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2025-03-04 05:54:38,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2025-03-04 05:54:38,094 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-04 05:54:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3430 transitions. [2025-03-04 05:54:38,113 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3430 transitions. Word has length 67 [2025-03-04 05:54:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:38,113 INFO L471 AbstractCegarLoop]: Abstraction has 2434 states and 3430 transitions. [2025-03-04 05:54:38,114 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-04 05:54:38,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3430 transitions. [2025-03-04 05:54:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 05:54:38,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:38,115 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-04 05:54:38,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 05:54:38,116 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-04 05:54:38,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:38,116 INFO L85 PathProgramCache]: Analyzing trace with hash 307323487, now seen corresponding path program 1 times [2025-03-04 05:54:38,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:38,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156706548] [2025-03-04 05:54:38,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:38,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:38,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 05:54:38,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 05:54:38,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:38,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:39,571 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-04 05:54:39,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:39,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156706548] [2025-03-04 05:54:39,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156706548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:39,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:39,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:54:39,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720560205] [2025-03-04 05:54:39,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:39,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:54:39,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:39,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:54:39,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:39,573 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-04 05:54:40,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:40,100 INFO L93 Difference]: Finished difference Result 2453 states and 3445 transitions. [2025-03-04 05:54:40,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:54:40,101 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-04 05:54:40,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:40,113 INFO L225 Difference]: With dead ends: 2453 [2025-03-04 05:54:40,113 INFO L226 Difference]: Without dead ends: 2451 [2025-03-04 05:54:40,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:54:40,114 INFO L435 NwaCegarLoop]: 3375 mSDtfsCounter, 3383 mSDsluCounter, 6775 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:40,115 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.4s Time] [2025-03-04 05:54:40,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2025-03-04 05:54:40,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2449. [2025-03-04 05:54:40,248 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-04 05:54:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 3442 transitions. [2025-03-04 05:54:40,263 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 3442 transitions. Word has length 69 [2025-03-04 05:54:40,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:40,263 INFO L471 AbstractCegarLoop]: Abstraction has 2449 states and 3442 transitions. [2025-03-04 05:54:40,264 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-04 05:54:40,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 3442 transitions. [2025-03-04 05:54:40,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 05:54:40,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:40,268 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-04 05:54:40,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 05:54:40,268 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-04 05:54:40,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1791335952, now seen corresponding path program 1 times [2025-03-04 05:54:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:40,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986076795] [2025-03-04 05:54:40,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:40,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:41,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 05:54:41,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 05:54:41,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:41,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:41,744 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-04 05:54:41,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:41,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986076795] [2025-03-04 05:54:41,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986076795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:41,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:41,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:41,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831207219] [2025-03-04 05:54:41,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:41,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:41,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:41,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:41,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:41,748 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-04 05:54:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:42,325 INFO L93 Difference]: Finished difference Result 2449 states and 3442 transitions. [2025-03-04 05:54:42,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:42,326 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-04 05:54:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:42,339 INFO L225 Difference]: With dead ends: 2449 [2025-03-04 05:54:42,339 INFO L226 Difference]: Without dead ends: 2447 [2025-03-04 05:54:42,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:42,341 INFO L435 NwaCegarLoop]: 3366 mSDtfsCounter, 3400 mSDsluCounter, 3365 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-04 05:54:42,341 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-04 05:54:42,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2025-03-04 05:54:42,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2447. [2025-03-04 05:54:42,419 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-04 05:54:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3440 transitions. [2025-03-04 05:54:42,432 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3440 transitions. Word has length 73 [2025-03-04 05:54:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:42,432 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 3440 transitions. [2025-03-04 05:54:42,432 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-04 05:54:42,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3440 transitions. [2025-03-04 05:54:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 05:54:42,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:42,434 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-04 05:54:42,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 05:54:42,434 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-04 05:54:42,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:42,435 INFO L85 PathProgramCache]: Analyzing trace with hash -556959073, now seen corresponding path program 1 times [2025-03-04 05:54:42,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:42,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49473543] [2025-03-04 05:54:42,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:42,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:43,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 05:54:43,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 05:54:43,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:43,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:43,627 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-04 05:54:43,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:43,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49473543] [2025-03-04 05:54:43,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49473543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:43,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:43,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:43,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827075867] [2025-03-04 05:54:43,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:43,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:43,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:43,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:43,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:43,629 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-04 05:54:44,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:44,102 INFO L93 Difference]: Finished difference Result 2447 states and 3440 transitions. [2025-03-04 05:54:44,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:44,103 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-04 05:54:44,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:44,118 INFO L225 Difference]: With dead ends: 2447 [2025-03-04 05:54:44,118 INFO L226 Difference]: Without dead ends: 2445 [2025-03-04 05:54:44,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:44,121 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-04 05:54:44,121 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-04 05:54:44,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2025-03-04 05:54:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2445. [2025-03-04 05:54:44,231 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-04 05:54:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3438 transitions. [2025-03-04 05:54:44,245 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3438 transitions. Word has length 79 [2025-03-04 05:54:44,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:44,246 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 3438 transitions. [2025-03-04 05:54:44,246 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-04 05:54:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3438 transitions. [2025-03-04 05:54:44,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 05:54:44,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:44,247 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-04 05:54:44,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 05:54:44,248 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-04 05:54:44,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:44,248 INFO L85 PathProgramCache]: Analyzing trace with hash 844469831, now seen corresponding path program 1 times [2025-03-04 05:54:44,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:44,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175672535] [2025-03-04 05:54:44,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:44,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:44,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 05:54:44,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 05:54:44,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:44,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:45,340 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-04 05:54:45,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:45,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175672535] [2025-03-04 05:54:45,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175672535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:45,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:45,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:54:45,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394905381] [2025-03-04 05:54:45,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:45,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:54:45,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:45,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:54:45,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:45,343 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-04 05:54:49,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:54:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:50,525 INFO L93 Difference]: Finished difference Result 2447 states and 3439 transitions. [2025-03-04 05:54:50,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:54:50,525 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-04 05:54:50,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:50,537 INFO L225 Difference]: With dead ends: 2447 [2025-03-04 05:54:50,537 INFO L226 Difference]: Without dead ends: 2445 [2025-03-04 05:54:50,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:54:50,539 INFO L435 NwaCegarLoop]: 3365 mSDtfsCounter, 25 mSDsluCounter, 10068 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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-04 05:54:50,539 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-04 05:54:50,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2025-03-04 05:54:50,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2445. [2025-03-04 05:54:50,649 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-04 05:54:50,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3437 transitions. [2025-03-04 05:54:50,661 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3437 transitions. Word has length 80 [2025-03-04 05:54:50,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:50,662 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 3437 transitions. [2025-03-04 05:54:50,662 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-04 05:54:50,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3437 transitions. [2025-03-04 05:54:50,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 05:54:50,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:50,663 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-04 05:54:50,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 05:54:50,663 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-04 05:54:50,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:50,663 INFO L85 PathProgramCache]: Analyzing trace with hash -906979327, now seen corresponding path program 1 times [2025-03-04 05:54:50,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:50,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5458397] [2025-03-04 05:54:50,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:50,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:51,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 05:54:51,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 05:54:51,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:51,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:51,739 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-04 05:54:51,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:51,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5458397] [2025-03-04 05:54:51,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5458397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:51,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:51,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:51,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115106222] [2025-03-04 05:54:51,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:51,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:51,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:51,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:51,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:51,742 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-04 05:54:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:52,534 INFO L93 Difference]: Finished difference Result 2445 states and 3437 transitions. [2025-03-04 05:54:52,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:52,535 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-04 05:54:52,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:52,551 INFO L225 Difference]: With dead ends: 2445 [2025-03-04 05:54:52,552 INFO L226 Difference]: Without dead ends: 2443 [2025-03-04 05:54:52,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:52,556 INFO L435 NwaCegarLoop]: 3362 mSDtfsCounter, 3394 mSDsluCounter, 3361 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2025-03-04 05:54:52,556 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.6s Time] [2025-03-04 05:54:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2443 states. [2025-03-04 05:54:52,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2443 to 2443. [2025-03-04 05:54:52,715 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-04 05:54:52,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3435 transitions. [2025-03-04 05:54:52,729 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3435 transitions. Word has length 85 [2025-03-04 05:54:52,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:52,730 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 3435 transitions. [2025-03-04 05:54:52,730 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-04 05:54:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3435 transitions. [2025-03-04 05:54:52,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 05:54:52,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:52,732 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-04 05:54:52,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 05:54:52,732 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-04 05:54:52,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1439166935, now seen corresponding path program 1 times [2025-03-04 05:54:52,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:52,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810784893] [2025-03-04 05:54:52,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:52,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:53,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 05:54:53,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 05:54:53,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:53,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:53,718 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-04 05:54:53,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:53,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810784893] [2025-03-04 05:54:53,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810784893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:53,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:53,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:53,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265406632] [2025-03-04 05:54:53,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:53,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:53,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:53,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:53,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:53,721 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-04 05:54:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:54,264 INFO L93 Difference]: Finished difference Result 2443 states and 3435 transitions. [2025-03-04 05:54:54,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:54,265 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-04 05:54:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:54,279 INFO L225 Difference]: With dead ends: 2443 [2025-03-04 05:54:54,279 INFO L226 Difference]: Without dead ends: 2441 [2025-03-04 05:54:54,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:54,281 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-04 05:54:54,282 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-04 05:54:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2025-03-04 05:54:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2441. [2025-03-04 05:54:54,415 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-04 05:54:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3433 transitions. [2025-03-04 05:54:54,424 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3433 transitions. Word has length 91 [2025-03-04 05:54:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:54,425 INFO L471 AbstractCegarLoop]: Abstraction has 2441 states and 3433 transitions. [2025-03-04 05:54:54,425 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-04 05:54:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3433 transitions. [2025-03-04 05:54:54,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 05:54:54,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:54,427 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-04 05:54:54,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 05:54:54,427 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-04 05:54:54,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:54,427 INFO L85 PathProgramCache]: Analyzing trace with hash 773695790, now seen corresponding path program 1 times [2025-03-04 05:54:54,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:54,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074580867] [2025-03-04 05:54:54,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:54,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:55,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 05:54:55,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 05:54:55,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:55,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:55,462 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-04 05:54:55,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:55,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074580867] [2025-03-04 05:54:55,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074580867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:55,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:55,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:55,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998153015] [2025-03-04 05:54:55,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:55,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:55,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:55,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:55,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:55,465 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-04 05:54:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:56,040 INFO L93 Difference]: Finished difference Result 2441 states and 3433 transitions. [2025-03-04 05:54:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:56,041 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-04 05:54:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:56,052 INFO L225 Difference]: With dead ends: 2441 [2025-03-04 05:54:56,052 INFO L226 Difference]: Without dead ends: 2439 [2025-03-04 05:54:56,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:56,054 INFO L435 NwaCegarLoop]: 3358 mSDtfsCounter, 3388 mSDsluCounter, 3357 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-04 05:54:56,054 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-04 05:54:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2025-03-04 05:54:56,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 2439. [2025-03-04 05:54:56,139 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-04 05:54:56,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 3431 transitions. [2025-03-04 05:54:56,147 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 3431 transitions. Word has length 97 [2025-03-04 05:54:56,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:56,149 INFO L471 AbstractCegarLoop]: Abstraction has 2439 states and 3431 transitions. [2025-03-04 05:54:56,149 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-04 05:54:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 3431 transitions. [2025-03-04 05:54:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 05:54:56,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:56,150 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-04 05:54:56,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 05:54:56,150 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-04 05:54:56,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:56,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1326203674, now seen corresponding path program 1 times [2025-03-04 05:54:56,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:56,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813221425] [2025-03-04 05:54:56,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:56,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:56,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 05:54:57,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 05:54:57,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:57,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:57,293 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-04 05:54:57,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:57,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813221425] [2025-03-04 05:54:57,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813221425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:57,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:57,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:57,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089616506] [2025-03-04 05:54:57,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:57,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:57,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:57,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:57,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:57,295 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-04 05:54:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:57,927 INFO L93 Difference]: Finished difference Result 2439 states and 3431 transitions. [2025-03-04 05:54:57,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:57,928 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-04 05:54:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:57,945 INFO L225 Difference]: With dead ends: 2439 [2025-03-04 05:54:57,945 INFO L226 Difference]: Without dead ends: 2437 [2025-03-04 05:54:57,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:57,946 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-04 05:54:57,946 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-04 05:54:57,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2025-03-04 05:54:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2437. [2025-03-04 05:54:58,042 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-04 05:54:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3429 transitions. [2025-03-04 05:54:58,053 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3429 transitions. Word has length 103 [2025-03-04 05:54:58,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:58,054 INFO L471 AbstractCegarLoop]: Abstraction has 2437 states and 3429 transitions. [2025-03-04 05:54:58,055 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-04 05:54:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3429 transitions. [2025-03-04 05:54:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 05:54:58,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:58,058 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-04 05:54:58,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 05:54:58,058 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-04 05:54:58,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:58,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1123502731, now seen corresponding path program 1 times [2025-03-04 05:54:58,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:58,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178170476] [2025-03-04 05:54:58,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:58,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:54:58,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 05:54:58,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 05:54:58,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:54:58,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:54:59,036 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-04 05:54:59,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:54:59,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178170476] [2025-03-04 05:54:59,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178170476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:54:59,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:54:59,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:54:59,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220003416] [2025-03-04 05:54:59,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:54:59,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:54:59,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:54:59,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:54:59,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:54:59,037 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-04 05:54:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:54:59,577 INFO L93 Difference]: Finished difference Result 2437 states and 3429 transitions. [2025-03-04 05:54:59,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:54:59,577 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-04 05:54:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:54:59,592 INFO L225 Difference]: With dead ends: 2437 [2025-03-04 05:54:59,592 INFO L226 Difference]: Without dead ends: 2435 [2025-03-04 05:54:59,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:54:59,594 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-04 05:54:59,595 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-04 05:54:59,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2025-03-04 05:54:59,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2435. [2025-03-04 05:54:59,687 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-04 05:54:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3427 transitions. [2025-03-04 05:54:59,697 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3427 transitions. Word has length 105 [2025-03-04 05:54:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:54:59,697 INFO L471 AbstractCegarLoop]: Abstraction has 2435 states and 3427 transitions. [2025-03-04 05:54:59,697 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-04 05:54:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3427 transitions. [2025-03-04 05:54:59,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 05:54:59,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:54:59,700 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-04 05:54:59,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 05:54:59,700 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-04 05:54:59,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:54:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash 682714151, now seen corresponding path program 1 times [2025-03-04 05:54:59,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:54:59,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502066089] [2025-03-04 05:54:59,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:54:59,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:00,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 05:55:00,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 05:55:00,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:00,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:00,582 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-04 05:55:00,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:00,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502066089] [2025-03-04 05:55:00,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502066089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:00,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:00,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:00,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311522289] [2025-03-04 05:55:00,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:00,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:00,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:00,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:00,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:00,584 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-04 05:55:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:01,041 INFO L93 Difference]: Finished difference Result 2435 states and 3427 transitions. [2025-03-04 05:55:01,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:01,041 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-04 05:55:01,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:01,049 INFO L225 Difference]: With dead ends: 2435 [2025-03-04 05:55:01,049 INFO L226 Difference]: Without dead ends: 2433 [2025-03-04 05:55:01,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:01,051 INFO L435 NwaCegarLoop]: 3352 mSDtfsCounter, 3380 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:01,051 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.3s Time] [2025-03-04 05:55:01,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2025-03-04 05:55:01,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 2433. [2025-03-04 05:55:01,190 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-04 05:55:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3425 transitions. [2025-03-04 05:55:01,204 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3425 transitions. Word has length 111 [2025-03-04 05:55:01,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:01,207 INFO L471 AbstractCegarLoop]: Abstraction has 2433 states and 3425 transitions. [2025-03-04 05:55:01,207 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-04 05:55:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3425 transitions. [2025-03-04 05:55:01,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 05:55:01,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:01,211 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-04 05:55:01,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 05:55:01,212 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-04 05:55:01,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:01,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1739217486, now seen corresponding path program 1 times [2025-03-04 05:55:01,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:01,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856140484] [2025-03-04 05:55:01,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:01,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:02,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 05:55:02,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 05:55:02,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:02,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:02,295 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-04 05:55:02,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:02,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856140484] [2025-03-04 05:55:02,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856140484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:02,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:02,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:02,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245391552] [2025-03-04 05:55:02,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:02,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:02,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:02,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:02,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:02,299 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-04 05:55:06,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:55:10,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:10,768 INFO L93 Difference]: Finished difference Result 4972 states and 6943 transitions. [2025-03-04 05:55:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:10,768 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-04 05:55:10,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:10,780 INFO L225 Difference]: With dead ends: 4972 [2025-03-04 05:55:10,780 INFO L226 Difference]: Without dead ends: 2569 [2025-03-04 05:55:10,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:10,788 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-04 05:55:10,788 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-04 05:55:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2025-03-04 05:55:10,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2545. [2025-03-04 05:55:10,902 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-04 05:55:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 3524 transitions. [2025-03-04 05:55:10,911 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 3524 transitions. Word has length 125 [2025-03-04 05:55:10,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:10,912 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 3524 transitions. [2025-03-04 05:55:10,912 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-04 05:55:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 3524 transitions. [2025-03-04 05:55:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 05:55:10,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:10,914 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-04 05:55:10,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 05:55:10,914 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-04 05:55:10,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:10,915 INFO L85 PathProgramCache]: Analyzing trace with hash -316538042, now seen corresponding path program 1 times [2025-03-04 05:55:10,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:10,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021717591] [2025-03-04 05:55:10,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:10,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:11,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 05:55:11,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 05:55:11,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:11,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:11,855 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-04 05:55:11,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:11,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021717591] [2025-03-04 05:55:11,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021717591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:11,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:11,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:11,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846703342] [2025-03-04 05:55:11,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:11,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:11,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:11,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:11,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:11,857 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-04 05:55:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:12,247 INFO L93 Difference]: Finished difference Result 2545 states and 3524 transitions. [2025-03-04 05:55:12,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:12,248 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-04 05:55:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:12,255 INFO L225 Difference]: With dead ends: 2545 [2025-03-04 05:55:12,255 INFO L226 Difference]: Without dead ends: 2543 [2025-03-04 05:55:12,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:12,256 INFO L435 NwaCegarLoop]: 3349 mSDtfsCounter, 3376 mSDsluCounter, 3348 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-04 05:55:12,257 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-04 05:55:12,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2025-03-04 05:55:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2543. [2025-03-04 05:55:12,362 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-04 05:55:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 3521 transitions. [2025-03-04 05:55:12,372 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 3521 transitions. Word has length 117 [2025-03-04 05:55:12,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:12,373 INFO L471 AbstractCegarLoop]: Abstraction has 2543 states and 3521 transitions. [2025-03-04 05:55:12,373 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-04 05:55:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3521 transitions. [2025-03-04 05:55:12,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 05:55:12,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:12,375 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-04 05:55:12,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 05:55:12,375 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-04 05:55:12,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:12,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1115790989, now seen corresponding path program 1 times [2025-03-04 05:55:12,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:12,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841314248] [2025-03-04 05:55:12,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:12,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:13,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 05:55:13,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 05:55:13,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:13,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:13,250 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-04 05:55:13,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:13,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841314248] [2025-03-04 05:55:13,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841314248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:13,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:13,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:55:13,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659027968] [2025-03-04 05:55:13,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:13,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:55:13,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:13,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:55:13,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:55:13,251 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-04 05:55:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:13,685 INFO L93 Difference]: Finished difference Result 5052 states and 6994 transitions. [2025-03-04 05:55:13,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:55:13,686 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-04 05:55:13,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:13,700 INFO L225 Difference]: With dead ends: 5052 [2025-03-04 05:55:13,700 INFO L226 Difference]: Without dead ends: 2539 [2025-03-04 05:55:13,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:55:13,709 INFO L435 NwaCegarLoop]: 3345 mSDtfsCounter, 3395 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-04 05:55:13,710 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-04 05:55:13,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2025-03-04 05:55:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2539. [2025-03-04 05:55:13,839 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-04 05:55:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 3516 transitions. [2025-03-04 05:55:13,851 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 3516 transitions. Word has length 131 [2025-03-04 05:55:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:13,851 INFO L471 AbstractCegarLoop]: Abstraction has 2539 states and 3516 transitions. [2025-03-04 05:55:13,852 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-04 05:55:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 3516 transitions. [2025-03-04 05:55:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 05:55:13,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:13,853 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-04 05:55:13,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 05:55:13,853 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-04 05:55:13,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:13,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1478385315, now seen corresponding path program 1 times [2025-03-04 05:55:13,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:13,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017431398] [2025-03-04 05:55:13,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:13,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:14,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 05:55:14,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 05:55:14,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:14,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:14,888 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-04 05:55:14,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:14,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017431398] [2025-03-04 05:55:14,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017431398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:14,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:14,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:14,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691713000] [2025-03-04 05:55:14,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:14,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:14,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:14,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:14,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:14,890 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-04 05:55:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:15,522 INFO L93 Difference]: Finished difference Result 2539 states and 3516 transitions. [2025-03-04 05:55:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:15,523 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-04 05:55:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:15,532 INFO L225 Difference]: With dead ends: 2539 [2025-03-04 05:55:15,532 INFO L226 Difference]: Without dead ends: 2537 [2025-03-04 05:55:15,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:15,535 INFO L435 NwaCegarLoop]: 3342 mSDtfsCounter, 3368 mSDsluCounter, 3341 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:15,535 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.5s Time] [2025-03-04 05:55:15,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2025-03-04 05:55:15,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2537. [2025-03-04 05:55:15,694 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-04 05:55:15,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 3513 transitions. [2025-03-04 05:55:15,705 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 3513 transitions. Word has length 123 [2025-03-04 05:55:15,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:15,705 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 3513 transitions. [2025-03-04 05:55:15,705 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-04 05:55:15,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3513 transitions. [2025-03-04 05:55:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 05:55:15,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:15,708 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-04 05:55:15,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 05:55:15,708 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-04 05:55:15,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:15,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1009705262, now seen corresponding path program 1 times [2025-03-04 05:55:15,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:15,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069795756] [2025-03-04 05:55:15,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:15,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:16,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 05:55:16,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 05:55:16,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:16,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:16,637 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-04 05:55:16,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:16,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069795756] [2025-03-04 05:55:16,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069795756] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:55:16,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760254726] [2025-03-04 05:55:16,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:16,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:55:16,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:55:16,639 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:55:16,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 05:55:18,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 05:55:18,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 05:55:18,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:18,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:18,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 2575 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 05:55:18,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:55:18,418 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-04 05:55:18,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:55:18,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760254726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:18,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:55:18,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-04 05:55:18,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884344706] [2025-03-04 05:55:18,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:18,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:55:18,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:18,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:55:18,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:55:18,419 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-04 05:55:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:18,771 INFO L93 Difference]: Finished difference Result 5040 states and 6978 transitions. [2025-03-04 05:55:18,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:55:18,771 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-04 05:55:18,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:18,781 INFO L225 Difference]: With dead ends: 5040 [2025-03-04 05:55:18,781 INFO L226 Difference]: Without dead ends: 2533 [2025-03-04 05:55:18,787 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-04 05:55:18,788 INFO L435 NwaCegarLoop]: 3338 mSDtfsCounter, 3369 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-04 05:55:18,788 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-04 05:55:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2025-03-04 05:55:18,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 2533. [2025-03-04 05:55:18,909 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-04 05:55:18,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 3508 transitions. [2025-03-04 05:55:18,917 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 3508 transitions. Word has length 137 [2025-03-04 05:55:18,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:18,918 INFO L471 AbstractCegarLoop]: Abstraction has 2533 states and 3508 transitions. [2025-03-04 05:55:18,919 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-04 05:55:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 3508 transitions. [2025-03-04 05:55:18,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 05:55:18,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:18,921 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-04 05:55:18,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 05:55:19,121 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-04 05:55:19,122 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-04 05:55:19,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:19,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2037648712, now seen corresponding path program 1 times [2025-03-04 05:55:19,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:19,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313497105] [2025-03-04 05:55:19,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:19,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:19,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 05:55:19,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 05:55:19,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:19,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:20,010 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-04 05:55:20,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:20,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313497105] [2025-03-04 05:55:20,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313497105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:20,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:20,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:20,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546828246] [2025-03-04 05:55:20,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:20,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:20,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:20,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:20,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:20,012 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-04 05:55:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:20,454 INFO L93 Difference]: Finished difference Result 2533 states and 3508 transitions. [2025-03-04 05:55:20,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:20,455 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-04 05:55:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:20,465 INFO L225 Difference]: With dead ends: 2533 [2025-03-04 05:55:20,465 INFO L226 Difference]: Without dead ends: 2531 [2025-03-04 05:55:20,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:20,467 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-04 05:55:20,467 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-04 05:55:20,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2025-03-04 05:55:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2531. [2025-03-04 05:55:20,620 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-04 05:55:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 3505 transitions. [2025-03-04 05:55:20,630 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 3505 transitions. Word has length 129 [2025-03-04 05:55:20,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:20,631 INFO L471 AbstractCegarLoop]: Abstraction has 2531 states and 3505 transitions. [2025-03-04 05:55:20,631 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-04 05:55:20,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3505 transitions. [2025-03-04 05:55:20,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-04 05:55:20,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:20,633 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-04 05:55:20,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 05:55:20,634 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-04 05:55:20,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:20,634 INFO L85 PathProgramCache]: Analyzing trace with hash 295396143, now seen corresponding path program 1 times [2025-03-04 05:55:20,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:20,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373455188] [2025-03-04 05:55:20,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:20,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:21,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 05:55:21,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 05:55:21,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:21,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-04 05:55:21,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:21,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373455188] [2025-03-04 05:55:21,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373455188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:21,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:21,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:55:21,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268603964] [2025-03-04 05:55:21,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:21,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:55:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:21,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:55:21,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:21,976 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-04 05:55:22,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:22,832 INFO L93 Difference]: Finished difference Result 3037 states and 4195 transitions. [2025-03-04 05:55:22,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:55:22,833 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-04 05:55:22,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:22,845 INFO L225 Difference]: With dead ends: 3037 [2025-03-04 05:55:22,846 INFO L226 Difference]: Without dead ends: 3035 [2025-03-04 05:55:22,847 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-04 05:55:22,848 INFO L435 NwaCegarLoop]: 3435 mSDtfsCounter, 2519 mSDsluCounter, 8306 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2520 SdHoareTripleChecker+Valid, 11741 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.6s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:22,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2520 Valid, 11741 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 05:55:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2025-03-04 05:55:23,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 3025. [2025-03-04 05:55:23,059 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-04 05:55:23,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 4187 transitions. [2025-03-04 05:55:23,071 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 4187 transitions. Word has length 178 [2025-03-04 05:55:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:23,072 INFO L471 AbstractCegarLoop]: Abstraction has 3025 states and 4187 transitions. [2025-03-04 05:55:23,072 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-04 05:55:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 4187 transitions. [2025-03-04 05:55:23,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 05:55:23,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:23,074 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-04 05:55:23,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 05:55:23,074 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-04 05:55:23,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:23,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1082013454, now seen corresponding path program 1 times [2025-03-04 05:55:23,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:23,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242406705] [2025-03-04 05:55:23,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:23,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:23,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 05:55:23,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 05:55:23,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:23,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:24,044 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-04 05:55:24,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:24,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242406705] [2025-03-04 05:55:24,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242406705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:24,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:24,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:24,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727615161] [2025-03-04 05:55:24,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:24,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:24,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:24,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:24,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:24,046 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-04 05:55:24,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:24,728 INFO L93 Difference]: Finished difference Result 3025 states and 4187 transitions. [2025-03-04 05:55:24,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:24,729 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-04 05:55:24,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:24,739 INFO L225 Difference]: With dead ends: 3025 [2025-03-04 05:55:24,739 INFO L226 Difference]: Without dead ends: 3023 [2025-03-04 05:55:24,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:24,741 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-04 05:55:24,741 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-04 05:55:24,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2025-03-04 05:55:24,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 3023. [2025-03-04 05:55:24,904 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-04 05:55:24,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3023 states to 3023 states and 4184 transitions. [2025-03-04 05:55:24,916 INFO L78 Accepts]: Start accepts. Automaton has 3023 states and 4184 transitions. Word has length 135 [2025-03-04 05:55:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:24,917 INFO L471 AbstractCegarLoop]: Abstraction has 3023 states and 4184 transitions. [2025-03-04 05:55:24,917 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-04 05:55:24,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3023 states and 4184 transitions. [2025-03-04 05:55:24,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 05:55:24,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:24,919 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-04 05:55:24,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 05:55:24,919 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-04 05:55:24,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:24,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1073936123, now seen corresponding path program 1 times [2025-03-04 05:55:24,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:24,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563772635] [2025-03-04 05:55:24,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:24,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:25,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 05:55:25,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 05:55:25,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:25,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:25,867 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-04 05:55:25,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:25,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563772635] [2025-03-04 05:55:25,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563772635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:25,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:25,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:25,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754389176] [2025-03-04 05:55:25,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:25,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:25,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:25,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:25,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:25,869 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-04 05:55:26,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:26,348 INFO L93 Difference]: Finished difference Result 3023 states and 4184 transitions. [2025-03-04 05:55:26,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:26,349 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-04 05:55:26,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:26,359 INFO L225 Difference]: With dead ends: 3023 [2025-03-04 05:55:26,359 INFO L226 Difference]: Without dead ends: 3021 [2025-03-04 05:55:26,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:26,361 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-04 05:55:26,362 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-04 05:55:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2025-03-04 05:55:26,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 3021. [2025-03-04 05:55:26,543 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-04 05:55:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 3021 states and 4181 transitions. [2025-03-04 05:55:26,554 INFO L78 Accepts]: Start accepts. Automaton has 3021 states and 4181 transitions. Word has length 141 [2025-03-04 05:55:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:26,555 INFO L471 AbstractCegarLoop]: Abstraction has 3021 states and 4181 transitions. [2025-03-04 05:55:26,555 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-04 05:55:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 4181 transitions. [2025-03-04 05:55:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 05:55:26,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:26,557 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-04 05:55:26,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 05:55:26,557 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-04 05:55:26,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:26,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1442731069, now seen corresponding path program 1 times [2025-03-04 05:55:26,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:26,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53160899] [2025-03-04 05:55:26,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:26,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:27,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 05:55:27,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 05:55:27,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:27,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:27,585 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-04 05:55:27,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:27,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53160899] [2025-03-04 05:55:27,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53160899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:27,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:27,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:27,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922142610] [2025-03-04 05:55:27,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:27,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:27,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:27,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:27,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:27,587 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-04 05:55:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:28,085 INFO L93 Difference]: Finished difference Result 3021 states and 4181 transitions. [2025-03-04 05:55:28,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:28,086 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-04 05:55:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:28,099 INFO L225 Difference]: With dead ends: 3021 [2025-03-04 05:55:28,099 INFO L226 Difference]: Without dead ends: 3019 [2025-03-04 05:55:28,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:28,106 INFO L435 NwaCegarLoop]: 3329 mSDtfsCounter, 3351 mSDsluCounter, 3328 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:28,108 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.3s Time] [2025-03-04 05:55:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2025-03-04 05:55:28,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3019. [2025-03-04 05:55:28,366 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-04 05:55:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 4178 transitions. [2025-03-04 05:55:28,375 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 4178 transitions. Word has length 147 [2025-03-04 05:55:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:28,376 INFO L471 AbstractCegarLoop]: Abstraction has 3019 states and 4178 transitions. [2025-03-04 05:55:28,376 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-04 05:55:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 4178 transitions. [2025-03-04 05:55:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 05:55:28,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:28,379 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-04 05:55:28,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 05:55:28,379 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-04 05:55:28,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1108835890, now seen corresponding path program 1 times [2025-03-04 05:55:28,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:28,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334999990] [2025-03-04 05:55:28,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:28,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms